제출 #942724

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
942724		Foolestboy	Sum Zero (RMI20_sumzero)	C++14	61 / 100	1056 ms	13812 KiB

sumzero

#include <bits/stdc++.h>

#define SQR(x)    (1LL * ((x) * (x)))
#define MASK(i)   (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
#define fi        first
#define se        second
#define pb        push_back
#define all(x)    x.begin(), x.end()
#define rall(x)   x.rbegin(), x.rend()
#define sz(s)     (int)s.size()
#define prev      __prev
#define next      __next
#define left      __left
#define right     __right

#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef unsigned int ui;

using namespace std;

const int mod = 1e9 + 7;
const int INF = 1e9 + 7;
const ll INFLL = (ll)2e18 + 7LL;
const ld PI = acos(-1);

const int dx[] = {1, -1, 0, 0, -1, 1, 1, -1};
const int dy[] = {0, 0, 1, -1, -1, -1, 1, 1};

template<class BUI, class TRONG>
    bool minimize(BUI &x, const TRONG y){
        if(x > y){
            x = y;
            return true;
        } else return false;
    }
template<class BUI, class TRONG>
    bool maximize(BUI &x, const TRONG y){
        if(x < y){
            x = y;
            return true;
        } else return false;
    }

/* Author : Bui Nguyen Duc Trong, Luong Van Chanh High School for the gifted*/
/* Template is copied by Trong */

                           /** Losing in Provincial Contests **/
                                    /** TRYING HARDER**/
                                   /**      ORZ     **/

/* -----------------[ MAIN CODE GOES HERE ]----------------- */

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int N = 4e5 + 10;

int n, q;
ll a[N];
vector<ll> val;
int f[N];
int lst[N];
int nxt[N], z[N];

int Rand(int l, int r) { return l + rng() % (r - l + 1); }

void solve(){
    cin >> n;
    for(int i = 1; i <= n; i++) cin >> a[i];
    for(int i = 1; i <= n; i++) a[i] += a[i - 1], val.push_back(a[i]);
    val.push_back(0);
    sort(all(val)); val.resize(unique(all(val)) - val.begin());
    for(int i = 0; i <= n; i++) a[i] = lower_bound(all(val), a[i]) - val.begin();
    for(int i = 0; i <= n + 1; i++) nxt[i] = z[i] = n + 1;
    for(int i = n; i >= 0; i--){
        nxt[i] = min(nxt[i + 1], z[a[i]]);
        z[a[i]] = i;
    }
    memset(lst, -1, sizeof lst);
    cin >> q;
    while(q--){
        int l, r; cin >> l >> r;
//        for(int i = l; i <= r; i++){
//            lst[a[i - 1]] = i - 1;
//            maximize(f[i], f[i - 1]);
//            if(lst[a[i]] > -1) maximize(f[i], f[lst[a[i]]] + 1);
//        }
//        cout << f[r] << '\n';
//        for(int i = l; i <= r; i++) lst[a[i - 1]] = -1, f[i] = 0;
        int ans = 0;
        int p = l - 1;
        while(p <= r){
            ans++;
            p = nxt[p];
        }
        cout << ans - 1 << '\n';
    }
}
/*
10
1 2 -3 0 1 -4 3 2 -1 1
3
1 10
1 5
2 9
*/

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

    const bool multitest = 0;
    int tt = 1; if(multitest) cin >> tt;

    while( tt-- ){

        solve();

    }

    return 0;
}

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