Submission #977067

#	Time	Username	Problem	Language	Result	Execution time	Memory
977067		hmm789	Koala Game (APIO17_koala)	C++14	47 / 100	47 ms	712 KiB

koala

#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
 
int minValue(int N, int W) {
    int a[N], b[N];
    a[0] = 1;
    for(int i = 1; i < N; i++) a[i] = 0;
    playRound(a, b);
    for(int i = 0; i < N; i++) if(!b[i]) return i;
    return 0;
}
 
int maxValue(int N, int W) {
    int a[N], b[N];
    for(int i = 0; i < N; i++) a[i] = 1;
    playRound(a, b);
    set<int> s;
    for(int i = 0; i < N; i++) if(b[i]) s.insert(i);
    memset(a, 0, sizeof(a));
    for(int i : s) a[i] = 2;
    playRound(a, b);
    for(int i = 0; i < N; i++) if(s.find(i) != s.end() && !b[i]) s.erase(i);
    memset(a, 0, sizeof(a));
    for(int i : s) a[i] = 4;
    playRound(a, b);
    for(int i = 0; i < N; i++) if(s.find(i) != s.end() && !b[i]) s.erase(i);
    memset(a, 0, sizeof(a));
    for(int i : s) a[i] = 11;
    playRound(a, b);
    for(int i = 0; i < N; i++) if(s.find(i) != s.end() && !b[i]) s.erase(i);
    return *s.begin();
}
 
int greaterValue(int N, int W) {
    int a[N], b[N];
    memset(a, 0, sizeof(a));
    int l = 1, r = 9, m;
    while(l <= r) {
        m = (l+r)/2;
        a[0] = a[1] = m;
        playRound(a, b);
        if(b[0] && b[1]) l = m+1;
        else if(!b[0] && !b[1]) r = m-1;
        else if(b[0] && !b[1]) return 0;
        else return 1;
    }
    return 0;
}
 
int a[100], b[100], c[100], tmp[100];
bool cmp(int x, int y) {
    if(x == y) return false;
    a[x] = a[y] = 100;
    playRound(a, b);
    a[x] = a[y] = 0;
    return b[y] > 100;
}

void solve(int l, int r) {
    if(l == r) return;
    int m = (l+r)/2;
    solve(l, m);
    solve(m+1, r);
    int i = l, j = m+1, idx = l;
    while(i <= m || j <= r) {
        if(i > m) tmp[idx++] = c[j++];
        else if(j > r) tmp[idx++] = c[i++];
        else if(cmp(c[i], c[j])) tmp[idx++] = c[i++];
        else tmp[idx++] = c[j++];
    }
    for(int i = l; i <= r; i++) c[i] = tmp[i];
}

void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        for(int i = 0; i < N; i++) c[i] = i;
        solve(0, N-1);
        for(int i = 0; i < N; i++) P[c[i]] = i+1;
    } else {
        // TODO: Implement Subtask 5 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    }
}

• Subtask 1: 4 / 4
• Subtask 2: 15 / 15
• Subtask 3: 18 / 18
• Subtask 4: 10 / 10
• Subtask 5: 0 / 53