# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
44038 | ruhanhabib39 | Library (JOI18_library) | C++17 | 329 ms | 1248 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 <cstdio>
#include <vector>
#include <algorithm>
#include <map>
#include "library.h"
using namespace std;
namespace {
int N;
const int MAXN = 1000;
vector<int> G[MAXN + 10];
vector<int> init(int l, int r, int i = -1) {
vector<int> v(N, 0);
if(l <= r) fill(v.begin() + l, v.begin() + r + 1, 1);
if(i != -1) v[i] ^= 1;
return v;
}
map<tuple<int,int,int>,int> cnt;
int ask(int l, int r, int i = -1) {
int& res = cnt[{l,r,i}];
if(res == 0) res = Query(init(l, r, i));
return res;
}
void addEdge(int i, int j) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |