oj.uz

답안 #362361

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
362361 2021-02-02T18:52:06 Z lukameladze XOR Sum (info1cup17_xorsum) C++14
56 / 100
 1600 ms 47340 KB 
# include <bits/stdc++.h>
using namespace std;
const int N=1e6+5;
long long le[N],ri[N],mid,lee,rii;
long long a[N],b[N],c[N],mp[35],ans,n,answ,idx,idx1,pw[35],bb,mx,c1[N],cnt[N*10],mx1;
int main() {
     std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
     cin>>n;
     for (int i=1; i<=n; i++) {
          cin>>a[i];
          mx1=max(mx1,a[i]);
     }
     pw[0]=1;
     for (int i=1;i<=35; i++) {
          pw[i]=pw[i-1]*2;
     }
     for (int i=0; i<=30; i++) {
     	mx=0;
          for (int j=1; j<=n; j++) {
               b[j]+=a[j]&pw[i];
               c1[j]=b[j];
               c[j]=b[j];
               mx=max(mx,c1[j]);
          }
          if (mx<=5005) {
          for (int j=1; j<=n; j++) {
          	cnt[c1[j]]++;
		}
		for (int j=0; j<=mx; j++) {
			if (j>0)
			cnt[j]+=cnt[j-1];
		}
		for (int j=1; j<=n; j++) {
			c[cnt[c1[j]]]=c1[j];
			cnt[c1[j]]--;
		}
		for (int j=0; j<=mx; j++) {
			cnt[j]=0;
		}
	}
	else {
		sort(c+1, c+n+1);
	}
          idx=n;
          for (int j=1; j<=n; j++) {
               idx=max(idx,j+1LL);
               bb=0;
               while (c[j]+c[idx]>=pw[i] && idx>j) {
                    idx--;         
				bb=1;           
               }
               if (bb==1)
               idx++;
               if (c[j]+c[idx]<pw[i] || idx>n) le[j]=-1;
               else le[j]=idx;
          }
          idx=n;
          for (int j=1; j<=n; j++) {
               idx=max(idx,j+1LL);
               while (c[j]+c[idx]>=pw[i+1] && idx>j+1) {
                    idx--;
               }
               if (c[j]+c[idx]>=pw[i+1] || idx>n) ri[j]=-1;
               else
               ri[j]=idx;
          }
          for (int j=1; j<=n; j++) {
               if (le[j]!=-1 && ri[j]!=-1)
               mp[i]+=ri[j]-le[j]+1;
          }
          idx=n;
          for (int j=1; j<=n; j++) {
               idx=max(idx,j+1LL);
               bb=0;
               while (c[j]+c[idx]>=pw[i+1]+pw[i] && idx>j) {
               	bb=1;
                    idx--;                    
               }
               if (bb==1)
               idx++;
               if (c[j]+c[idx]<pw[i+1]+pw[i] || idx>n) le[j]=-1;
               else le[j]=idx;
          }
          idx=n;
          for (int j=1; j<=n; j++) {
               idx=max(idx,j+1LL);
               while (c[j]+c[idx]>=pw[i+2] && idx>j+1) {
                    idx--;
               }
               if (c[j]+c[idx]>=pw[i+2] || idx>n) ri[j]=-1;
               else
               ri[j]=idx;
          }
          for (int j=1; j<=n; j++) {           
		    if (le[j]!=-1 && ri[j]!=-1)
               mp[i]+=ri[j]-le[j]+1;
          }
     }
     for (int i=0; i<=30; i++) {
          if (mp[i]%2) answ+=(1LL<<i);
     }
     for (int i=1; i<=n; i++)
     answ^=(2*a[i]);
     cout<<answ<<endl;
}

Compilation message

xorsum.cpp: In function 'int main()':
xorsum.cpp:15:16: warning: iteration 34 invokes undefined behavior [-Waggressive-loop-optimizations]
   15 |           pw[i]=pw[i-1]*2;
      |           ~~~~~^~~~~~~~~~
xorsum.cpp:14:20: note: within this loop
   14 |      for (int i=1;i<=35; i++) {
      |                   ~^~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 620 KB Output is correct
2 Correct 9 ms 620 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 952 ms 47340 KB Output is correct
2 Correct 895 ms 44268 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 952 ms 47340 KB Output is correct
2 Correct 895 ms 44268 KB Output is correct
3 Execution timed out 1697 ms 47340 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 620 KB Output is correct
2 Correct 9 ms 620 KB Output is correct
3 Correct 243 ms 5100 KB Output is correct
4 Correct 240 ms 5228 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 620 KB Output is correct
2 Correct 9 ms 620 KB Output is correct
3 Correct 952 ms 47340 KB Output is correct
4 Correct 895 ms 44268 KB Output is correct
5 Execution timed out 1697 ms 47340 KB Time limit exceeded
6 Halted 0 ms 0 KB -