Submission #2522431


Source Code Expand

#include <cstdio>
#include <iostream>
#include <string>
#include <queue>
using namespace std;

struct Node {
    int depth;
    Node* child[2];
    Node() {
        child[0] = child[1] = nullptr;
    }
};

int main() {
    long long int N, L; scanf("%lld%lld", &N, &L);

    Node* root = new Node;
    root -> depth = 0;
    for(int i=0; i<N; i++) {
        string s; cin >> s;
        Node* cur = root;

        for(size_t k=0; k<s.length(); k++) {
            int c = s[k] - '0', d = cur -> depth;
            if(cur -> child[c] == nullptr) {
                cur -> child[c] = new Node;
                cur -> child[c] -> depth = d + 1;
            }
            cur = cur -> child[c];
        }
    }

    queue<Node*> que;
    que.push(root);
    long long int ans = 0;
    while(que.size()) {
        Node* cur = que.front(); que.pop();
        if((cur -> child[0] == nullptr) && (cur -> child[1] == nullptr)) continue;
        if((cur -> child[0] == nullptr) || (cur -> child[1] == nullptr)) {
            int d = cur -> depth;
            ans ^= (L - d) & (d - L);
        }

        for(int k=0; k<2; k++) {
            if(cur -> child[k] != nullptr) {
                que.push(cur -> child[k]);
            }
        }
    }
    printf("%s\n", ans ? "Alice" : "Bob");
    return 0;
}

Submission Info

Submission Time
Task E - Prefix-free Game
User tsutaj
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1344 Byte
Status AC
Exec Time 9 ms
Memory 3456 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:16:50: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     long long int N, L; scanf("%lld%lld", &N, &L);
                                                  ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 6
AC × 60
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 0_05.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 0_05.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
0_04.txt AC 1 ms 256 KB
0_05.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt AC 9 ms 3456 KB
1_07.txt AC 9 ms 3456 KB
1_08.txt AC 7 ms 1920 KB
1_09.txt AC 9 ms 3456 KB
1_10.txt AC 9 ms 3456 KB
1_11.txt AC 5 ms 512 KB
1_12.txt AC 5 ms 256 KB
1_13.txt AC 5 ms 256 KB
1_14.txt AC 9 ms 768 KB
1_15.txt AC 8 ms 768 KB
1_16.txt AC 9 ms 768 KB
1_17.txt AC 8 ms 768 KB
1_18.txt AC 9 ms 768 KB
1_19.txt AC 8 ms 768 KB
1_20.txt AC 8 ms 768 KB
1_21.txt AC 8 ms 768 KB
1_22.txt AC 9 ms 768 KB
1_23.txt AC 9 ms 768 KB
1_24.txt AC 9 ms 768 KB
1_25.txt AC 8 ms 768 KB
1_26.txt AC 9 ms 768 KB
1_27.txt AC 8 ms 768 KB
1_28.txt AC 9 ms 768 KB
1_29.txt AC 9 ms 768 KB
1_30.txt AC 8 ms 768 KB
1_31.txt AC 8 ms 768 KB
1_32.txt AC 8 ms 768 KB
1_33.txt AC 8 ms 768 KB
1_34.txt AC 8 ms 768 KB
1_35.txt AC 8 ms 768 KB
1_36.txt AC 8 ms 768 KB
1_37.txt AC 8 ms 768 KB
1_38.txt AC 9 ms 768 KB
1_39.txt AC 8 ms 768 KB
1_40.txt AC 9 ms 768 KB
1_41.txt AC 8 ms 768 KB
1_42.txt AC 9 ms 768 KB
1_43.txt AC 9 ms 768 KB
1_44.txt AC 9 ms 768 KB
1_45.txt AC 8 ms 768 KB
1_46.txt AC 9 ms 768 KB
1_47.txt AC 8 ms 768 KB
1_48.txt AC 9 ms 768 KB
1_49.txt AC 9 ms 768 KB
1_50.txt AC 9 ms 768 KB
1_51.txt AC 8 ms 768 KB
1_52.txt AC 8 ms 768 KB
1_53.txt AC 8 ms 768 KB