oj.uz

Submission #108189

# Submission time Handle Problem Language Result Execution time Memory
108189 2019-04-28T01:31:35 Z wilwxk Koala Game (APIO17_koala) C++11
19 / 100
 16 ms 512 KB 
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN=205;

int minValue(int n, int w) {
    int v[MAXN]; int v2[MAXN];
    memset(v, 0, sizeof(v));
    v[0]=1;
    playRound(v, v2);
    for(int i=0; i<n; i++) if(v2[i]<=v[i]) return i;
}

int maxValue(int n, int w) {
    int v[MAXN]; int v2[MAXN];
    int ok[MAXN];
    for(int i=0; i<n; i++) ok[i]=1;
    int cnt=n;
    while(cnt!=1) {
        for(int i=0; i<n; i++) {
            if(ok[i]) v[i]=(w/cnt);
            else v[i]=0;
        }
        playRound(v, v2);
        for(int i=0; i<n; i++) {
            if(ok[i]&&v2[i]<=v[i]) ok[i]=0, cnt--;
        }
    }
    for(int i=0; i<n; i++) if(ok[i]) return i;
}

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.
    }
}

Compilation message

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:13:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:31:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 8 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 5 ms 384 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 384 KB Output is correct
2 Correct 14 ms 384 KB Output is correct
3 Correct 14 ms 384 KB Output is correct
4 Correct 16 ms 512 KB Output is correct

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 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 384 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 256 KB Output isn't correct
2 Halted 0 ms 0 KB -