oj.uz

Submission #108191

# Submission time Handle Problem Language Result Execution time Memory
108191 2019-04-28T01:40:45 Z wilwxk Koala Game (APIO17_koala) C++11
24 / 100
 175 ms 808 KB 
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN=205;
int v[MAXN];
int v2[MAXN];

int minValue(int n, int w) {
    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 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) {
    for(int i=1; i<=14; i++) {
        v[0]=i; v[1]=i;
        playRound(v, v2);
        if(v2[0]>i!=v2[1]>i) return v2[1]>i;
    }
    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.
    } 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 greaterValue(int, int)':
koala.cpp:36:17: warning: suggest parentheses around comparison in operand of '!=' [-Wparentheses]
         if(v2[0]>i!=v2[1]>i) return v2[1]>i;
            ~~~~~^~
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:30: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 6 ms 384 KB Output is correct
2 Correct 9 ms 384 KB Output is correct
3 Correct 7 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 15 ms 384 KB Output is correct
2 Correct 16 ms 384 KB Output is correct
3 Correct 17 ms 384 KB Output is correct
4 Correct 17 ms 384 KB Output is correct

Subtask #3
5.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 139 ms 384 KB Output is partially correct
2 Partially correct 175 ms 384 KB Output is partially correct
3 Partially correct 162 ms 632 KB Output is partially correct
4 Partially correct 154 ms 632 KB Output is partially correct
5 Partially correct 148 ms 792 KB Output is partially correct
6 Partially correct 157 ms 728 KB Output is partially correct
7 Partially correct 152 ms 696 KB Output is partially correct
8 Partially correct 158 ms 764 KB Output is partially correct
9 Partially correct 165 ms 808 KB Output is partially correct
10 Partially correct 169 ms 760 KB Output is partially correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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