# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
108849 | tictaccat | Library (JOI18_library) | C++14 | 231 ms | 616 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 "library.h"
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1000+10;
int N;
vector<pair<int,int>> known;
vector<vector<int>> pairs(MAX+10);
int queries = 0;
bool check(int j, int i) { //does (i->j) contain a not known pair?
queries++;
int already = 0;
for (auto p: known) {
if (j <= p.first && p.first <= i && j <= p.second && p.second <= i) already++;
}
vector<int> M(N,0);
for (int k = j; k <= i; k++) M[k] = 1;
return ((i-j+1)-Query(M) != already);
}
void Solve(int Nt)
{
N = Nt;
if (N == 1) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |