# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1054067 | 2024-08-12T05:41:36 Z | 변재우(#11060) | 코알라 (APIO17_koala) | C++14 | 8 ms | 452 KB |
#include "koala.h" #include <bits/stdc++.h> using namespace std; int minValue(int N, int W) { int tmp[100]={0}, tmp2[100]={0}; tmp[0]=1; playRound(tmp, tmp2); if(tmp2[0]<=1) return 0; for(int i=1; i<N; i++) if(!tmp2[i]) return i; } int maxValue(int N, int W) { int tmp[100]={0}, tmp2[100]={0}; vector<int> V; for(int i=0; i<N; i++) V.push_back(i); while(V.size()>1) { fill(tmp, tmp+N, 0); for(int i=0; i<V.size(); i++) tmp[V[i]]=N/(int)V.size(); playRound(tmp, tmp2); vector<int> V2; for(int i=0; i<V.size(); i++) if(tmp2[V[i]]) V2.push_back(V[i]); V=V2; } return V[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. 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. } }
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 | 344 KB | Output is correct |
4 | Correct | 2 ms | 344 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 344 KB | Output is correct |
2 | Correct | 8 ms | 344 KB | Output is correct |
3 | Correct | 8 ms | 452 KB | Output is correct |
4 | Correct | 8 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 | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |