oj.uz

답안 #72232

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
72232 2018-08-26T06:13:01 Z (#2175, xdoju, kazel, pps789) 재채점 전쟁 (FXCUP3_judge) C++17
49 / 100
 1500 ms 3500 KB 
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;

bool attack[1<<20];
int target[1<<20];
int targetsum[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]++;
    }

    for(int i=1;i<(1<<X);i++) if(!attack[i]){
        int cur = 0;
        for(int j=i;j;j=((j-1)&i)) if(attack[j]){
            cur |= j;
            if(cur==i){
                attack[i] = true;
                break;
            }
        }
    }

    for(int i=1;i<=C;i++) ans[i] = 'x';

    for(int i=0;i<(1<<X);i++) targetsum[i] = target[i];
    for(int i=0;i<X;i++) for(int j=0;j<(1<<X);j++) if(j&(1<<i))
        targetsum[j] += targetsum[j^(1<<i)];

    for(int i=0;i<(1<<X);i++) if(attack[i]){
        int cur = C;
        int nonattack = ((1<<X)-1)^i;
        cur -= targetsum[nonattack];
        ans[cur] = 'o';
    }

    printf("%s",ans+1);
    return 0;
}

Compilation message

judge.cpp: In function 'int main()':
judge.cpp:17:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&X);
     ~~~~~^~~~~~~~~
judge.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&D);
     ~~~~~^~~~~~~~~
judge.cpp:21:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s",buff);
         ~~~~~^~~~~~~~~~~
judge.cpp:27:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&C);
     ~~~~~^~~~~~~~~
judge.cpp:29:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s",buff);
         ~~~~~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 21 ms 740 KB Output is correct
5 Correct 22 ms 740 KB Output is correct
6 Correct 23 ms 740 KB Output is correct
7 Correct 21 ms 740 KB Output is correct
8 Correct 24 ms 840 KB Output is correct
9 Correct 20 ms 840 KB Output is correct

Subtask #2
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 21 ms 740 KB Output is correct
5 Correct 22 ms 740 KB Output is correct
6 Correct 23 ms 740 KB Output is correct
7 Correct 21 ms 740 KB Output is correct
8 Correct 24 ms 840 KB Output is correct
9 Correct 20 ms 840 KB Output is correct
10 Correct 67 ms 1612 KB Output is correct
11 Correct 56 ms 1612 KB Output is correct
12 Correct 13 ms 1612 KB Output is correct
13 Correct 29 ms 1612 KB Output is correct
14 Correct 124 ms 1612 KB Output is correct
15 Correct 134 ms 1948 KB Output is correct
16 Correct 236 ms 2068 KB Output is correct
17 Correct 243 ms 2068 KB Output is correct

Subtask #3
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 21 ms 740 KB Output is correct
5 Correct 22 ms 740 KB Output is correct
6 Correct 23 ms 740 KB Output is correct
7 Correct 21 ms 740 KB Output is correct
8 Correct 24 ms 840 KB Output is correct
9 Correct 20 ms 840 KB Output is correct
10 Correct 67 ms 1612 KB Output is correct
11 Correct 56 ms 1612 KB Output is correct
12 Correct 13 ms 1612 KB Output is correct
13 Correct 29 ms 1612 KB Output is correct
14 Correct 124 ms 1612 KB Output is correct
15 Correct 134 ms 1948 KB Output is correct
16 Correct 236 ms 2068 KB Output is correct
17 Correct 243 ms 2068 KB Output is correct
18 Correct 196 ms 3500 KB Output is correct
19 Execution timed out 1527 ms 3500 KB Time limit exceeded
20 Halted 0 ms 0 KB -