oj.uz

Submission #250909

# Submission time Handle Problem Language Result Execution time Memory
250909 2020-07-19T12:07:39 Z receed Koala Game (APIO17_koala) C++14
37 / 100
 98 ms 512 KB 
#include "koala.h"
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <string>
#include <set>
#include <map>
#include <random>
#include <bitset>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <queue>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;

const int N = 100;
int b[N], r[N];

int minValue(int n, int w) {
    b[0] = 1;
    playRound(b, r);
    rep(i, n)
        if (r[i] <= b[i])
            return i;
    return 0;
}

int maxValue(int n, int w) {
    vector<int> a(n), na;
    rep(i, n)
        a[i] = i;
    while (a.size() > 1) {
        int cw = w / a.size();
        rep(i, n)
            b[i] = 0;
        for (int i : a)
            b[i] = cw;
        playRound(b, r);
        na.clear();
        for (int i : a)
            if (r[i] > cw)
                na.push_back(i);
        a = na;
    }
    assert(!a.empty());
    return a[0];
}

int greaterValue(int n, int w) {
    int l = 0, rr = 6, m;
    vector<int> a {1, 2, 3, 4, 5, 6, 8};
    while (1) {
        m = (l + rr) / 2;
        b[0] = b[1] = a[m];
        playRound(b, r);
        if (r[0] > a[m] && r[1] > a[m]) {
            assert(l != rr);
            l = m + 1;
        }
        else if (r[0] <= a[m] && r[1] <= a[m]) {
            assert(l != rr);
            rr = m - 1;
        }
        else
            return r[0] < r[1];
    }
    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.
    }
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 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 19 ms 384 KB Output is correct
2 Correct 18 ms 384 KB Output is correct
3 Correct 18 ms 512 KB Output is correct
4 Correct 18 ms 512 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 392 KB Output is correct
2 Correct 98 ms 384 KB Output is correct
3 Correct 85 ms 384 KB Output is correct
4 Correct 86 ms 384 KB Output is correct
5 Correct 91 ms 384 KB Output is correct
6 Correct 90 ms 384 KB Output is correct
7 Correct 85 ms 384 KB Output is correct
8 Correct 91 ms 384 KB Output is correct
9 Correct 86 ms 384 KB Output is correct
10 Correct 82 ms 384 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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