// Why am I so dumb? :c // chrono::system_clock::now().time_since_epoch().count() #include<bits/stdc++.h> #include "koala.h" //#include<ext/pb_ds/assoc_container.hpp> //#include<ext/pb_ds/tree_policy.hpp> #define pb push_back #define mp make_pair #define all(x) (x).begin(), (x).end() #define fi first #define se second using namespace std; //using namespace __gnu_pbds; typedef long long ll; typedef pair<int, int> pii; //template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; int minValue(int N, int W) { int me[N], you[N]; for (int i = 0; i < N; ++i) { me[i] = 0; } me[0] = 1; playRound(me, you); int i = 0; while (you[i]) { ++i; } // Implement Subtask 1 solution here. return i; } int maxValue(int N, int W) { // Implement Subtask 2 solution here. return 0; } int greaterValue(int N, int W) { // Implement Subtask 3 solution here. 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. } }