제출 #834843

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
834843		LucaLucaM	Sum Zero (RMI20_sumzero)	C++17	22 / 100	116 ms	30800 KiB

sumzero

#include <bits/stdc++.h>
#warning That's the baby, that's not my baby

typedef long long ll;

using namespace std;

const int NMAX = 4e5;
const int QMAX = 4e5;

vector<pair<int, int>>queries[QMAX + 1];
int answer[QMAX + 1];

ll sum[NMAX + 5];

vector<int>g[NMAX + 1];

int top;
map<ll, int>pos;

void dfs (int u) {
    pos[u] = 1;
    sum[++top] = u;

    for (const auto &[pos, index] : queries[u]) {

        int l = 1, r = top;
        while (l < r) {
            int mid = (l + r) / 2;
            if (pos >= sum[mid]) {
                r = mid;
            } else {
                l = mid + 1;
            }
        }
        answer[index] = top - r;
    }

    for (const auto &v : g[u]) {
        if (!pos.count(v)) {
            dfs(v);
        }
    }
    top--;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> sum[i];
        sum[i] += sum[i - 1];
    }

    int prv = n + 2;

    for (int i = n; i > 0; i--) {
        pos[sum[i]] = i;
        int nxt;
        if (!pos.count(sum[i - 1])) {
            nxt = n + 2;
        } else {
            nxt = pos[sum[i - 1]] + 1;
        }
        nxt = min(nxt, prv);
        prv = nxt;
        g[nxt].push_back(i);
    }

    int q;
    cin >> q;

    for (int i = 1; i <= q; i++) {
        int l, r;
        cin >> l >> r;
        queries[l].push_back({r + 1, i});
    }

    pos.clear();

    for (int i = n + 2; i > 0; i--) {
        if (!pos.count(i)) {
            dfs(i);
        }
    }

    for (int i = 1; i <= q; i++) {
        cout << answer[i] << '\n';
    }

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

sumzero.cpp:2:2: warning: #warning That's the baby, that's not my baby [-Wcpp]
    2 | #warning That's the baby, that's not my baby
      |  ^~~~~~~

• Subtask 1: 22 / 22
• Subtask 2: 0 / 39
• Subtask 3: 0 / 39