# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
72152 | 2018-08-26T05:35:26 Z | (#2175, xdoju, kazel, pps789) | 재채점 전쟁 (FXCUP3_judge) | C++17 | 1500 ms | 2012 KB |
#include<cstdio> #include<algorithm> #include<vector> using namespace std; bool attack[1<<20]; int target[1<<20]; int X,D,C; char buff[22]; char ans[555555]; int main(){ scanf("%d",&X); scanf("%d",&D); for(int i=0;i<D;i++){ scanf("%s",buff); int cur = 0; for(int i=0;i<X;i++) if(buff[i]=='o') cur |= (1<<i); attack[cur] = true; } scanf("%d",&C); for(int i=0;i<C;i++){ scanf("%s",buff); int cur = 0; for(int i=0;i<X;i++) if(buff[i]=='x') cur |= (1<<i); target[cur]++; } attack[0] = target[0] = 0; for(int i=1;i<(1<<X);i++){ int cur = 0; for(int j=i;j;j=((j-1)&i)) if(attack[j]) cur |= j; if(cur==i) attack[i] = true; } for(int i=1;i<=C;i++) ans[i] = 'x'; for(int i=0;i<(1<<X);i++) if(attack[i]){ int cur = 0; for(int j=0;j<(1<<X);j++) if(i&j){ cur += target[j]; } ans[cur] = 'o'; } printf("%s",ans+1); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 248 KB | Output is correct |
2 | Correct | 3 ms | 356 KB | Output is correct |
3 | Correct | 3 ms | 432 KB | Output is correct |
4 | Correct | 27 ms | 516 KB | Output is correct |
5 | Correct | 29 ms | 516 KB | Output is correct |
6 | Correct | 51 ms | 596 KB | Output is correct |
7 | Correct | 35 ms | 596 KB | Output is correct |
8 | Correct | 32 ms | 672 KB | Output is correct |
9 | Correct | 24 ms | 672 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 248 KB | Output is correct |
2 | Correct | 3 ms | 356 KB | Output is correct |
3 | Correct | 3 ms | 432 KB | Output is correct |
4 | Correct | 27 ms | 516 KB | Output is correct |
5 | Correct | 29 ms | 516 KB | Output is correct |
6 | Correct | 51 ms | 596 KB | Output is correct |
7 | Correct | 35 ms | 596 KB | Output is correct |
8 | Correct | 32 ms | 672 KB | Output is correct |
9 | Correct | 24 ms | 672 KB | Output is correct |
10 | Correct | 83 ms | 1452 KB | Output is correct |
11 | Correct | 79 ms | 1452 KB | Output is correct |
12 | Correct | 16 ms | 1452 KB | Output is correct |
13 | Correct | 88 ms | 1452 KB | Output is correct |
14 | Correct | 295 ms | 1452 KB | Output is correct |
15 | Correct | 410 ms | 1612 KB | Output is correct |
16 | Correct | 315 ms | 1628 KB | Output is correct |
17 | Correct | 547 ms | 1756 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 248 KB | Output is correct |
2 | Correct | 3 ms | 356 KB | Output is correct |
3 | Correct | 3 ms | 432 KB | Output is correct |
4 | Correct | 27 ms | 516 KB | Output is correct |
5 | Correct | 29 ms | 516 KB | Output is correct |
6 | Correct | 51 ms | 596 KB | Output is correct |
7 | Correct | 35 ms | 596 KB | Output is correct |
8 | Correct | 32 ms | 672 KB | Output is correct |
9 | Correct | 24 ms | 672 KB | Output is correct |
10 | Correct | 83 ms | 1452 KB | Output is correct |
11 | Correct | 79 ms | 1452 KB | Output is correct |
12 | Correct | 16 ms | 1452 KB | Output is correct |
13 | Correct | 88 ms | 1452 KB | Output is correct |
14 | Correct | 295 ms | 1452 KB | Output is correct |
15 | Correct | 410 ms | 1612 KB | Output is correct |
16 | Correct | 315 ms | 1628 KB | Output is correct |
17 | Correct | 547 ms | 1756 KB | Output is correct |
18 | Execution timed out | 1586 ms | 2012 KB | Time limit exceeded |
19 | Halted | 0 ms | 0 KB | - |