제출 #977079

#제출 시각아이디문제언어결과실행 시간메모리
977079siewjh코알라 (APIO17_koala)C++17
37 / 100
56 ms476 KiB
#include "koala.h" #include <bits/stdc++.h> using namespace std; const int MAXN = 105; int qa[MAXN], ra[MAXN]; int minValue(int N, int W){ // N = 100, W = 100, 2 times qa[0] = 1; for (int i = 1; i < N; i++) qa[i] = 0; playRound(qa, ra); if (ra[0] <= 1) return 0; for (int i = 1; i < N; i++) if (ra[i] == 0) return i; } int maxValue(int N, int W){ // N = 100, W = 100, 4 times vector<int> loc; for (int i = 0; i < N; i++) loc.push_back(i); while (loc.size() > 1){ // 100, 50, 25, 9, 1 int amt = W / loc.size(); for (int i = 0; i < N; i++) qa[i] = 0; for (int x : loc) qa[x] = amt; playRound(qa, ra); vector<int> ori; swap(ori, loc); for (int x : ori) if (ra[x] > amt) loc.push_back(x); } return loc[0]; } int greaterValue(int N, int W){ // N = 100, W = 100, 3 times for (int i = 0; i < N; i++) qa[i] = 0; int lo = 0, hi = 4; int amt[] = {1, 2, 4, 6, 8}; while (lo <= hi){ int m = (lo + hi) >> 1; qa[0] = qa[1] = amt[m]; playRound(qa, ra); if (ra[0] > amt[m] != ra[1] > amt[m]) return ra[1] > amt[m]; else if (ra[0] > amt[m]) lo = m + 1; else hi = m - 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 greaterValue(int, int)':
koala.cpp:42:13: warning: suggest parentheses around comparison in operand of '!=' [-Wparentheses]
   42 |   if (ra[0] > amt[m] != ra[1] > amt[m]) return ra[1] > amt[m];
      |       ~~~~~~^~~~~~~~
koala.cpp: In function 'int minValue(int, int)':
koala.cpp:16:1: warning: control reaches end of non-void function [-Wreturn-type]
   16 | }
      | ^
koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:46:1: warning: control reaches end of non-void function [-Wreturn-type]
   46 | }
      | ^
#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...