# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
108656 | someone_aa | Library (JOI18_library) | C++17 | 557 ms | 868 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>
#define ll long long
#define pb push_back
using namespace std;
const int maxn = 1500;
vector<int>adj[maxn];
vector<int>M;
int n;
int preQuery(vector<int>M) {
int br = 0;
for(int i:M) {
if(i == 1) br++;
}
if(br == 0) return 0;
else return Query(M);
}
int find_neighbour(int x, int l=1, int r=n) {
if(l > r) return -1;
if(l == r) {
// check if X is connected to L or not
M[l-1] = M[x-1] = 1;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |