oj.uz

Submission #111794

# Submission time Handle Problem Language Result Execution time Memory
111794 2019-05-16T07:38:30 Z dndhk Koala Game (APIO17_koala) C++14
37 / 100
 106 ms 508 KB 
#include "koala.h"
#include <algorithm>

using namespace std;

int B[100], R[100];

int minValue(int N, int W) {
    B[99] = 1;
    playRound(B, R);
    for(int i=0; i<N; i++){
        if(R[i]==0){
            return i;
        }
    }
    return 99;
}

int maxValue(int N, int W) {
    for(int i=0; i<N; i++){
        B[i] = 1;
    }
    playRound(B, R);
    for(int i=0; i<N; i++){
        if(R[i]==2){
            B[i] = 2;
        }else{
            B[i] = 0;
        }
    }
    playRound(B, R);
    int cnt = 25;
    for(int i=0; i<N; i++){
        if(R[i]>=3){
            B[i] = 3;
        }else if(B[i]!=0 && cnt>0){
            B[i] = 1;
            cnt--;
        }else B[i] = 0;
    }
    playRound(B, R);
    for(int i=0; i<N; i++){
        if(R[i]>=4){
            B[i] = 13;
        }else   B[i] = 0;
    }
    playRound(B, R);
    for(int i=0; i<N; i++){
        if(R[i]>=14){
            return i;
        }
    }
    return -1;
}

int chk(int x){
    B[0] = B[1] = x;
    playRound(B, R);
    if(R[0]>x && R[1]>x){
        return 2;
    }else if(R[0]<=x && R[1]<=x){
        return 3;
    }else{
        if(R[0]>R[1])   return 0;
        return 1;
    }
}

int greaterValue(int N, int W) {
    int t = chk(3);
    if(t==0)    return 0;
    if(t==1)    return 1;
    if(t==2){
        t = chk(5);
        if(t==0)    return 0;
        if(t==1)    return 1;
        if(t==2){
            t = chk(8);
            if(t==0)    return 0;
            return 1;
        }
    }else{
        t = chk(2);
        if(t==0)    return 0;
        if(t==1)    return 1;
        if(t==3){
            t = chk(1);
            if(t==0)    return 0;
            return 1;
        }
    }
    return -1;
}

int n;

bool sf(int x, int y){
    for(int i=0; i<n; i++){
        B[i] = 0;
    }
    B[x] = B[y] = 100;
    playRound(B, R);
    if(R[x]>R[y])   return 0;
    return 1;
}

int arr[100];


void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        n = N;
        for(int i=0; i<N; i++){
            arr[i] = i;
        }
        sort(arr, arr+N, sf);
        for(int i=0; i<N; i++){
            P[arr[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 6 ms 256 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 9 ms 256 KB Output is correct
4 Correct 8 ms 384 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 256 KB Output is correct
2 Correct 15 ms 384 KB Output is correct
3 Correct 19 ms 400 KB Output is correct
4 Correct 15 ms 368 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 508 KB Output is correct
2 Correct 88 ms 400 KB Output is correct
3 Correct 71 ms 384 KB Output is correct
4 Correct 87 ms 384 KB Output is correct
5 Correct 68 ms 376 KB Output is correct
6 Correct 84 ms 384 KB Output is correct
7 Correct 81 ms 384 KB Output is correct
8 Correct 78 ms 400 KB Output is correct
9 Correct 96 ms 376 KB Output is correct
10 Correct 78 ms 384 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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