oj.uz

Submission #977021

# Submission time Handle Problem Language Result Execution time Memory
977021 2024-05-07T10:30:21 Z hmm789 Koala Game (APIO17_koala) C++14
37 / 100
 56 ms 728 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;
}
 
void allValues(int N, int W, int *P) {
    int a[N], b[N];
    memset(a, 0, sizeof(a));
    if (W == 2*N) {
        int c[N];
        for(int i = 0; i < N; i++) c[i] = i;
        sort(c, c+N, [&](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;
        });
        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 4 ms 448 KB Output is correct
2 Correct 4 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 460 KB Output is correct
3 Correct 11 ms 344 KB Output is correct
4 Correct 11 ms 344 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 464 KB Output is correct
2 Correct 56 ms 480 KB Output is correct
3 Correct 41 ms 484 KB Output is correct
4 Correct 40 ms 476 KB Output is correct
5 Correct 40 ms 468 KB Output is correct
6 Correct 41 ms 480 KB Output is correct
7 Correct 41 ms 464 KB Output is correct
8 Correct 45 ms 728 KB Output is correct
9 Correct 41 ms 484 KB Output is correct
10 Correct 40 ms 464 KB Output is correct

Subtask #4
0 / 10.0

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

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 -