# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
370090 | 2021-02-23T08:24:42 Z | 79brue | 코알라 (APIO17_koala) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include "koala.h" using namespace std; typedef long long ll; int minValue(int n, int w){ int A[102] = {1}; int B[102] = {0}; playRound(A, B); for(int i=0; i<n; i++){ if(B[i] <= A[i]) return i; } exit(1); } int maxValue(int N, int W) { vector<int> candidate; for(int i=0; i<n; i++) candidate.push_back(i); while((int)candidate.size() > 1){ int tmp = W / (int)candidate.size(); int A[102] = {0}; int B[102] = {0}; for(auto cand: candidate) A[cand] = tmp; playRound(A, B); candidate.clear(); for(int i=0; i<n; i++) if(B[i] > tmp) candidate.push_back(i); } 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. } }