# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
420063 | oolimry | Monster Game (JOI21_monster) | C++17 | 143 ms | 1548 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.
#include "monster.h"
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int) (x).size()
#define all(x) (x).begin(), (x).end()
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
typedef long long lint;
typedef pair<lint,lint> ii;
map<ii, int> M;
bool query(int a, int b){
if(M.find(ii(a,b)) != M.end()) return M[ii(a,b)];
int res = Query(a,b);
//show3(a,b,res);
M[ii(a,b)] = res;
M[ii(b,a)] = not res;
return res;
}
struct thing{
int s, e, c;
};
vector<int> Solve(int n) {
vector<int> T(0);
vector<int> A(n);
vector<int> B(n);
//for (int i = 0; i < n; i++) T[i] = i;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |