GDY - 计蒜客

int n, m, res;
int p[300][20], num[300];

queue<int> q;

bool check(int pos) {
    if (!num[pos] && q.empty()) {
        res = pos;
        return true;
    }
    return false;
}

void Play() {
    int pre = -1, now = 1, flag = -1;
    int t = 0;
    while(flag == -1) {
        if (pre == -1) {
            Rep(i, 3, 15) if (p[now][i]) {
                pre = i;
                p[now][i]--;
                num[now]--;
                t = 0;
                break;
            }
            if (check(now)) flag = 1;
        }
        else if (pre != 15) {
            if (p[now][pre + 1]) {
                pre = pre + 1;
                p[now][pre]--;
                num[now]--;
                t = 0;
                if(check(now)) flag = 1;
            }
            else if (p[now][15]) {
                pre = 15;
                p[now][15]--;
                num[now]--;
                t = 0;
                if (check(now)) flag = 1;
            }
            else t++;
        }
        else t++;

        now++;
        if (now > n) now = 1;

        if (t >= n - 1) {
            rep(i, 0, n) {
                if (q.empty()) break;
                int tp = (now + i) % n;
                p[tp == 0 ? n : tp][q.front()]++;
                q.pop();
                num[tp == 0 ? n : tp]++;
            }
            pre = -1;
        }

    }
}

int main()
{
    int cas = 0;
    BEGIN() {
        sc(n), sc(m);

        mem(p, 0), mem(num, 0);
        while(!q.empty()) q.pop();

        Rep(i, 1, m) {
            int x;
            sc(x);
            if (x == 1) x = 14;
            if (x == 2) x = 15;
            if (i > 5 * n) q.push(x);
            else {
                p[(i - 1) / 5 + 1][x]++;
                num[(i - 1) / 5 + 1]++;
            }
        }

        printf("Case #%d:\n", ++cas);

        Play();
        Rep(i, 1, n) {
            if (i == res) {
                puts("Winner");
            }
            else {
                int tp = 0;
                Rep(j, 3, 15) {
                    int x = (j > 13 ? j - 13 : j);
                    tp += x * p[i][j];
                }
                pr(tp);
            }
        }
    }
    return 0;
}