oj.uz

Submission #407361

# Submission time Handle Problem Language Result Execution time Memory
407361 2021-05-18T19:18:26 Z qwerasdfzxcl Koala Game (APIO17_koala) C++14
47 / 100
 68 ms 432 KB 
#include <bits/stdc++.h>
#include "koala.h"

using namespace std;

int minValue(int N, int W) {
    // TODO: Implement Subtask 1 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    int B[100]={0}, R[100]={0};
    B[0] = 1;
    playRound(B, R);
    for (int i=0;i<N;i++) if (B[i]>=R[i]) return i;
    return 0;
}

int maxValue(int N, int W) {
    // TODO: Implement Subtask 2 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    int B[100] = {0}, R[100] = {0};
    for (int i=0;i<N;i++) B[i] = 1;
    playRound(B, R);
    int prv = 1;
    for (int z=1;z<4;z++){
        int cnt=0;
        for (int i=0;i<N;i++) if (R[i]>prv) cnt++;
        for (int i=0;i<N;i++){
            if (R[i]<=prv) B[i] = 0;
            else B[i] = W/cnt;
        }
        prv = W/cnt;
        playRound(B, R);
    }
    for (int i=0;i<N;i++) if (R[i]==12) return i;
    assert(0);
    return 0;
}

int greaterValue(int N, int W) {
    // TODO: Implement Subtask 3 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    int B[100] = {0}, R[100] = {0};
    B[0] = B[1] = 4;
    playRound(B, R);
    if (min(R[0], R[1])>=5){
        B[0] = B[1] = 8;
        playRound(B, R);
        if (R[0]>R[1]) return 0;
        return 1;
    }
    else if (max(R[0], R[1])<=4){
        B[0] = B[1] = 2;
        playRound(B, R);
        assert(R[0]<=2 || R[1]<=2);
        if (R[0]<=2 && R[1]<=2){
            B[0] = 1, B[1] = 0;
            playRound(B, R);
            if (B[0]>=R[0]) return 1;
            return 0;
        }
        if (R[0]>2) return 0;
        return 1;
    }
    if (R[0]>4) return 0;
    return 1;
}

void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        // TODO: Implement Subtask 4 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
        bool chk[100] = {0};
        int B[100] = {0}, R[100] = {0};
        for (int k=N;k>=2;k--){
            for (int i=0;i<N;i++) B[i] = 0;
            int prv = W/k;
            for (int i=0;i<N;i++) if (!chk[i]) B[i] = prv;
            playRound(B, R);
            while(true){
                int cnt=0;
                for (int i=0;i<N;i++) if (R[i]>prv) cnt++;
                assert(cnt);
                if (cnt==1){
                    for (int i=0;i<N;i++) if (R[i]>prv) P[i] = k, chk[i] = 1;
                    break;
                }
                for (int i=0;i<N;i++){
                    if (R[i]>prv) B[i] = W/cnt;
                    else B[i] = 0;
                }
                playRound(B, R);
            }
        }
        for (int i=0;i<N;i++) if (!chk[i]) P[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 5 ms 200 KB Output is correct
2 Correct 5 ms 200 KB Output is correct
3 Correct 5 ms 312 KB Output is correct
4 Correct 5 ms 200 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 200 KB Output is correct
2 Correct 14 ms 200 KB Output is correct
3 Correct 14 ms 308 KB Output is correct
4 Correct 14 ms 312 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 316 KB Output is correct
2 Correct 66 ms 324 KB Output is correct
3 Correct 68 ms 432 KB Output is correct
4 Correct 64 ms 324 KB Output is correct
5 Correct 65 ms 320 KB Output is correct
6 Correct 65 ms 316 KB Output is correct
7 Correct 67 ms 320 KB Output is correct
8 Correct 64 ms 328 KB Output is correct
9 Correct 64 ms 328 KB Output is correct
10 Correct 63 ms 324 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 200 KB Output is correct
2 Correct 39 ms 200 KB Output is correct
3 Correct 39 ms 200 KB Output is correct
4 Correct 39 ms 200 KB Output is correct
5 Correct 39 ms 200 KB Output is correct
6 Correct 39 ms 200 KB Output is correct
7 Correct 38 ms 200 KB Output is correct
8 Correct 38 ms 200 KB Output is correct
9 Correct 39 ms 304 KB Output is correct
10 Correct 39 ms 200 KB Output is correct
11 Correct 38 ms 200 KB Output is correct
12 Correct 37 ms 200 KB Output is correct
13 Correct 39 ms 200 KB Output is correct
14 Correct 39 ms 200 KB Output is correct
15 Correct 38 ms 200 KB Output is correct
16 Correct 38 ms 200 KB Output is correct
17 Correct 38 ms 284 KB Output is correct
18 Correct 38 ms 200 KB Output is correct
19 Correct 39 ms 200 KB Output is correct
20 Correct 39 ms 320 KB Output is correct

Subtask #5
0 / 53.0

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