제출 #632579

#제출 시각아이디문제언어결과실행 시간메모리
632579shmadKoala Game (APIO17_koala)C++17
19 / 100
16 ms324 KiB
#include "koala.h"
#include <bits/stdc++.h>

#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vvt = vt< vt<int> >;

int a[100], b[100];

int minValue(int n, int W) {
    fill(a, a + n, 0);
    a[0] = 1;
    playRound(a, b);
    for (int i = 1; i < n; i++) if (b[i] == 0) return i;
    return 0;
}

int maxValue (int n, int w) {
	vt<int> p(n);
	iota(all(p), 0ll);
	while (sz(p) != 1) {
		fill(a, a + n, 0);
		int x = n / sz(p);
		for (int i: p) a[i] = x;
		playRound(a, b);
		vt<int> np;
		for (int i = 0; i < n; i++) {
			if (b[i] == x + 1) np.pb(i);
		}
		p = np;
	}
    return p[0];
}

int greaterValue (int n, int w) {
    
    return 0;
}

void allValues (int n, int w, int *p) {
    if (w == n * 2) {
    } else {
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...