oj.uz

답안 #877171

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
877171 2023-11-23T02:35:20 Z marvinthang 코알라 (APIO17_koala) C++17
69 / 100
 61 ms 600 KB 
/*************************************
*    author: marvinthang             *
*    created: 22.11.2023 21:23:33    *
*************************************/

#include "koala.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

int B[105], R[105];

int minValue(int N, int W) {
    REP(i, N) B[i] = !i;
    playRound(B, R);
    FOR(i, 1, N) if (!R[i]) return i;
    return 0;
}

int maxValue(int N, int W) {
    vector <int> cur(N);
    iota(ALL(cur), 0);
    while (cur.size() > 1) {
        memset(B, 0, N * sizeof(int));
        int t = N / cur.size();
        for (int x: cur) B[x] = t;
        playRound(B, R);
        cur.clear();
        REP(i, N) if (R[i] > t) cur.push_back(i);
    }
    return cur[0];
}

int greaterValue(int N, int W) {
    memset(B, 0, N * sizeof(int));
    for (int v: {2, 5, 10}) {
        B[0] = B[1] = v;
        playRound(B, R);
        int a = R[0] > v, b = R[1] > v;
        if (a != b) return b;
        if (v == 2 && !a) return !minValue(N, W);
    }
    return 0;
}


void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        memset(B, 0, N * sizeof(int));
        auto cmp = [&] (int x, int y) {
            B[x] = B[y] = 100;
            playRound(B, R);
            B[x] = B[y] = 0;
            return R[x] < R[y];
        };
        function <void(vector <int> &)> merge_sort = [&] (vector <int> &v) {
            int n = v.size();
            if (n <= 1) return;
            int m = n >> 1;
            vector <int> left(v.begin(), v.begin() + m);
            vector <int> right(v.begin() + m, v.end());
            merge_sort(left); merge_sort(right);
            merge(ALL(left), ALL(right), v.begin(), cmp);
        };
        vector <int> order(N); 
        iota(ALL(order), 0);
        merge_sort(order);
        REP(i, N) P[order[i]] = i + 1;
    } else {
        auto cmp = [&] (int x, int y) -> bool {
            memset(B, 0, N * sizeof(int));
            for (int v: {2, 5, 10}) {
                B[x] = B[y] = v;
                playRound(B, R);
                int a = R[x] > v, b = R[y] > v;
                if (a != b) return b;
                if (v == 2 && !a) return minValue(N, W) == x;
            }
            return false;
        };
        function <void(vector <int> &)> merge_sort = [&] (vector <int> &v) {
            int n = v.size();
            if (n <= 1) return;
            int m = n >> 1;
            vector <int> left(v.begin(), v.begin() + m);
            vector <int> right(v.begin() + m, v.end());
            merge_sort(left); merge_sort(right);
            merge(ALL(left), ALL(right), v.begin(), cmp);
        };
        vector <int> order(N); 
        iota(ALL(order), 0);
        merge_sort(order);
        REP(i, N) P[order[i]] = i + 1;
    }
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 3 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 344 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 10 ms 344 KB Output is correct
4 Correct 10 ms 340 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 472 KB Output is correct
2 Correct 59 ms 460 KB Output is correct
3 Correct 59 ms 464 KB Output is correct
4 Correct 58 ms 476 KB Output is correct
5 Correct 58 ms 480 KB Output is correct
6 Correct 59 ms 472 KB Output is correct
7 Correct 59 ms 460 KB Output is correct
8 Correct 59 ms 464 KB Output is correct
9 Correct 61 ms 484 KB Output is correct
10 Correct 59 ms 480 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 344 KB Output is correct
2 Correct 25 ms 344 KB Output is correct
3 Correct 26 ms 344 KB Output is correct
4 Correct 25 ms 348 KB Output is correct
5 Correct 25 ms 456 KB Output is correct
6 Correct 24 ms 456 KB Output is correct
7 Correct 24 ms 344 KB Output is correct
8 Correct 24 ms 344 KB Output is correct
9 Correct 24 ms 344 KB Output is correct
10 Correct 24 ms 344 KB Output is correct
11 Correct 24 ms 344 KB Output is correct
12 Correct 15 ms 444 KB Output is correct
13 Correct 24 ms 344 KB Output is correct
14 Correct 22 ms 344 KB Output is correct
15 Correct 22 ms 344 KB Output is correct
16 Correct 21 ms 456 KB Output is correct
17 Correct 22 ms 344 KB Output is correct
18 Correct 22 ms 344 KB Output is correct
19 Correct 22 ms 340 KB Output is correct
20 Correct 22 ms 344 KB Output is correct

Subtask #5
22.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 21 ms 600 KB Output is partially correct
2 Partially correct 29 ms 344 KB Output is partially correct
3 Partially correct 30 ms 344 KB Output is partially correct
4 Partially correct 29 ms 596 KB Output is partially correct
5 Partially correct 28 ms 344 KB Output is partially correct
6 Partially correct 28 ms 452 KB Output is partially correct
7 Partially correct 28 ms 452 KB Output is partially correct
8 Partially correct 28 ms 456 KB Output is partially correct
9 Partially correct 28 ms 344 KB Output is partially correct
10 Partially correct 29 ms 428 KB Output is partially correct
11 Partially correct 28 ms 344 KB Output is partially correct
12 Partially correct 17 ms 344 KB Output is partially correct
13 Partially correct 28 ms 344 KB Output is partially correct
14 Partially correct 28 ms 344 KB Output is partially correct
15 Partially correct 28 ms 344 KB Output is partially correct
16 Partially correct 29 ms 596 KB Output is partially correct
17 Partially correct 29 ms 344 KB Output is partially correct
18 Partially correct 28 ms 600 KB Output is partially correct
19 Partially correct 35 ms 344 KB Output is partially correct
20 Partially correct 28 ms 344 KB Output is partially correct
21 Partially correct 28 ms 344 KB Output is partially correct
22 Partially correct 28 ms 344 KB Output is partially correct
23 Partially correct 25 ms 344 KB Output is partially correct
24 Partially correct 28 ms 344 KB Output is partially correct
25 Partially correct 28 ms 344 KB Output is partially correct
26 Partially correct 28 ms 344 KB Output is partially correct
27 Partially correct 28 ms 344 KB Output is partially correct
28 Partially correct 28 ms 344 KB Output is partially correct
29 Partially correct 28 ms 452 KB Output is partially correct
30 Partially correct 28 ms 456 KB Output is partially correct
31 Partially correct 28 ms 344 KB Output is partially correct
32 Partially correct 28 ms 344 KB Output is partially correct
33 Partially correct 31 ms 588 KB Output is partially correct
34 Partially correct 26 ms 344 KB Output is partially correct
35 Partially correct 28 ms 344 KB Output is partially correct
36 Partially correct 26 ms 432 KB Output is partially correct
37 Partially correct 26 ms 344 KB Output is partially correct
38 Partially correct 25 ms 344 KB Output is partially correct
39 Partially correct 25 ms 344 KB Output is partially correct
40 Partially correct 26 ms 344 KB Output is partially correct