# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
947079 | pcc | Library (JOI18_library) | C++17 | 3026 ms | 3832 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;
/*
vector<int> M(N);
int A = Query(M);
vector<int> res(N);
Answer(res);
*/
#define pii pair<int,int>
#define fs first
#define sc second
const int mxn = 1010;
vector<int> v;
vector<pii> edges;
vector<int> perm;
bitset<mxn> ch;
int N;
int ask(bitset<mxn> b){
if(b.count() == 0)return 0;
vector<int> re(N);
for(int i = 0;i<N;i++){
if(b[i])re[i] = 1;
else re[i] = 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |