oj.uz

Submission #106749

# Submission time Handle Problem Language Result Execution time Memory
106749 2019-04-20T09:22:32 Z kimjg1119 Koala Game (APIO17_koala) C++17
19 / 100
 19 ms 504 KB 
#include "koala.h"
#include <bits/stdc++.h>

using namespace std;

int minValue(int N, int W) {

    int b[100]={},r[100];
    b[0]=1;

    playRound(b,r);
    if(r[0]==2){
        for(int i=0;i<100;i++)
            if(r[i]==0) return i;
    }
    else{
        return 0;
    }

    return 0;
}

int maxValue(int N, int W) {
    vector<int> k;
    for(int i=0;i<100;i++)
        k.push_back(i);

    int b[100], r[100];
    
    while(k.size()>1){
        memset(b,0,sizeof(b));
        int sz=k.size(), t=100/sz;
        for(int e : k)
            b[e]=t;
        playRound(b,r);
        vector<int> k2;
        for(int i=0;i<100;i++)
            if(r[i]>t) k2.push_back(i);
        k=k2; 
    }
    return k[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.
    return 0;
}

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.
    } 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 9 ms 384 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 384 KB Output is correct
2 Correct 17 ms 384 KB Output is correct
3 Correct 17 ms 504 KB Output is correct
4 Correct 15 ms 408 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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