oj.uz

답안 #100468

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
100468 2019-03-11T13:27:50 Z square1001 코알라 (APIO17_koala) C++14
100 / 100
 73 ms 512 KB 
#include "koala.h"
#include <vector>
#include <algorithm>
using namespace std;

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.
	int B[105], R[105];
	for(int i = 0; i < N; ++i) B[i] = (i == 0 ? 1 : 0);
	playRound(B, R);
	for(int i = 0; i < N; ++i) {
		if(R[i] <= B[i]) return i;
	}
    return -1;
}

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.
	int B[105], R[105], C[105];
	for(int i = 0; i < N; ++i) C[i] = 1;
	while(true) {
		int rem = 0;
		for(int i = 0; i < N; ++i) rem += C[i];
		if(rem == 1) break;
		for(int i = 0; i < N; ++i) {
			B[i] = (C[i] ? W / rem : 0);
		}
		playRound(B, R);
		for(int i = 0; i < N; ++i) {
			if(C[i]) C[i] = (B[i] < R[i] ? 1 : 0);
		}
	}
	for(int i = 0; i < N; ++i) {
		if(C[i]) return i;
	}
	return -1;
}

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.
	int B[105], R[105];
	vector<int> H = { 1, 2, 4, 7, 12, 22, 40, 70 };
	int T = 0;
	for(int i = 4; i >= 1; i /= 2) {
		int D = min(H[T + i] - 1, W / 2);
		for(int j = 0; j < N; ++j) {
			B[j] = (j <= 1 ? D : 0);
		}
		playRound(B, R);
		bool f0 = (B[0] < R[0]), f1 = (B[1] < R[1]);
		if(f0 != f1) return f0 ? 0 : 1;
		if(f0) T += i;
	}
    return -1;
}

#include <iostream>
using namespace std;
pair<int, int> divide_val(int N, int W, int L, int R) {
	// Dividing [L, R]
	for(int i = 1; i * (R - L + 1) <= W; ++i) {
		for(int j = 0; i * (R - L + 1) + j * (L - 1) <= W && j < i; ++j) {
			int mxscore = -1, mxused = -1, usei = -1;
			for(int k = 0; k <= R - L + 1; ++k) {
				if((N - R) + k * (i + 1) > W) break;
				int rem = W - ((N - R) + k * (i + 1));
				int usej = rem / (j + 1);
				int score = (R + (R - k + 1)) * k / 2 + ((L - 1) + (L - usej)) * usej / 2;
				if(score > mxscore) mxscore = score, mxused = k + usej, usei = k;
				else if(score == mxscore && k + usej > mxused) mxused = k + usej, usei = k;
			}
			if(1 <= usei && usei <= R - L) return make_pair(i, j);
		}
	}
	return make_pair(-1, -1);
}

void allValues(int N, int W, int *P) {
	// TODO: Implement Subtask 4 + 5 solution here.
	// You may leave this block unmodified if you are not attempting this
	// subtask.
	int B[105], R[105];
	vector<int> rng = { 1, N + 1 };
	for(int i = 0; i < N; ++i) P[i] = 1;
	for(int i = 1; i < N; ++i) {
		int ptr = -1;
		for(int j = 0; j < i; ++j) {
			if(rng[j + 1] - rng[j] != 1) {
				ptr = j; break;
			}
		}
		pair<int, int> val = divide_val(N, W, rng[ptr], rng[ptr + 1] - 1);
		for(int j = 0; j < N; ++j) {
			if(P[j] == rng[ptr]) B[j] = val.first;
			else if(P[j] < rng[ptr]) B[j] = val.second;
			else B[j] = 0;
		}
		playRound(B, R);
		int delta = 0;
		for(int j = 0; j < N; ++j) {
			if(P[j] == rng[ptr] && B[j] >= R[j]) ++delta;
		}
		for(int j = 0; j < N; ++j) {
			if(P[j] == rng[ptr] && B[j] < R[j]) P[j] += delta;
		}
		rng.insert(rng.begin() + ptr + 1, rng[ptr] + delta);
	}
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 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 9 ms 384 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 384 KB Output is correct
2 Correct 69 ms 460 KB Output is correct
3 Correct 73 ms 504 KB Output is correct
4 Correct 64 ms 512 KB Output is correct
5 Correct 68 ms 384 KB Output is correct
6 Correct 57 ms 384 KB Output is correct
7 Correct 58 ms 384 KB Output is correct
8 Correct 58 ms 384 KB Output is correct
9 Correct 58 ms 400 KB Output is correct
10 Correct 60 ms 508 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 384 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 7 ms 384 KB Output is correct
4 Correct 7 ms 384 KB Output is correct
5 Correct 7 ms 384 KB Output is correct
6 Correct 8 ms 384 KB Output is correct
7 Correct 7 ms 384 KB Output is correct
8 Correct 10 ms 384 KB Output is correct
9 Correct 7 ms 384 KB Output is correct
10 Correct 8 ms 384 KB Output is correct
11 Correct 7 ms 384 KB Output is correct
12 Correct 7 ms 384 KB Output is correct
13 Correct 8 ms 384 KB Output is correct
14 Correct 7 ms 384 KB Output is correct
15 Correct 8 ms 384 KB Output is correct
16 Correct 8 ms 384 KB Output is correct
17 Correct 8 ms 384 KB Output is correct
18 Correct 8 ms 384 KB Output is correct
19 Correct 8 ms 384 KB Output is correct
20 Correct 8 ms 384 KB Output is correct

Subtask #5
53.0 / 53.0

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