oj.uz

Submission #57375

# Submission time Handle Problem Language Result Execution time Memory
57375 2018-07-14T16:39:12 Z wilwxk Koala Game (APIO17_koala) C++17
4 / 100
 11 ms 584 KB 
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN=100;
int a[MAXN], b[MAXN];

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.
    a[0]=1; for(int i=1; i<N; i++) a[i]=0;
    playRound(a, b);
    if(b[0]<=1) return 0;
    else {
        for(int i=0; i<N; i++) if(b[i]==0) 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.
    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 n=N;
    set<int> s;
    while(s.size()!=7) s.insert((rand()%100)+1);
    int aa=0, bb=0;
    for(auto cur : s) {
        a[0]=cur;
        playRound(a, b);
        for(int i=1; i<n; i++) aa+=b[i];
        for(int i=1; i<n; i++) a[i]=0;
        for(int i=1; i<n; i++) b[i]=0;
    }
    for(auto cur : s) {
        a[1]=cur;
        playRound(a, b);
        for(int i=1; i<n; i++) bb+=b[i];
        for(int i=1; i<n; i++) a[i]=0;
        for(int i=1; i<n; i++) b[i]=0;
    }
    return aa<bb;
}

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 376 KB Output is correct
2 Correct 11 ms 380 KB Output is correct
3 Correct 8 ms 436 KB Output is correct
4 Correct 10 ms 436 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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