1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T644,#include using namespace std; #define int long long const int MX = 3e5+2, INF = INT_MAX; int po[MX]; tuple qry[MX]; int seg[MX*2]; int n, m; void update(int l, int r, int v) { l += m, r += m; while(l < r) { if(l&1) { seg[l] += v; seg[l] = min(seg[l], INF); l++; } if(r&1) { r--; seg[r] += v; seg[r] = min(seg[r], INF); } l /= 2; r /= 2; } } int query(int p) { int res = 0; p += m; while(p) { res += seg[p]; p /= 2; } return res; } int l[MX], r[MX]; vector pbs[MX], own[MX]; int32_t main() { ios::sync_with_stdio(0);cin.tie(0); cin >> n >> m; for(int i=0; i> t; t--; own[t].push_back(i); } for(int i=0; i> po[i]; } int q; cin >> q; for(int i=1; i<=q; i++) { auto& [a, b, c] = qry[i]; cin >> a >> b >> c; a--; b--; } for(int i=0; i

코드 #3882