oj.uz

답안 #73206

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
73206 2018-08-28T04:42:59 Z test 재채점 전쟁 (FXCUP3_judge) C++14
100 / 100
 426 ms 15404 KB 
#include<bits/stdc++.h>
using namespace std;

const int MN = 500010;

int X, D, C;
int cnt1[1 << 20], cnt2[1 << 20];
int dp1[1 << 20], dp2[1 << 20];
int ans[MN];

int main() {
    scanf("%d", &X);
    scanf("%d", &D);

    for(int i = 0; i < D; i++) {
        getchar();
        int mask = 0;
        for(int j = 0; j < X; j++) {
            char t = getchar();

            if(t == 'o') mask ^= (1 << j);
        }
        cnt1[mask]++;
    }

    scanf("%d", &C);

    for(int i = 0; i < C; i++) {
        getchar();
        int mask = 0;
        for(int j = 0; j < X; j++) {
            char t = getchar();

            if(t == 'x') mask ^= (1 << j);
        }
        cnt2[mask]++;
    }

    for(int i = 0; i < (1 << X); i++) {
        dp1[i] = cnt1[i]? i : 0;
        dp2[i] = cnt2[i];
    }
    for(int i = X - 1; i >= 0; i--) {
        for(int j = (1 << X) - 1; j >= 0; j--) {
            if(j & (1 << i)) {
                dp1[j] |= dp1[j ^ (1 << i)];
                dp2[j] += dp2[j ^ (1 << i)];
            }
        }
    }

    for(int i = 0; i < (1 << X); i++) {
        if(dp1[i] == i) {
            ans[ C - dp2[(1 << X) - 1 - i] ] = 1;
        }
    }
    for(int i = 1; i <= C; i++) {
        if(ans[i]) printf("o");
        else printf("x");
    }
}

Compilation message

judge.cpp: In function 'int main()':
judge.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &X);
     ~~~~~^~~~~~~~~~
judge.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &D);
     ~~~~~^~~~~~~~~~
judge.cpp:26:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &C);
     ~~~~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 440 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 3 ms 852 KB Output is correct
5 Correct 3 ms 856 KB Output is correct
6 Correct 4 ms 856 KB Output is correct
7 Correct 3 ms 856 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 4 ms 856 KB Output is correct

Subtask #2
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 440 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 3 ms 852 KB Output is correct
5 Correct 3 ms 856 KB Output is correct
6 Correct 4 ms 856 KB Output is correct
7 Correct 3 ms 856 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 4 ms 856 KB Output is correct
10 Correct 53 ms 1084 KB Output is correct
11 Correct 54 ms 1084 KB Output is correct
12 Correct 11 ms 1084 KB Output is correct
13 Correct 3 ms 1084 KB Output is correct
14 Correct 101 ms 1124 KB Output is correct
15 Correct 139 ms 1676 KB Output is correct
16 Correct 177 ms 1676 KB Output is correct
17 Correct 211 ms 1692 KB Output is correct

Subtask #3
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 440 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 3 ms 852 KB Output is correct
5 Correct 3 ms 856 KB Output is correct
6 Correct 4 ms 856 KB Output is correct
7 Correct 3 ms 856 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 4 ms 856 KB Output is correct
10 Correct 53 ms 1084 KB Output is correct
11 Correct 54 ms 1084 KB Output is correct
12 Correct 11 ms 1084 KB Output is correct
13 Correct 3 ms 1084 KB Output is correct
14 Correct 101 ms 1124 KB Output is correct
15 Correct 139 ms 1676 KB Output is correct
16 Correct 177 ms 1676 KB Output is correct
17 Correct 211 ms 1692 KB Output is correct
18 Correct 165 ms 4380 KB Output is correct
19 Correct 117 ms 5316 KB Output is correct
20 Correct 261 ms 14384 KB Output is correct
21 Correct 149 ms 14384 KB Output is correct
22 Correct 426 ms 15404 KB Output is correct
23 Correct 375 ms 15404 KB Output is correct