oj.uz

Submission #200837

# Submission time Handle Problem Language Result Execution time Memory
200837 2020-02-08T09:27:30 Z BThero Koala Game (APIO17_koala) C++17
18 / 100
 116 ms 408 KB 
// Why am I so dumb? :c
// chrono::system_clock::now().time_since_epoch().count()
                                                  
#include<bits/stdc++.h>
#include "koala.h"
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>

#define pb push_back
#define mp make_pair

#define all(x) (x).begin(), (x).end()

#define fi first
#define se second

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;   
typedef pair<int, int> pii;
//template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

int minValue(int N, int W) {
    int me[N], you[N];

    for (int i = 0; i < N; ++i) {
        me[i] = 0;
    }

    me[0] = 1;
    playRound(me, you);
    int i = 0;

    while (you[i]) {
        ++i;
    }

    return i;
}

int maxValue(int N, int W) {    
    return 0;
}

int greaterValue(int N, int W) {
    int me[N], you[N];

    for (int i = 0; i < N; ++i) {
        me[i] = you[i] = 0;
    }

    int L = 1, R = min(W / 2, 8);

    while (L <= R) {
        int x = (L + R) >> 1;
        me[0] = me[1] = x;
        playRound(me, you);

        if (you[0] != you[1]) {
            return you[1] > you[0];
        }

        if (you[0] > 0) {
            L = x + 1;
        }
        else {
            R = x - 1;
        }
    }
}

void allValues(int N, int W, int *P) {
    if (W == 2*N) {
    
    } 
    else {
    
    }
}

Compilation message

koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:71: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 11 ms 248 KB Output is correct
2 Correct 10 ms 248 KB Output is correct
3 Correct 10 ms 248 KB Output is correct
4 Correct 10 ms 248 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
14.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 100 ms 376 KB Output is partially correct
2 Partially correct 116 ms 248 KB Output is partially correct
3 Partially correct 98 ms 376 KB Output is partially correct
4 Partially correct 92 ms 248 KB Output is partially correct
5 Partially correct 95 ms 248 KB Output is partially correct
6 Partially correct 97 ms 248 KB Output is partially correct
7 Partially correct 94 ms 376 KB Output is partially correct
8 Partially correct 97 ms 252 KB Output is partially correct
9 Partially correct 92 ms 408 KB Output is partially correct
10 Partially correct 94 ms 360 KB Output is partially correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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