제출 #978960

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
978960		NintsiChkhaidze	Sum Zero (RMI20_sumzero)	C++17	0 / 100	13 ms	27484 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 + 5;
 
int a[N],p[N],last[N];
int dp[N],tout[N],ans[N];
vector <int> v[N],path;
vector <pii> qr[N];

void dfs(int x){	
	path.pb(x);

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

		ans[i] = (int)path.size() - res - 1;
	}

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

	path.pop_back();
}
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>>a[i];
	}
 
	for (int i = n; i >= 1; i--){
		p[i]=p[i+1]+a[i];
		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;
	dp[n + 1] = 1e9;
	
	for (int i = n; i >= 1; i--){
		dp[i] = min(dp[i + 1],last[p[i]]);
		if (dp[i] != 1e9) v[dp[i]].pb(i),tout[i] += 1;
		last[p[i]] = i;
	}

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

	for (int i = 1; i <= n + 1; i++){
		if (!tout[i]) vec.clear(),dfs(i);
	}

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

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

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

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