oj.uz

답안 #264792

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
264792 2020-08-14T09:47:29 Z srvlt 코알라 (APIO17_koala) C++14
4 / 100
 7 ms 384 KB 
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define all(x) begin(x), end(x)
#define SZ(x) (int)(x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int b[105], r[105];

int minValue(int N, int W) {
    // TODO: Implement Subtask 1 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    memset(& b, 0, sizeof(b));
    memset(& r, 0, sizeof(r));
    b[0] = 1;
    playRound(b, r);
    if (r[0] < 2) return 0;
    for (int i = 0; i < N; i++)
		if (r[i] == 0)
			return i;
	assert(false);
}

int maxValue(int N, int W) {
    // TODO: Implement Subtask 2 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    return 0;
}

int greaterValue(int N, int W) {
    // TODO: Implement Subtask 3 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    vector <int> suf, vec;
    for (int i = 0; i < N; i++)
		suf.pb(i);
    while (SZ(suf) > 1) {
		int k = min(N / SZ(suf), SZ(suf) - 1);
		//cerr << "k = " << k << '\n';
		memset(& b, 0, sizeof(b));
		memset(& r, 0, sizeof(r));
		for (int i : suf)
			b[i] = k;
		playRound(b, r);
		vec.clear();
		for (int i = 0; i < N; i++)
			if (b[i] == k && r[i] > k)
				vec.pb(i);
		suf = vec;
	}
	assert(SZ(suf) == 1);
    return suf.back();
}

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

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

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -