#include "park.h"
#include <bits/stdc++.h>
using namespace std;
#define a first
#define b second
#define pb push_back
typedef long long llo;
#define endl '\n'
#define query Ask
static int cur[1501];
vector<int> adj[1501];
int vis[1501];
vector<int> ss;
void dfs(int no,int par=-1){
ss.pb(no);
for(auto j:adj[no]){
if(j!=par){
dfs(j,no);
}
}
}
int n;
vector<int> kk;
int xa;
bool cmp(int aa,int bb){
if(aa==bb){
return false;
}
for(int i=0;i<n;i++){
cur[i]=0;
}
for(auto j:kk){
cur[j]=1;
}
cur[xa]=1;
cur[aa]=0;
if(query(min(xa,bb),max(xa,bb),cur)==1){
return false;
}
else{
return true;
}
}
void Detect(int t, int nn) {
int i;
n=nn;
if(t==1){
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
for(int x=0;x<n;x++){
cur[x]=0;
}
cur[i]=1;
cur[j]=1;
if(query(i,j,cur)==1){
Answer(i,j);
}
}
}
return;
}
vis[0]=1;
for(int i=1;i<n;i++){
if(vis[i]==0){
ss.clear();
dfs(0);
for(int j=0;j<n;j++){
cur[j]=1;
}
int low=-1;
for(int j=19;j>=0;j--){
if(low+(1<<j)<ss.size()){
for(int ii=0;ii<ss.size();ii++){
if(ii<=(low+(1<<j))){
cur[ss[ii]]=1;
}
else{
cur[ss[ii]]=0;
}
}
/* if(i==2 and low+(1<<j)==0){
for(int jj=0;jj<n;jj++){
cout<<cur[jj]<<",,";
}
cout<<endl;
cout<<query(0,i,cur)<<endl;
}*/
if(query(0,i,cur)==0){
low+=(1<<j);
}
}
}
low++;
int x=ss[low];
/* for(auto j:ss){
cout<<j<<"::";
}
cout<<low<<"?"<<endl;
cout<<endl;
*/
vector<int> tt;
vis[i]=1;
for(int j=0;j<n;j++){
if(vis[j]==0){
tt.pb(j);
}
}
for(int j=0;j<n;j++){
cur[j]=0;
}
for(int j=0;j<=low;j++){
cur[ss[j]]=1;
}
cur[i]=1;
low=-1;
// cout<<22<<endl;
kk.clear();
while(true){
for(int j=19;j>=0;j--){
if(low+(1<<j)<tt.size()){
for(int ii=0;ii<tt.size();ii++){
if(ii<=(low+(1<<j))){
cur[tt[ii]]=0;
}
else{
cur[tt[ii]]=1;
}
}
for(auto ii:kk){
cur[ii]=1;
}
/* cout<<33<<endl;
for(int jj=0;jj<n;jj++){
cout<<cur[jj]<<":";
}
cout<<endl;*/
if(query(0,i,cur)==1){
low+=(1<<j);
}
}
}
//from prev to low nothing is there
//low+1 is there
if(low+1==tt.size()){
break;
}
low++;
kk.pb(tt[low]);
//low+1 must be there
}
// cout<<44<<endl;
//you need to sort elements of kk between x and i
for(auto j:kk){
vis[j]=1;
}
xa=x;
sort(kk.begin(),kk.end(),cmp);
kk.pb(i);
/* cout<<x<<",";
for(auto j:kk){
cout<<j<<",";
}
cout<<endl;*/
for(auto j:kk){
adj[x].pb(j);
x=j;
}
}
}
for(int i=0;i<n;i++){
for(auto j:adj[i]){
//cout<<i<<":"<<j<<endl;
Answer(min(i,j),max(i,j));
}
}
}
Compilation message
park.cpp: In function 'void Detect(int, int)':
park.cpp:76:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
76 | if(low+(1<<j)<ss.size()){
| ~~~~~~~~~~^~~~~~~~~~
park.cpp:77:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
77 | for(int ii=0;ii<ss.size();ii++){
| ~~^~~~~~~~~~
park.cpp:130:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
130 | if(low+(1<<j)<tt.size()){
| ~~~~~~~~~~^~~~~~~~~~
park.cpp:131:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
131 | for(int ii=0;ii<tt.size();ii++){
| ~~^~~~~~~~~~
park.cpp:154:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
154 | if(low+1==tt.size()){
| ~~~~~^~~~~~~~~~~
park.cpp:49:6: warning: unused variable 'i' [-Wunused-variable]
49 | int i;
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
6 ms |
340 KB |
Output is correct |
| 3 |
Correct |
8 ms |
340 KB |
Output is correct |
| 4 |
Correct |
6 ms |
372 KB |
Output is correct |
| 5 |
Correct |
6 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
105 ms |
516 KB |
Output is correct |
| 2 |
Correct |
107 ms |
524 KB |
Output is correct |
| 3 |
Correct |
97 ms |
528 KB |
Output is correct |
| 4 |
Correct |
124 ms |
492 KB |
Output is correct |
| 5 |
Correct |
120 ms |
508 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
103 ms |
452 KB |
Output is correct |
| 2 |
Correct |
122 ms |
456 KB |
Output is correct |
| 3 |
Correct |
112 ms |
436 KB |
Output is correct |
| 4 |
Correct |
107 ms |
456 KB |
Output is correct |
| 5 |
Correct |
108 ms |
444 KB |
Output is correct |
| 6 |
Correct |
107 ms |
444 KB |
Output is correct |
| 7 |
Correct |
106 ms |
452 KB |
Output is correct |
| 8 |
Correct |
108 ms |
452 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
53 ms |
420 KB |
Output is correct |
| 2 |
Correct |
109 ms |
452 KB |
Output is correct |
| 3 |
Correct |
112 ms |
452 KB |
Output is correct |
| 4 |
Correct |
83 ms |
452 KB |
Output is correct |
| 5 |
Correct |
129 ms |
472 KB |
Output is correct |
| 6 |
Correct |
120 ms |
500 KB |
Output is correct |
| 7 |
Correct |
85 ms |
448 KB |
Output is correct |
| 8 |
Correct |
104 ms |
456 KB |
Output is correct |
| 9 |
Correct |
90 ms |
460 KB |
Output is correct |
| 10 |
Correct |
116 ms |
476 KB |
Output is correct |
| 11 |
Correct |
127 ms |
468 KB |
Output is correct |
| 12 |
Correct |
116 ms |
468 KB |
Output is correct |
| 13 |
Correct |
84 ms |
472 KB |
Output is correct |
| 14 |
Correct |
124 ms |
464 KB |
Output is correct |
| 15 |
Correct |
84 ms |
472 KB |
Output is correct |
| 16 |
Correct |
134 ms |
444 KB |
Output is correct |
| 17 |
Correct |
152 ms |
492 KB |
Output is correct |
| 18 |
Correct |
112 ms |
472 KB |
Output is correct |
| 19 |
Correct |
113 ms |
492 KB |
Output is correct |
| 20 |
Correct |
111 ms |
464 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
133 ms |
468 KB |
Wrong Answer[6] |
| 2 |
Halted |
0 ms |
0 KB |
- |
