# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
438172 | blue | Library (JOI18_library) | C++17 | 451 ms | 456 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 "library.h"
#include <vector>
#include <iostream>
using namespace std;
const int maxN = 1000;
int N1;
int ask_vector(vector<int> Q)
{
vector<int> M(N1, 0);
for(int q:Q) M[q-1] = 1;
return Query(M);
}
vector<int> neighbors[1+maxN];
bool neighboring(int i, int j)
{
bool flag = 0;
for(int x: neighbors[i]) if(x == j) flag = 1;
return flag;
}
void find_neighbors(int I, vector<int> Q)
{
// cerr << "find_neighbors " << I << ", ";
// for(int q:Q) cerr << q << ' ';
// cerr << '\n';
if(Q.size() == 0) return;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |