| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1336685 | mayac | Koala Game (APIO17_koala) | C++20 | 1071 ms | 344 KiB |
#include <iostream>
#include <vector>
#include "koala.h"
using namespace std;
int minValue(int N, int W) {
int B[100],R[100];
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;
}
}
int maxValue(int N, int W) {
int B[100],R[100];
vector<int> v;
for(int i=0;i<N;i++)v.push_back(i);
while(v.size()>1){
for(int i=0;i<N;i++)B[i]=0;
for(int i:v)B[i]=min(13,int(100/v.size()));
vector<int> t;
for(int i=0;i<N;i++){
if(B[i]>0&&R[i]>B[i])t.push_back(i);
}
v=t;
}
return v[0];
}
int greaterValue(int N, int W) {
int B[100],R[100];
for(int i=0;i<N;i++)B[i]=0;
B[0]=1;B[1]=1;
playRound(B,R);
while(!((R[0]>1&&R[1]<2)||(R[0]<2&&R[1])>1)){
for(int i=2;i<N;i++)B[i]=R[i];
playRound(B,R);
}
if(R[1]>R[0])return 1;
return 0;
}
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.
}
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
