제출 #978994

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
978994		NintsiChkhaidze	Sum Zero (RMI20_sumzero)	C++17	61 / 100	691 ms	22180 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>
#define left (h<<1),l,(l + r)/2
#define right ((h<<1)|1),(l + r)/2 + 1,r
using namespace std;
 
const int N = 4e5 + 3;

int last[N];
int l[N],r[N],p[N];
int to[N],ans[N],cur[N];

signed main(){
	ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
 
	int n;
	cin>>n;
	
	vector <int> vec;
	map <int,int> mp;
	vec.pb(0);
	for(int i=1;i<=n;i++){
		cin>>p[i];
	}
	
	for (int i = n; i >= 1; i--){
		p[i] += p[i + 1];
		vec.pb(p[i]);
	}
 
	sort(vec.begin(),vec.end());
	int val=0;
	for (int i=0;i<vec.size();i++){
		if (!i || vec[i] != vec[i - 1]) {
			++val;
			mp[vec[i]] = val;
		}
	}
 
	for (int i = 1; i <= n+1; i++)
		p[i] = mp[p[i]],last[p[i]] = 1e9;
 
	last[mp[0]] = n + 1;

	int k = 1e9;
	for (int i = n; i >= 1; i--){
		k = min(k,last[p[i]]);
		to[i] = k;
		last[p[i]] = i;
	}
	to[n+1] = 1e9;
	
	int q;
	cin>>q;
	
	for (int i = 1; i <= q; i++){
		cin >> l[i] >> r[i];
	}

	for (int i = 18; i >= 0; i--){
		for (int j = 1; j <= n+1; j++)
			cur[j] = to[j];

		for (int j = 1; j <= i; j++){
			for (int k = 1; k <= n; k++){
				if (cur[k] >= 1e9) cur[k] = 1e9; 
				else cur[k] = cur[cur[k]];
			}
		}

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

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

sumzero.cpp: In function 'int main()':
sumzero.cpp:37:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |  for (int i=0;i<vec.size();i++){
      |               ~^~~~~~~~~~~

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