# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
48560 | ngkan146 | Library (JOI18_library) | C++14 | 513 ms | 4968 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;
int cnt[1005][10]; // if bit x off -> insert i, else erase i
vector <int> askBitAll[10];
int cntAll[10], cntNum[10];
vector <int> G[1005];
vector <int> ans;
int cntMask[1024];
int cntnumMask[1024];
vector <int> askMask[1024];
void dfs(int u,int p){
ans.push_back(u);
for(auto v: G[u]){
if (v == p) continue;
dfs(v, u);
}
}
void Solve(int n){
if (n == 1){
ans.push_back(1);
Answer(ans);
return;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |