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:T70f,#include using namespace std; #define int long long #define rep(i, N) for(int i=0; isync_with_stdio(0); int N, M, Q; cin >> N >> M; vector>> buk(N+2); rep(i, M) { int l, r, x; cin >> l >> r >> x; buk[l].push_back({i, x}); buk[r+1].push_back({i, -x}); } cin >> Q; vector ans(Q); vector>> query_buk(N+1); rep(i, Q) { int k, s, t; cin >> k >> s >> t; query_buk[k].push_back({i, s, t}); } for(int q=1; q<=N; q++) { // printf("q = %lld\n", q); for(auto [i, x]: buk[q]) { seg_update(i, x);

코드 #5351