# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
388456 | 2021-04-11T15:30:25 Z | fadi57 | Library (JOI18_library) | C++14 | 222 ms | 576 KB |
#include <cstdio> #include<bits/stdc++.h> #include <vector> #include "library.h" //#include "grader.cpp" using namespace std; const int mx=10000; int l[mx]; int r[mx]; vector<int>adj[mx]; int vis[mx]; void Solve(int N) { vector<int> M(N); for(int i = 0; i < N; i++) { M[i] = 0; } memset(l,-1,mx); memset(r,-1,mx); map<int,int>mp; for(int i=0;i<N;i++){ M[i]=1; for(int j=i+1;j<N;j++){ M[j]=1; int z=Query(M); if(z==1){ adj[i].push_back(j); adj[j].push_back(i); } M[j]=0; } } int left=-1;int right=-1; int s; for(int i=0;i<N;i++){ if(adj[i].size()==1){ s=i;break; } } vector <int> res(N); queue<int>q; q.push(s); vis[s]=1; res[0]=s;int i=0; while(q.size()){ int me=q.front(); q.pop(); res[i]=me+1; for(auto it:adj[me]){ if(vis[it]){continue;} q.push(it); vis[it]=1; } i++; } Answer(res); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 222 ms | 576 KB | Wrong Answer [5] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 222 ms | 576 KB | Wrong Answer [5] |
2 | Halted | 0 ms | 0 KB | - |