# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
734462 | 2023-05-02T13:03:29 Z | 1075508020060209tc | 코알라 (APIO17_koala) | C++14 | 0 ms | 0 KB |
#include "koala.h" #include<bits/stdc++.h> using namespace std; #define int long long int minValue(int N, int W) { // TODO: Implement Subtask 1 solution here. // You may leave this function unmodified if you are not attempting this // subtask. int ar[100]; for(int i=0;i<100;i++){ ar[i]=1; } int br[100]; playRound(ar,br); for(int i=0;i<=99;i++){ if(br[i]==2){ ar[i]=98; break; } } for(int i=0;i<=99;i++){ if(br[i]==2&&ar[i]==1){ ar[i]=0;break; } } for(int i=0;i<=99;i++){ if(br[i]==2&&ar[i]==1){ ar[i]=0;break; } } for(int i=0;i<=99;i++){ if(ar[i]!=98){ ar[i]^=1; } } playRound(ar,br); for(int i=0;i<=99;i++){ if(br[i]==0&&ar[i]!=98){ 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. } }