제출 #876955

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
876955		marvinthang	Koala Game (APIO17_koala)	C++17	19 / 100	11 ms	456 KiB

koala

/*************************************
*    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);
    for (int i = 1; cur.size() > 1; ++i) {
        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) {
    vector <int> cur(N);
    iota(ALL(cur), 0);
    for (int i = 1; ; ++i) {
        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) cout << B[i] << ' ';
        // cout << '\n';
        // REP(i, N) cout << R[i] << ' ';
        // cout << "\n--------\n";
        int a = R[0] > t, b = R[1] > t;
        if (a != b) return b;
        REP(i, N) if (R[i] > t) cur.push_back(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.
    }
}

• Subtask 1: 4 / 4
• Subtask 2: 15 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53