Submission #979006

#	Time	Username	Problem	Language	Result	Execution time	Memory
979006		NintsiChkhaidze	Sum Zero (RMI20_sumzero)	C++17	61 / 100	628 ms	23320 KiB

sumzero

#include <bits/stdc++.h>
#define ll long long
#define s second
#define f first
#define pb push_back
#define pii pair <int,int>
#pragma GCC target("avx2,popcnt")
#pragma GCC optimize("O3,unroll-loops")
using namespace std;
 
const int N = 4e5 + 3;

int l[N],r[N],p[N],to[N],cur[N];
unordered_map <ll,int> mp;

int main(){
	ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
 
	int n,i,j,k;
	cin>>n;
	
	for(i=1;i<=n;i++){
		cin>>p[i];
	}
	
	ll sum = 0;
	int t = 1e9;

	for (i = n + 1; i >= 1; i--){
		sum += p[i];
		
		if (mp.find(sum) != mp.end()) {
			t = min(t,mp[sum]);
		}

		to[i] = t;
		mp[sum] = i;
	}

	int q;
	cin>>q;
	
	for (i = 1; i <= q; i++){
		cin >> l[i] >> r[i];
		p[i] = 0;
	}
	
	for (i = 18; i >= 0; i--){
		for (j = 1; j <= n+1; j++)
			cur[j] = to[j];

		for (j = 1; j <= i; j++)
			for (k = 1; k <= n; k++)
				if (cur[k] <= n+1) cur[k] = cur[cur[k]];

		for (j = 1; j <= q; j++){
			if (cur[l[j]] <= r[j] + 1){
				l[j] = cur[l[j]];
				p[j] += (1<<i);
			}
		}
	}
 
	for (i=1;i<=q;i++)
		cout<<p[i]<<endl;
}

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