1a: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","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"CodeViewer"] 1b:T746,#if 01 #include #include #include typedef long long ll; using namespace std; struct Query { int l, r, idx; }; int main(void) { ios_base::sync_with_stdio(false); cin.tie(0); int n, q; cin >> n >> q; vector a(n); for (int &x: a) { cin >> x; } vector comp = a; sort(comp.begin(), comp.end()); comp.erase(unique(comp.begin(), comp.end()), comp.end()); for (int &x: a) { x = lower_bound(comp.begin(), comp.end(), x) - comp.begin(); } int m = comp.size(); vector qs(q); for (int i = 0; i < q; i++) { cin >> qs[i].l >> qs[i].r; --qs[i].l, --qs[i].r; qs[i].idx = i; } int block = max((int)(sqrt(n)), 1); sort(qs.begin(), qs.end(), [&](const Query &x, const Query &y) { int bx = x.l / block, by = y.l / block; if (bx != by) { return bx < by; } return bx & 1 ? x.r > y.r : x.r < y.r; }); vector freq(m), ans(q); ll twice = 0; int cl = 0, cr = -1; auto add = [&](int idx) { int f = ++freq[a[idx]]; if (f == 2) { ++twice; } else if (f == 3) { --twice; } }; auto remove = [&](int idx) { int f = --freq[a[idx]]; if (f == 2) { ++twice; } else if (f == 1)

제출 #110589

제출 정보

제출 결과

제출 코드

찾은 반례