# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
900124 | 2024-01-07T17:11:15 Z | vjudge1 | 코알라 (APIO17_koala) | C++17 | 0 ms | 0 KB |
#include "koala.h" #include "bits/stdc++.h" using namespace std; 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 B[N]; int R[N]; memset(B, 0, sizeof(B)); memset(R, 0, sizeof(R)); for(int i = 0; i < N; i++) B[i] = 1; playRound(B, R); /*for(int i = 0; i < N; i++) cout<<R[i]<<" "; cout<<"\n";*/ for(int i = 0; i < N; i++) B[i] = R[i]; //cout<<"\n"; playRound(B, R); /*for(int i = 0; i < N; i++) cout<<R[i]<<" "; cout<<"\n"; for(int i = 0; i < N; i++) cout<<B[i]<<" "; cout<<"\n";*/ int Respuesta = 0; for(int i = 0; i < N; i++){ if(R[i] == 0 and B[i] == 0){ Respuesta = i; break; } } return Respuesta + 1; } 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; }