제출 #567958

#제출 시각아이디문제언어결과실행 시간메모리
567958hollwo_pelw코알라 (APIO17_koala)C++17
19 / 100
13 ms324 KiB
#include <bits/stdc++.h> using namespace std; #include "koala.h" int R[105], B[105]; void __init__() { memset(R, 0, sizeof R); memset(B, 0, sizeof B); } 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. __init__(); B[0] = 1; playRound(B, R); for (int i = 1; i < N; i++) if (!R[i]) 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. vector<int> res(N); iota(res.begin(), res.end(), 0); while ((int) res.size() > 1) { __init__(); for (auto i : res) B[i] = W / res.size(); playRound(B, R); int f = *max_element(R, R + N); res.clear(); for (int i = 0; i < N; i++) if (R[i] == f) res.push_back(i); } return res[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. } }
#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...