# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1075332 | 2024-08-26T02:52:58 Z | HappyCapybara | 코알라 (APIO17_koala) | C++17 | 42 ms | 468 KB |
#include "koala.h" #include<bits/stdc++.h> using namespace std; int minValue(int N, int W) { int B[N], R[N]; for (int i=0; i<N; i++) B[i] = 0; B[0] = 1; playRound(B, R); for (int i=0; i<N; i++){ if (B[i] >= R[i]) return i; } } 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) { int B[N], R[N]; for (int i=0; i<N; i++) B[i] = 0; int l = 0, r = 13; while (l != r){ int m = (l+r)/2; B[0] = m; B[1] = m; playRound(B, R); if (R[0] > B[0] && R[1] > B[1]) l = m; if (R[0] <= B[0] && R[1] <= B[1]) r = m; if (R[0] > B[0] && R[1] <= B[1]) return 0; if (R[0] <= B[0] && R[1] > B[1]) 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. } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 344 KB | Output is correct |
2 | Correct | 3 ms | 344 KB | Output is correct |
3 | Correct | 3 ms | 340 KB | Output is correct |
4 | Correct | 3 ms | 344 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 42 ms | 452 KB | Output is correct |
2 | Correct | 42 ms | 344 KB | Output is correct |
3 | Correct | 34 ms | 460 KB | Output is correct |
4 | Correct | 37 ms | 340 KB | Output is correct |
5 | Correct | 34 ms | 344 KB | Output is correct |
6 | Correct | 34 ms | 468 KB | Output is correct |
7 | Correct | 36 ms | 456 KB | Output is correct |
8 | Correct | 34 ms | 344 KB | Output is correct |
9 | Correct | 33 ms | 344 KB | Output is correct |
10 | Correct | 35 ms | 344 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |