# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
768626 | raysh07 | Library (JOI18_library) | C++17 | 243 ms | 336 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 <bits/stdc++.h>
#include "library.h"
using namespace std;
vector<vector<int>> adj;
vector<int> comp;
bool check(int i, int j, int n){
if (i == j) return false;
vector <int> m(n, 0);
for (int k = i; k <= j; k++){
m[k] = 1;
}
int cnt = 0;
for (auto x : adj[i]) m[x] = 0;
for (int i = 0; i < n; i++) cnt += m[i];
if (cnt == 1) return false;
int a1 = Query(m);
m[i] = 0;
int a2;
if (cnt != 2)
a2 = Query(m);
else a2 = 1;
return a2 >= a1;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |