| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 175855 | 2020-01-07T11:32:49 Z | Saboon | 코알라 (APIO17_koala) | C++14 | 56 ms | 852 KB |
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
int B[100], R[100];
bool mark[100];
int minValue(int N, int W){
for (int i = 0; i < N; i++)
B[i] = 0;
B[0] = 1;
playRound(B, R);
for (int i = 0; i < N; i++)
if (R[i] == 0)
return i;
return 0;
}
int maxValue(int N, int W) {
int k = N;
for (int i = 0; i < N; i++)
mark[i] = 0;
while (k > 1){
int cost = min(13, W / k);
for (int i = 0; i < N; i++){
if (!mark[i])
B[i] = cost;
else
B[i] = 0;
}
playRound(B, R);
for (int i = 0; i < N; i++)
if (!mark[i] and R[i] <= B[i])
mark[i] = 1;
k = 0;
for (int i = 0; i < N; i++)
if (mark[i] == 0)
k ++;
}
for (int i = 0; i < N; i++)
if (!mark[i])
return i;
return 0;
}
int v = 0, u = 1;
int greaterValue(int N, int W){
int lo = 0, hi = 14;
while (hi - lo > 1){
int mid = (lo + hi) >> 1;
for (int i = 0; i < N; i++)
B[i] = 0;
B[v] = B[u] = mid;
playRound(B, R);
bool fi = (R[v] > B[v]);
bool se = (R[u] > B[u]);
if (fi == se){
if (fi == 1)
lo = mid;
else
hi = mid;
}
else
return se;
}
return 0;
}
bool cmp(int fi, int se){
if (fi == se)
return false;
v = fi, u = se;
return greaterValue(100, 200);
}
int T[100];
void allValues(int N, int W, int *P) {
if (W == 2*N) {
for (int i = 0; i < N; i++)
T[i] = i;
sort(T, T + N, cmp);
for (int i = 0; i < N; i++)
P[T[i]] = i + 1;
}
else {
for (int i = 0; i < N; i++)
T[i] = i;
sort(T, T + N, cmp);
for (int i = 0; i < N; i++)
P[T[i]] = i + 1;
}
}
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 6 ms | 376 KB | Output is correct |
| 2 | Correct | 6 ms | 376 KB | Output is correct |
| 3 | Correct | 6 ms | 376 KB | Output is correct |
| 4 | Correct | 6 ms | 404 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 16 ms | 376 KB | Output is correct |
| 2 | Correct | 16 ms | 376 KB | Output is correct |
| 3 | Correct | 16 ms | 376 KB | Output is correct |
| 4 | Correct | 16 ms | 424 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 51 ms | 420 KB | Output is correct |
| 2 | Correct | 56 ms | 724 KB | Output is correct |
| 3 | Correct | 50 ms | 632 KB | Output is correct |
| 4 | Correct | 51 ms | 760 KB | Output is correct |
| 5 | Correct | 51 ms | 632 KB | Output is correct |
| 6 | Correct | 51 ms | 724 KB | Output is correct |
| 7 | Correct | 50 ms | 760 KB | Output is correct |
| 8 | Correct | 51 ms | 852 KB | Output is correct |
| 9 | Correct | 51 ms | 632 KB | Output is correct |
| 10 | Correct | 51 ms | 760 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 41 ms | 380 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Partially correct | 26 ms | 380 KB | Output is partially correct |
| 2 | Partially correct | 34 ms | 380 KB | Output is partially correct |
| 3 | Partially correct | 32 ms | 376 KB | Output is partially correct |
| 4 | Partially correct | 30 ms | 376 KB | Output is partially correct |
| 5 | Partially correct | 35 ms | 376 KB | Output is partially correct |
| 6 | Partially correct | 31 ms | 504 KB | Output is partially correct |
| 7 | Partially correct | 31 ms | 376 KB | Output is partially correct |
| 8 | Partially correct | 33 ms | 376 KB | Output is partially correct |
| 9 | Partially correct | 33 ms | 376 KB | Output is partially correct |
| 10 | Partially correct | 29 ms | 380 KB | Output is partially correct |
| 11 | Partially correct | 30 ms | 376 KB | Output is partially correct |
| 12 | Partially correct | 22 ms | 376 KB | Output is partially correct |
| 13 | Partially correct | 32 ms | 380 KB | Output is partially correct |
| 14 | Partially correct | 30 ms | 376 KB | Output is partially correct |
| 15 | Partially correct | 30 ms | 376 KB | Output is partially correct |
| 16 | Partially correct | 33 ms | 376 KB | Output is partially correct |
| 17 | Partially correct | 38 ms | 380 KB | Output is partially correct |
| 18 | Partially correct | 35 ms | 376 KB | Output is partially correct |
| 19 | Partially correct | 30 ms | 376 KB | Output is partially correct |
| 20 | Partially correct | 32 ms | 380 KB | Output is partially correct |
| 21 | Partially correct | 30 ms | 376 KB | Output is partially correct |
| 22 | Partially correct | 33 ms | 380 KB | Output is partially correct |
| 23 | Partially correct | 27 ms | 444 KB | Output is partially correct |
| 24 | Partially correct | 33 ms | 376 KB | Output is partially correct |
| 25 | Partially correct | 33 ms | 376 KB | Output is partially correct |
| 26 | Partially correct | 35 ms | 380 KB | Output is partially correct |
| 27 | Partially correct | 31 ms | 376 KB | Output is partially correct |
| 28 | Partially correct | 33 ms | 380 KB | Output is partially correct |
| 29 | Partially correct | 32 ms | 376 KB | Output is partially correct |
| 30 | Partially correct | 31 ms | 376 KB | Output is partially correct |
| 31 | Partially correct | 30 ms | 380 KB | Output is partially correct |
| 32 | Partially correct | 33 ms | 376 KB | Output is partially correct |
| 33 | Partially correct | 32 ms | 376 KB | Output is partially correct |
| 34 | Partially correct | 27 ms | 376 KB | Output is partially correct |
| 35 | Partially correct | 32 ms | 504 KB | Output is partially correct |
| 36 | Partially correct | 30 ms | 376 KB | Output is partially correct |
| 37 | Partially correct | 31 ms | 376 KB | Output is partially correct |
| 38 | Partially correct | 33 ms | 376 KB | Output is partially correct |
| 39 | Partially correct | 30 ms | 376 KB | Output is partially correct |
| 40 | Partially correct | 32 ms | 376 KB | Output is partially correct |