Submission #1062854

#TimeUsernameProblemLanguageResultExecution timeMemory
1062854bleahbleahKoala Game (APIO17_koala)C++17
9 / 100
119 ms464 KiB
#include "koala.h" #include <bits/stdc++.h> #define all(x) (x).begin(),(x).end() using namespace std; using ll = long long; using ld = long double; //#define int ll #define sz(x) ((int)(x).size()) using pii = pair<int,int>; using tii = tuple<int,int,int>; namespace Query { int B[1001], R[1001]; vector<int> query(vector<int> a) { for(int i = 0; i < sz(a); i++) B[i] = a[i]; playRound(B, R); vector<int> r; for(int i = 0; i < sz(a); i++) r.emplace_back(R[i] > B[i]); return r; } } using Query::query; int minValue(int N, int W) { vector<int> a(N); a[0] = 1; auto b = query(a); for(int i = 0; i < N; i++) if(b[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. return 0; } int greaterValue(int N, int W) { int l = 1, r = min(15, W / 2); for(int mid = 1; mid <= 8; mid++) { vector<int> t(N, 0); t[0] = mid; t[1] = mid; auto q = query(t); if(q[0] + q[1] == 1) { return q[0] != 1; } if(q[0] + q[1] == 2) l = mid; else r = mid; } 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. } }

Compilation message (stderr)

koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:43:8: warning: variable 'l' set but not used [-Wunused-but-set-variable]
   43 |    int l = 1, r = min(15, W / 2);
      |        ^
koala.cpp:43:15: warning: variable 'r' set but not used [-Wunused-but-set-variable]
   43 |    int l = 1, r = min(15, W / 2);
      |               ^
koala.cpp: In function 'int minValue(int, int)':
koala.cpp:29:19: warning: control reaches end of non-void function [-Wreturn-type]
   29 |    vector<int> a(N);
      |                   ^
#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...