oj.uz

Submission #978975

# Submission time Handle Problem Language Result Execution time Memory
978975 2024-05-10T05:15:47 Z NintsiChkhaidze Sum Zero (RMI20_sumzero) C++17
0 / 100
 14 ms 23388 KB 
#include <bits/stdc++.h>
#define ll long long
#define s second
#define f first
#define pb push_back
#define pii pair <int,int>
using namespace std;
 
const int N = 4e5 + 2;
 
int p[N],last[N],l,r,res,mid,path[N],id;
vector <int> v[N];
vector <pii> qr[N];

void dfs(int x){
	p[x] = -1;	
	path[++id] = x;

	for (auto [y,i]: qr[x]){
		l = 1; r = id; res=-1;
		while (l <= r){
			mid = (l + r)/2;
			if (path[mid] <= y){
				res = mid;
				r = mid - 1;
			}else{
				l = mid + 1;
			}
		}

		last[i] = id - res;
	}

	for (int to: v[x])
		dfs(to);

	--id;
}
signed main(){
	ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
 
	int n,i;
	cin>>n;
	map <int,int> mp;
	
	path[++id] = 0;
	for(i=1;i<=n;i++)
		cin>>p[i];
 
	for (i = n; i >= 1; i--){
		p[i]+=p[i+1];
		path[++id] = p[i];
	}
 
	sort(path+1,path+1+id);
	int k = 0;
	for (i=1;i<=id;i++){
		if (i == 1 || path[i] != path[i - 1]) {
			++k;
			mp[path[i]] = k;
		}
	}
 
	for (i = 1; i <= n+1; i++)
		p[i] = mp[p[i]],last[p[i]] = 1e9;
 
	last[mp[0]] = n + 1;
	k = 1e9;
	for (i = n; i >= 1; i--){
		k = min(k,last[p[i]]);
		if (k != 1e9) v[k].pb(i);
		last[p[i]] = i;
	}

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

	id=0;
	for (i = n+1; i >= 1; i--){
		if (p[i] != -1) dfs(i);
	}

	for (i = 1; i <= q; i++)
		cout<<last[i]<<endl;
}

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Runtime error 14 ms 23388 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 39.0

# Verdict Execution time Memory Grader output
1 Runtime error 14 ms 23388 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

# Verdict Execution time Memory Grader output
1 Runtime error 14 ms 23388 KB Memory limit exceeded
2 Halted 0 ms 0 KB -