# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
948223 | 2024-03-17T23:16:51 Z | MilosMilutinovic | 코알라 (APIO17_koala) | C++14 | 0 ms | 0 KB |
#include "koala.h" #include<bits/stdc++.h> using namespace std; int minValue(int N, int W) { vector<int> b(N); b[0]=1; vector<int> r(N); playRound(b,r); for(int i=0;i<N;i++) if(r[i]<=b[i]) return i; return 0; } 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) { // 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. } }