Submission #14387

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
14387	2015-05-13 15:40:31	woqja125	Bali Sculptures (APIO15_sculpture)	C++14	100 / 100	827 ms	8944 KiB

sculpture

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<stdio.h>
#include<string.h>
int y[2001];
long long s[2001];
bool t1[2001][2001];
bool t2[2001][2001];
long long min(long long a, long long b){if(a<b)return a; return b;}
bool chk();
int n, a, b;
int main()
{
  int i, j;
  scanf("%d%d%d", &n, &a, &b);
  for(i=1; i<=n; i++)scanf("%d", y+i);
  for(i=1; i<=n; i++) s[i] = s[i-1] + y[i];
  for(i=1; i<=n; i++)for(j=i; j<=n; j++) t1[i][j] = true;
  long long ans = 0;
  for(int B=50; B>=0; B--)
  {
    for(i=1; i<=n; i++)for(j=1; j<=n; j++) t2[i][j] = t1[i][j];
    for(i=1; i<=n; i++) for(j=i; j<=n; j++) if( ((s[j] - s[i-1])&(1ll<<B)) != 0 ) t2[i][j] = false;
    if(chk())
    {
      for(i=1; i<=n; i++)for(j=1; j<=n; j++) t1[i][j] = t2[i][j];
    }
    else ans += (1ll<<B);
  }
  printf("%lld\n", ans);
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 21 / 21
• Subtask 4: 25 / 25
• Subtask 5: 29 / 29