제출 #421373

#제출 시각아이디문제언어결과실행 시간메모리
421373FocutaiSum Zero (RMI20_sumzero)C++17
61 / 100
1081 ms31924 KiB
#include<bits/stdc++.h> using namespace std; #define pb push_back #define eb emplace_back #define mp make_pair #define Fast_IO ios::sync_with_stdio(false); #define DEBUG fprintf(stderr,"Running on Line %d in Function %s\n",__LINE__,__FUNCTION__) //mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); #define fir first #define sec second #define mod 998244353 #define int long long #define inf 0x3f3f3f3f #define INF 0x3f3f3f3f3f3f3f3f inline int read() { char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();} int ans=0; while(isdigit(ch)) {ans=ans*10+ch-48;ch=getchar();} if(nega==-1) return -ans; return ans; } typedef pair<int,int> pii; void print(vector<int> x){for(int i=0;i<(int)x.size();i++) printf("%d%c",x[i]," \n"[i==(int)x.size()-1]);} #define N 400005 int pre[N]; signed a[N],to[N],n,Q; signed st[N][9]; map<int,int> vis; signed main() { cerr<<(sizeof(st)+sizeof(pre)+sizeof(a)*2)/1024.0/1024.0<<endl; cin>>n; for(int i=1;i<=n;i++) a[i]=read(); for(int i=1;i<=n;i++) pre[i]=pre[i-1]+a[i]; for(int i=n;i>=1;i--) { vis[pre[i]]=i+1; if(!vis[pre[i-1]]) to[i]=n+2; else to[i]=vis[pre[i-1]]; } vis.clear(); to[n+1]=n+2,to[n+2]=n+2; for(int i=n;i>=0;i--) to[i]=min(to[i],to[i+1]); for(int i=1;i<=n+2;i++) st[i][0]=to[i]; for(int i=1;i<=8;i++) for(int j=1;j<=n+2;j++) { // printf("^ %d %d - %d\n",i,j,st[i][j]); if(st[j][i-1]+(1<<(i-1))<=n+2) st[j][i]=st[st[j][i-1]][i-1]; else st[j][i]=n+2; } cin>>Q; while(Q--) { int l=read(),r=read()+1,ans=0; for(int i=8;i>=0;i--) while(l+(1<<i)<=r&&st[l][i]<=r) l=st[l][i],ans+=1<<i; printf("%lld\n",ans); } return 0; }

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

sumzero.cpp: In function 'void print(std::vector<long long int>)':
sumzero.cpp:23:69: warning: format '%d' expects argument of type 'int', but argument 2 has type '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} [-Wformat=]
   23 | void print(vector<int> x){for(int i=0;i<(int)x.size();i++) printf("%d%c",x[i]," \n"[i==(int)x.size()-1]);}
      |                                                                    ~^
      |                                                                     |
      |                                                                     int
      |                                                                    %lld
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...