oj.uz

Submission #784711

# Submission time Handle Problem Language Result Execution time Memory
784711 2023-07-16T12:47:45 Z kshitij_sodani Park (JOI17_park) C++14
77 / 100
 188 ms 724 KB 
#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'

int query(int x,int y,int Place[]){
	return Ask(min(x,y),max(x,y),Place);
}
static int cur[1501];
vector<int> adj[1501];
int vis[1501];
int par3[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;
	}
}
int val[1501];
vector<int> ee;
void dfs3(int no,int par=-1){
	ee.pb(no);
	for(auto j:adj[no]){
		if(j!=par and val[j]==1){
			dfs3(j,no);
		}
	}
}
vector<pair<int,int>> ans;
void solve(int i,vector<int> tt){
	if(tt.size()==0){
		return;
	}
	for(int j=0;j<n;j++){
		val[j]=0;
	}
	for(auto j:tt){
		val[j]=1;
	}
	ee.clear();
	dfs3(tt[0]);
	for(int j=0;j<n;j++){
		cur[j]=0;
	}
	for(auto j:tt){
		cur[j]=1;
	}
	cur[i]=1;
	if(query(i,tt[0],cur)==1){
		int low=-1;
		for(int j=19;j>=0;j--){
			if(low+(1<<j)<ee.size()){
				for(int ii=0;ii<ee.size();ii++){
					if(ii<=(low+(1<<j))){
						cur[ss[ii]]=1;
					}
					else{
						cur[ss[ii]]=0;
					}
				}
				if(query(i,tt[0],cur)==0){
					low+=(1<<j);
				}
			}
		}
		low++;
		int x=ee[low];
		ans.pb({x,i});
		vector<int> mm;
		
		for(auto j:adj[x]){
			if(val[j]==1){
				mm.pb(j);
			}
		}
		val[x]=0;
		vector<vector<int>> za;
		for(auto j:mm){
			ee.clear();
			dfs3(j);
			za.pb(ee);
		}
		for(auto j:za){
			solve(i,j);
		}
	}
	else{
		return;
	}



}

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);
				par3[j]=x;
				adj[j].pb(x);
				x=j;
			}
		}
	}
	for(int i=1;i<n;i++){
		for(auto j:adj[par3[i]]){
			if(j==i){
				continue;
			}
			ss.clear();
			dfs(j,par3[i]);
			solve(i,ss);
		}
	}
	for(int i=0;i<n;i++){
		for(auto j:adj[i]){
			if(i>j){
				continue;
			}
			//cout<<i<<":"<<j<<endl;
			Answer(min(i,j),max(i,j));
		}
	}
	for(auto j:ans){
	//	cout<<j.a<<"::"<<j.b<<endl;
		Answer(min(j.a,j.b),max(j.a,j.b));
	}

}

Compilation message

park.cpp: In function 'void solve(int, std::vector<int>)':
park.cpp:82:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |    if(low+(1<<j)<ee.size()){
      |       ~~~~~~~~~~^~~~~~~~~~
park.cpp:83:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |     for(int ii=0;ii<ee.size();ii++){
      |                  ~~^~~~~~~~~~
park.cpp: In function 'void Detect(int, int)':
park.cpp:153:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  153 |     if(low+(1<<j)<ss.size()){
      |        ~~~~~~~~~~^~~~~~~~~~
park.cpp:154:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  154 |      for(int ii=0;ii<ss.size();ii++){
      |                   ~~^~~~~~~~~~
park.cpp:207:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  207 |      if(low+(1<<j)<tt.size()){
      |         ~~~~~~~~~~^~~~~~~~~~
park.cpp:208:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  208 |       for(int ii=0;ii<tt.size();ii++){
      |                    ~~^~~~~~~~~~
park.cpp:231:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  231 |     if(low+1==tt.size()){
      |        ~~~~~^~~~~~~~~~~
park.cpp:126:6: warning: unused variable 'i' [-Wunused-variable]
  126 |  int i;
      |      ^

Subtask #1
10.0 / 10.0

# 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 6 ms 340 KB Output is correct
4 Correct 6 ms 340 KB Output is correct
5 Correct 6 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 508 KB Output is correct
2 Correct 117 ms 588 KB Output is correct
3 Correct 121 ms 724 KB Output is correct
4 Correct 149 ms 500 KB Output is correct
5 Correct 145 ms 604 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 472 KB Output is correct
2 Correct 164 ms 504 KB Output is correct
3 Correct 154 ms 508 KB Output is correct
4 Correct 142 ms 472 KB Output is correct
5 Correct 160 ms 464 KB Output is correct
6 Correct 152 ms 508 KB Output is correct
7 Correct 145 ms 468 KB Output is correct
8 Correct 159 ms 472 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 460 KB Output is correct
2 Correct 167 ms 504 KB Output is correct
3 Correct 162 ms 468 KB Output is correct
4 Correct 131 ms 476 KB Output is correct
5 Correct 159 ms 536 KB Output is correct
6 Correct 160 ms 504 KB Output is correct
7 Correct 121 ms 472 KB Output is correct
8 Correct 149 ms 472 KB Output is correct
9 Correct 140 ms 508 KB Output is correct
10 Correct 156 ms 484 KB Output is correct
11 Correct 188 ms 484 KB Output is correct
12 Correct 159 ms 648 KB Output is correct
13 Correct 124 ms 532 KB Output is correct
14 Correct 167 ms 612 KB Output is correct
15 Correct 127 ms 528 KB Output is correct
16 Correct 154 ms 476 KB Output is correct
17 Correct 169 ms 520 KB Output is correct
18 Correct 160 ms 488 KB Output is correct
19 Correct 152 ms 468 KB Output is correct
20 Correct 147 ms 468 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 133 ms 480 KB Wrong Answer[4]
2 Halted 0 ms 0 KB -