# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
334123 | CaroLinda | Library (JOI18_library) | C++14 | 390 ms | 640 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 debug
#define all(x) x.begin(),x.end()
#define ll long long
#define sz(x) (int)(x.size())
using namespace std;
int N ;
vector<int> M ;
vector< vector<int> > adj ;
bool thereIsAdjacency(int x )
{
M[x] = 1 ;
int a = Query(M) ;
M[x] = 0 ;
int b = Query(M) ;
return b >= a ;
}
void findAdjacency(vector<int> vec , int x)
{
if(sz(vec) == 1)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |