제출 #945094

#제출 시각아이디문제언어결과실행 시간메모리
945094ifateen코알라 (APIO17_koala)C++17
37 / 100
45 ms704 KiB
#include <bits/stdc++.h> #include "koala.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], r[N]; memset(b, 0, sizeof(b)); b[0] = 1; playRound(b, r); if (r[0] <= 1) { // he couldnt care less to take this return 0; } // he could sad for (int i = 1; i < N; i++) { if (r[i] == 0) return i; } } 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. vector<int> possible(N); iota(begin(possible), end(possible), 0); int b[N], r[N]; while (possible.size() > 1) { int add = W / possible.size(); memset(b, 0, sizeof(b)); for (auto& i : possible) b[i] = add; playRound(b, r); possible.clear(); for (int i = 0; i < N; i++) if (r[i] > add) possible.push_back(i); } return possible[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. int b[N], R[N]; memset(b, 0, sizeof(b)); int l = 1, r = 13; while (l <= r) { int mid = (l + r) >> 1; b[0] = mid, b[1] = mid; playRound(b, R); if (min(R[0], R[1]) > mid /*he took both so idk*/) l = mid + 1; else if (max(R[0], R[1]) <= mid /*he took neither so spend less lol*/) r = mid - 1; else { if (R[0] < R[1]) return 1; else return 0; } } assert(false); } 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 minValue(int, int)':
koala.cpp:20:1: warning: control reaches end of non-void function [-Wreturn-type]
   20 | }
      | ^
#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...