Submission #6353629


Source Code Expand

Copy
#include <bits/stdc++.h>
using i64 = long long;

struct Node {
    Node *lhs, *rhs;
    int depth;
    Node(int d) : lhs(nullptr), rhs(nullptr), depth(d) {}
    ~Node() { if (lhs) delete lhs; if (rhs) delete rhs; }
};

void add(Node *c, const std::string s) {
    for (int i = 0; i < s.size(); i++) {
        if (s[i] == '0') {
            if (c->lhs) c = c->lhs;
            else c = c->lhs = new Node(i + 1);
        } else {
            if (c->rhs) c = c->rhs;
            else c = c->rhs = new Node(i + 1);
        }
    }
}

i64 n, l;
std::deque<i64> q;

void dfs(Node *c) {
    if (c->depth == l) return;
    if (c->lhs) dfs(c->lhs);
    else q.push_back(l - c->depth - 1);
    if (c->rhs) dfs(c->rhs);
    else q.push_back(l - c->depth - 1);
}

int main() {
    std::cin >> n >> l;
    Node *root = new Node(0);
    for (int i = 0; i < n; i++) {
        std::string s;
        std::cin >> s;
        add(root, s);
    }

    dfs(root);
    std::sort(q.begin(), q.end());
    int x = 0, tmp = 0;
    for (int i = 0; i < q.size();) {
        if (i && q[i] - q[i - 1] != 1) {
            x ^= tmp;
            tmp = 0;
        }
        int j = i + 1;
        while (j < q.size() && q[j] == q[i]) j++;
        if ((j - i) % 2) tmp++;
        else {
            x ^= tmp;
            tmp = 0;
        }
        i = j;
    }
    x ^= tmp;

    std::cout << (x ? "Alice" : "Bob") << std::endl;

    delete root;

    return 0;
}

Submission Info

Submission Time
Task E - Prefix-free Game
User CharlotteL
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1497 Byte
Status
Exec Time 28 ms
Memory 7296 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 0_05.txt
All 0 / 700 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 1 ms 256 KB
0_01.txt 1 ms 256 KB
0_02.txt 1 ms 256 KB
0_03.txt 1 ms 256 KB
0_04.txt 1 ms 256 KB
0_05.txt 1 ms 256 KB
1_00.txt 1 ms 256 KB
1_01.txt 1 ms 256 KB
1_02.txt 1 ms 256 KB
1_03.txt 1 ms 256 KB
1_04.txt 1 ms 256 KB
1_05.txt 1 ms 256 KB
1_06.txt 28 ms 7296 KB
1_07.txt 23 ms 5760 KB
1_08.txt 16 ms 3840 KB
1_09.txt 22 ms 5760 KB
1_10.txt 22 ms 5760 KB
1_11.txt 6 ms 512 KB
1_12.txt 5 ms 256 KB
1_13.txt 5 ms 256 KB
1_14.txt 10 ms 896 KB
1_15.txt 10 ms 896 KB
1_16.txt 10 ms 896 KB
1_17.txt 10 ms 896 KB
1_18.txt 10 ms 896 KB
1_19.txt 10 ms 896 KB
1_20.txt 10 ms 896 KB
1_21.txt 10 ms 896 KB
1_22.txt 10 ms 896 KB
1_23.txt 10 ms 896 KB
1_24.txt 10 ms 896 KB
1_25.txt 10 ms 896 KB
1_26.txt 10 ms 896 KB
1_27.txt 10 ms 896 KB
1_28.txt 10 ms 896 KB
1_29.txt 10 ms 896 KB
1_30.txt 10 ms 896 KB
1_31.txt 10 ms 896 KB
1_32.txt 10 ms 896 KB
1_33.txt 10 ms 896 KB
1_34.txt 10 ms 896 KB
1_35.txt 10 ms 896 KB
1_36.txt 10 ms 896 KB
1_37.txt 10 ms 896 KB
1_38.txt 10 ms 896 KB
1_39.txt 10 ms 896 KB
1_40.txt 10 ms 896 KB
1_41.txt 10 ms 896 KB
1_42.txt 10 ms 896 KB
1_43.txt 10 ms 896 KB
1_44.txt 10 ms 896 KB
1_45.txt 10 ms 896 KB
1_46.txt 10 ms 896 KB
1_47.txt 10 ms 896 KB
1_48.txt 10 ms 896 KB
1_49.txt 10 ms 896 KB
1_50.txt 10 ms 896 KB
1_51.txt 10 ms 896 KB
1_52.txt 10 ms 896 KB
1_53.txt 10 ms 896 KB