| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 538083 |
2022-03-16T05:05:31 Z |
huangqr |
Library (JOI18_library) |
C++14 |
|
46 ms |
328 KB |
#include <cstdio>
#include <vector>
#include "library.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
void Solve(int N)
{
vector<int>M(N,1);
vector<int>ans;
set<int>unknown;
for(int i=1;i<=N;i++)unknown.insert(i);
for(int i=0;i<N;i++){//Locating an edge, letting it be L
M[i]=0;
if(Query(M)==1){
ans.push_back(i+1);
unknown.erase(i+1);
break;
}
M[i]=1;
}
while((int)ans.size()<N){
/*cout<<"ans: ";
for(auto x:ans)cout<<x<<" ";
cout<<"\n";*/
set<int>space=unknown,a,b;
while(space.size()>1){
/*cout<<"space: ";
for(auto x:space)cout<<x<<" ";
cout<<"\n";*/
int halfsize=space.size()/2;
auto it=space.begin();
for(int i=0;i<halfsize;i++){
a.insert(*it);
it++;
}
for(int i=halfsize;i<(int)space.size();i++){
b.insert(*it);
it++;
}
/*cout<<"a: ";
for(auto x:a)cout<<x<<" ";
cout<<"\n";
cout<<"b: ";
for(auto x:b)cout<<x<<" ";
cout<<"\n";*/
M=vector<int>(N,0);
for(auto x:a)M[x-1]=1;
int pre = Query(M);
M[ans.back()-1]=1;
int aft = Query(M);
if(pre==aft)space=a;
else space=b;
a.clear();
b.clear();
}
assert(!space.empty());
ans.push_back(*(space.begin()));
unknown.erase(*(space.begin()));
}
Answer(ans);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
37 ms |
208 KB |
# of queries: 2375 |
| 2 |
Correct |
39 ms |
208 KB |
# of queries: 2409 |
| 3 |
Correct |
41 ms |
208 KB |
# of queries: 2648 |
| 4 |
Correct |
42 ms |
328 KB |
# of queries: 2595 |
| 5 |
Correct |
41 ms |
328 KB |
# of queries: 2508 |
| 6 |
Correct |
46 ms |
320 KB |
# of queries: 2551 |
| 7 |
Correct |
45 ms |
208 KB |
# of queries: 2544 |
| 8 |
Correct |
37 ms |
208 KB |
# of queries: 2420 |
| 9 |
Correct |
42 ms |
208 KB |
# of queries: 2546 |
| 10 |
Correct |
28 ms |
208 KB |
# of queries: 1474 |
| 11 |
Runtime error |
0 ms |
208 KB |
Execution killed with signal 13 |
| 12 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
37 ms |
208 KB |
# of queries: 2375 |
| 2 |
Correct |
39 ms |
208 KB |
# of queries: 2409 |
| 3 |
Correct |
41 ms |
208 KB |
# of queries: 2648 |
| 4 |
Correct |
42 ms |
328 KB |
# of queries: 2595 |
| 5 |
Correct |
41 ms |
328 KB |
# of queries: 2508 |
| 6 |
Correct |
46 ms |
320 KB |
# of queries: 2551 |
| 7 |
Correct |
45 ms |
208 KB |
# of queries: 2544 |
| 8 |
Correct |
37 ms |
208 KB |
# of queries: 2420 |
| 9 |
Correct |
42 ms |
208 KB |
# of queries: 2546 |
| 10 |
Correct |
28 ms |
208 KB |
# of queries: 1474 |
| 11 |
Runtime error |
0 ms |
208 KB |
Execution killed with signal 13 |
| 12 |
Halted |
0 ms |
0 KB |
- |
