oj.uz

Submission #344016

# Submission time Handle Problem Language Result Execution time Memory
344016 2021-01-05T04:37:37 Z juggernaut Library (JOI18_library) C++14
0 / 100
 349 ms 620 KB 
#include<bits/stdc++.h>
#include"library.h"
#ifdef EVAL
#else
#include"grader.cpp"
#endif
using namespace std;
vector<int>g[205],ans;
void dfs(int v,int p){
    ans.push_back(v+1);
    for(int to:g[v])if(to!=p)dfs(to,v);
}
void Solve(int n){
    vector<int>m(n,0);
    for(int i=0;i+1<n;i++){
        for(int j=i+1;j<n;j++){
            m[i]=m[j]=1;
            if(Query(m)==1){
                g[i].push_back(j);
                g[j].push_back(i);
            }
            m[i]=m[j]=0;
        }
    }
    int root=-1;
    for(int i=0;i<n;i++)if(g[i].size()==1)root=i;
    if(root!=-1)dfs(root,root);
    Answer(ans);
}

Subtask #1
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 271 ms 384 KB # of queries: 18336
2 Correct 242 ms 620 KB # of queries: 18145
3 Correct 266 ms 620 KB # of queries: 19900
4 Correct 274 ms 364 KB # of queries: 19900
5 Correct 257 ms 508 KB # of queries: 19900
6 Correct 349 ms 364 KB # of queries: 19900
7 Correct 274 ms 492 KB # of queries: 19900
8 Correct 277 ms 620 KB # of queries: 18528
9 Correct 275 ms 384 KB # of queries: 19701
10 Correct 111 ms 364 KB # of queries: 8256
11 Incorrect 0 ms 364 KB Wrong Answer [4]
12 Halted 0 ms 0 KB -

Subtask #2
0 / 81.0

# Verdict Execution time Memory Grader output
1 Correct 271 ms 384 KB # of queries: 18336
2 Correct 242 ms 620 KB # of queries: 18145
3 Correct 266 ms 620 KB # of queries: 19900
4 Correct 274 ms 364 KB # of queries: 19900
5 Correct 257 ms 508 KB # of queries: 19900
6 Correct 349 ms 364 KB # of queries: 19900
7 Correct 274 ms 492 KB # of queries: 19900
8 Correct 277 ms 620 KB # of queries: 18528
9 Correct 275 ms 384 KB # of queries: 19701
10 Correct 111 ms 364 KB # of queries: 8256
11 Incorrect 0 ms 364 KB Wrong Answer [4]
12 Halted 0 ms 0 KB -