# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
200831 | BThero | Fireworks (APIO16_fireworks) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// 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;
}
return i;
}
int maxValue(int N, int W) {
return 0;
}
int greaterValue(int N, int W) {
int me[N], you[N];
for (int i = 0; i < N; ++i) {
me[i] = you[i] = 0;
}
int L = 1, R = 8;
int x = 0;
for (int b = 2; b >= 0; --b) {
x += (1 << b);
if (2 * x > W) {
x -= (1 << b);
continue;
}
me[0] = me[1] = x;
playRound(me, you);
if (you[0] > x && you[1] <= x) {
return 0;
}
if (you[1] > x && you[0] <= x) {
return 1;
}
if (you[0] <= x && you[1] <= x) {
x -= (1 << b);
}
}
}
void allValues(int N, int W, int *P) {
if (W == 2*N) {
}
else {
}
}