oj.uz

Submission #977067

# Submission time Handle Problem Language Result Execution time Memory
977067 2024-05-07T11:01:09 Z hmm789 Koala Game (APIO17_koala) C++14
47 / 100
 47 ms 712 KB 
#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.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 344 KB Output is correct
2 Correct 11 ms 344 KB Output is correct
3 Correct 11 ms 464 KB Output is correct
4 Correct 10 ms 344 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 484 KB Output is correct
2 Correct 47 ms 476 KB Output is correct
3 Correct 45 ms 712 KB Output is correct
4 Correct 39 ms 468 KB Output is correct
5 Correct 40 ms 484 KB Output is correct
6 Correct 40 ms 484 KB Output is correct
7 Correct 40 ms 472 KB Output is correct
8 Correct 41 ms 464 KB Output is correct
9 Correct 40 ms 468 KB Output is correct
10 Correct 39 ms 344 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 340 KB Output is correct
2 Correct 26 ms 344 KB Output is correct
3 Correct 26 ms 540 KB Output is correct
4 Correct 25 ms 344 KB Output is correct
5 Correct 25 ms 596 KB Output is correct
6 Correct 25 ms 344 KB Output is correct
7 Correct 25 ms 600 KB Output is correct
8 Correct 24 ms 448 KB Output is correct
9 Correct 24 ms 344 KB Output is correct
10 Correct 23 ms 452 KB Output is correct
11 Correct 24 ms 344 KB Output is correct
12 Correct 14 ms 344 KB Output is correct
13 Correct 27 ms 344 KB Output is correct
14 Correct 22 ms 340 KB Output is correct
15 Correct 25 ms 452 KB Output is correct
16 Correct 21 ms 344 KB Output is correct
17 Correct 21 ms 452 KB Output is correct
18 Correct 22 ms 452 KB Output is correct
19 Correct 22 ms 344 KB Output is correct
20 Correct 22 ms 344 KB Output is correct

Subtask #5
0 / 53.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -