1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","643","static/chunks/app/codes/%5Bid%5D/page-7c5a09ccd6f58860.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","643","static/chunks/app/codes/%5Bid%5D/page-7c5a09ccd6f58860.js"],"CodeViewer"] 1c:T512,#include using namespace std; #define int long long const int MX = 3e5+2, MXT = 1<<22; int arr[3][MX], seg[MXT*2]; int32_t main() { ios::sync_with_stdio(0);cin.tie(0); int n; cin >> n; vector v[3]; for(int i=0; i<3; i++) { for(int j=0; j> arr[i][j]; } } for(int i=0; i> q; while(q--) { int val; cin >> val; if(val >= MXT) { cout << "0\n"; continue; } int p = 1; while(p < MXT) { if(val < seg[p*2]) { p *= 2; } else { val -= seg[p*2]; p = p*2+1; } } assert(seg[p]); seg[p] = 0; int t = p; while(t /= 2) { seg[t] = seg[t*2] + seg[t*2+1]; } p -= MXT; //printf("real p is %d\n", p); int cnt[3] = {0, }; for(int i=0; i<3; i++) { cnt[i] = v[i].end() - lower_bound(v[i].begin(), v[i].end(), p); //printf("cnt %d = %d | ", i, cnt[i]); } cnt[1] -= cnt[0]; cnt[2] -= cnt[1] + cnt[0]; //printf("\n"); cout << cnt[0] + cnt[1]*2 + cnt[2]*5 << '\n'; } }5:["$","div",null,{"className":"container mx-auto px-4","children

코드 #2654