# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
43655 | 2018-03-19T07:05:37 Z | gnoor | Bali Sculptures (APIO15_sculpture) | C++14 | 2 ms | 612 KB |
#include <cstdio> #include <cstring> #include <algorithm> #include <vector> using namespace std; int tbl[5000]; int dis[5000]; int n,a,b; int num(long long mask) { memset(dis,63,sizeof(dis)); dis[0]=0; for (int i=0;i<=n;i++) { for (int j=i+1;j<=n;j++) { if (((tbl[j]-tbl[i])&(~mask))==0) { dis[j]=min(dis[j],dis[i]+1); } } } return dis[n]; } void printBin(long long x) { for (int i=50;i>=0;i--) { printf("%d",(x&(1ll<<i))?1:0); } printf("\n"); } int main () { scanf("%d%d%d",&n,&a,&b); for (int i=1;i<=n;i++) { scanf("%d",&tbl[i]); tbl[i]+=tbl[i-1]; } long long mask=(1ll<<50)-1; //printBin(mask); for (int i=49;i>=0;i--) { mask^=(1ll<<i); //printBin(mask); int tmp=num(mask); if (tmp>b||tmp<a) { mask^=(1ll<<i); } } printf("%lld\n",mask); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 252 KB | Output is correct |
2 | Correct | 2 ms | 352 KB | Output is correct |
3 | Correct | 1 ms | 432 KB | Output is correct |
4 | Correct | 1 ms | 448 KB | Output is correct |
5 | Correct | 2 ms | 448 KB | Output is correct |
6 | Correct | 1 ms | 524 KB | Output is correct |
7 | Correct | 2 ms | 524 KB | Output is correct |
8 | Correct | 2 ms | 556 KB | Output is correct |
9 | Correct | 1 ms | 556 KB | Output is correct |
10 | Correct | 1 ms | 556 KB | Output is correct |
11 | Correct | 2 ms | 556 KB | Output is correct |
12 | Correct | 1 ms | 556 KB | Output is correct |
13 | Correct | 1 ms | 556 KB | Output is correct |
14 | Incorrect | 1 ms | 556 KB | Output isn't correct |
15 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 556 KB | Output is correct |
2 | Correct | 1 ms | 556 KB | Output is correct |
3 | Correct | 1 ms | 556 KB | Output is correct |
4 | Correct | 1 ms | 556 KB | Output is correct |
5 | Correct | 1 ms | 556 KB | Output is correct |
6 | Correct | 2 ms | 556 KB | Output is correct |
7 | Correct | 2 ms | 556 KB | Output is correct |
8 | Correct | 1 ms | 556 KB | Output is correct |
9 | Correct | 1 ms | 556 KB | Output is correct |
10 | Correct | 2 ms | 556 KB | Output is correct |
11 | Correct | 1 ms | 556 KB | Output is correct |
12 | Correct | 1 ms | 556 KB | Output is correct |
13 | Correct | 1 ms | 556 KB | Output is correct |
14 | Incorrect | 1 ms | 612 KB | Output isn't correct |
15 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 612 KB | Output is correct |
2 | Correct | 2 ms | 612 KB | Output is correct |
3 | Correct | 1 ms | 612 KB | Output is correct |
4 | Correct | 1 ms | 612 KB | Output is correct |
5 | Correct | 2 ms | 612 KB | Output is correct |
6 | Correct | 1 ms | 612 KB | Output is correct |
7 | Correct | 1 ms | 612 KB | Output is correct |
8 | Correct | 1 ms | 612 KB | Output is correct |
9 | Correct | 1 ms | 612 KB | Output is correct |
10 | Correct | 1 ms | 612 KB | Output is correct |
11 | Correct | 1 ms | 612 KB | Output is correct |
12 | Correct | 1 ms | 612 KB | Output is correct |
13 | Correct | 1 ms | 612 KB | Output is correct |
14 | Correct | 1 ms | 612 KB | Output is correct |
15 | Correct | 1 ms | 612 KB | Output is correct |
16 | Correct | 1 ms | 612 KB | Output is correct |
17 | Correct | 1 ms | 612 KB | Output is correct |
18 | Correct | 2 ms | 612 KB | Output is correct |
19 | Correct | 1 ms | 612 KB | Output is correct |
20 | Correct | 1 ms | 612 KB | Output is correct |
21 | Correct | 1 ms | 612 KB | Output is correct |
22 | Correct | 1 ms | 612 KB | Output is correct |
23 | Correct | 1 ms | 612 KB | Output is correct |
24 | Correct | 1 ms | 612 KB | Output is correct |
25 | Correct | 1 ms | 612 KB | Output is correct |
26 | Correct | 1 ms | 612 KB | Output is correct |
27 | Correct | 2 ms | 612 KB | Output is correct |
28 | Correct | 2 ms | 612 KB | Output is correct |
29 | Correct | 2 ms | 612 KB | Output is correct |
30 | Correct | 2 ms | 612 KB | Output is correct |
31 | Correct | 2 ms | 612 KB | Output is correct |
32 | Correct | 2 ms | 612 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 612 KB | Output is correct |
2 | Correct | 2 ms | 612 KB | Output is correct |
3 | Correct | 1 ms | 612 KB | Output is correct |
4 | Correct | 1 ms | 612 KB | Output is correct |
5 | Correct | 2 ms | 612 KB | Output is correct |
6 | Correct | 1 ms | 612 KB | Output is correct |
7 | Correct | 1 ms | 612 KB | Output is correct |
8 | Correct | 1 ms | 612 KB | Output is correct |
9 | Correct | 1 ms | 612 KB | Output is correct |
10 | Correct | 1 ms | 612 KB | Output is correct |
11 | Correct | 1 ms | 612 KB | Output is correct |
12 | Correct | 1 ms | 612 KB | Output is correct |
13 | Correct | 1 ms | 612 KB | Output is correct |
14 | Incorrect | 1 ms | 612 KB | Output isn't correct |
15 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 612 KB | Output is correct |
2 | Correct | 1 ms | 612 KB | Output is correct |
3 | Correct | 1 ms | 612 KB | Output is correct |
4 | Correct | 1 ms | 612 KB | Output is correct |
5 | Correct | 1 ms | 612 KB | Output is correct |
6 | Correct | 1 ms | 612 KB | Output is correct |
7 | Correct | 1 ms | 612 KB | Output is correct |
8 | Correct | 2 ms | 612 KB | Output is correct |
9 | Correct | 2 ms | 612 KB | Output is correct |
10 | Correct | 2 ms | 612 KB | Output is correct |
11 | Correct | 2 ms | 612 KB | Output is correct |
12 | Correct | 1 ms | 612 KB | Output is correct |
13 | Correct | 2 ms | 612 KB | Output is correct |
14 | Correct | 2 ms | 612 KB | Output is correct |
15 | Incorrect | 2 ms | 612 KB | Output isn't correct |
16 | Halted | 0 ms | 0 KB | - |