제출 #2776

#제출 시각아이디문제언어결과실행 시간메모리
2776kk1401속이기 (GA5_fake)C++98
0 / 100
0 ms20656 KiB
#include<stdio.h> int n,d[1001],cnt[1001],ans,chk[1000001]; struct data { int x,y; }; data dy[1001][1001],cost[1001][1001]; void input() { int i; scanf("%d",&n); for(i=1; i<=n; i++) scanf("%d",&d[i]); } int maxval(int a,int b) { return a>b?a:b; } void process() { int i,j; dy[1][++cnt[1]].x=cost[1][1].x=d[1]; dy[1][cnt[1]].y=-1; cost[1][1].y=0; for(i=2; i<=n; i++){ for(j=1; j<=cnt[i-1]; j++){ //x에 넣는경우 if(chk[dy[i-1][j].x^d[i]] != i){ dy[i][++cnt[i]].x = dy[i-1][j].x^d[i]; dy[i][cnt[i]].y = dy[i-1][j].y; cost[i][cnt[i]].y = cost[i-1][j].y; cost[i][cnt[i]].x = cost[i-1][j].x + d[i]; chk[dy[i-1][j].x^d[i]]=i; } if(chk[dy[i-1][j].x] != i){ //y에 넣는경우 if(dy[i-1][j].y==-1) dy[i][++cnt[i]].y = d[i]; else dy[i][++cnt[i]].y = dy[i-1][j].y^d[i]; dy[i][cnt[i]].x = dy[i-1][j].x; cost[i][cnt[i]].y = cost[i-1][j].y + d[i]; cost[i][cnt[i]].x = cost[i-1][j].x; chk[dy[i-1][j].x]=i; } } } for(i=1; i<=cnt[n]; i++) if(dy[n][i].x==dy[n][i].y) ans=maxval(ans,maxval(cost[n][i].x,cost[n][i].y)); } void output() { printf("%d\n",ans); } int main() { input(); process(); output(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...