제출 #958195

#제출 시각아이디문제언어결과실행 시간메모리
958195salmon코알라 (APIO17_koala)C++14
33 / 100
68 ms596 KiB
#include <bits/stdc++.h> #include "koala.h" using namespace std; int minValue(int N, int W) { int res[N]; int in[N]; for(int i = 0; i < N; i++){ in[i] = 0; } in[0] = 1; playRound(in,res); int p = -1; for(int i = 0; i < N; i++){ if(res[i] <= in[i]){ p = i; } } return p; } int maxValue(int N, int W) { set<int> sat; int res[N]; int in[N]; for(int i = 0; i < N; i++){ sat.insert(i); in[i] = 0; } while(sat.size() != 1){ int num = 100 / sat.size(); for(int i = 0; i < N; i++){ in[i] = 0; } for(int i : sat){ in[i] = num; } playRound(in,res); for(int i = 0; i < N; i++){ if(res[i] <= in[i] && sat.find(i) != sat.end()){ sat.erase(i); } } } for(int i : sat) return i; } //9 5 3 int greaterValue(int N, int W) { int in[N]; int res[N]; int it = minValue(N, W); if(it == 0) return 1; if(it == 1) return 0; for(int i = 0; i < N; i++){ in[i] = 0; } in[0] = 8; in[1] = 8; playRound(in,res); if(res[0] > in[0] && res[1] <= in[1]) return 0; if(res[1] > in[1] && res[0] <= in[0]) return 1; in[0] = 4; in[1] = 4; playRound(in,res); if(res[0] > in[0] && res[1] <= in[1]) return 0; if(res[1] > in[1] && res[0] <= in[0]) return 1; in[0] = 2; in[1] = 2; playRound(in,res); if(res[0] > in[0] && res[1] <= in[1]) return 0; if(res[1] > in[1] && res[0] <= in[0]) return 1; } 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. } }

컴파일 시 표준 에러 (stderr) 메시지

koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:27:14: warning: control reaches end of non-void function [-Wreturn-type]
   27 |     set<int> sat;
      |              ^~~
koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:98:1: warning: control reaches end of non-void function [-Wreturn-type]
   98 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...