oj.uz

답안 #784617

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
784617 2023-07-16T11:08:28 Z kshitij_sodani Park (JOI17_park) C++14
67 / 100
 225 ms 680 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'

#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;
bool cmp(int aa,int bb){
	if(aa==bb){
		return false;
	}
	for(int i=0;i<n;i++){
		cur[i]=1;
	}
	cur[aa]=0;
	if(query(0,bb,cur)==1){
		return false;
	}
	else{
		return true;
	}
}
void Detect(int t, int nn) {
	int i;
	n=nn;

	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);
				}
			}
			low=-1;
			
			for(int j=0;j<n;j++){
				cur[j]=1;
			}
			vector<int> kk;
			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;
						}
						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
			}
			//you need to sort elements of kk between x and i
			for(auto j:kk){
				vis[j]=1;
			}
			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:56:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     if(low+(1<<j)<ss.size()){
      |        ~~~~~~~~~~^~~~~~~~~~
park.cpp:57:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |      for(int ii=0;ii<ss.size();ii++){
      |                   ~~^~~~~~~~~~
park.cpp:101:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |      if(low+(1<<j)<tt.size()){
      |         ~~~~~~~~~~^~~~~~~~~~
park.cpp:102:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |       for(int ii=0;ii<tt.size();ii++){
      |                    ~~^~~~~~~~~~
park.cpp:120:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     if(low+1==tt.size()){
      |        ~~~~~^~~~~~~~~~~
park.cpp:43:6: warning: unused variable 'i' [-Wunused-variable]
   43 |  int i;
      |      ^

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Wrong Answer[2]
2 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 157 ms 536 KB Output is correct
2 Correct 91 ms 528 KB Output is correct
3 Correct 109 ms 552 KB Output is correct
4 Correct 161 ms 556 KB Output is correct
5 Correct 163 ms 524 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 146 ms 488 KB Output is correct
2 Correct 142 ms 460 KB Output is correct
3 Correct 143 ms 468 KB Output is correct
4 Correct 132 ms 468 KB Output is correct
5 Correct 150 ms 476 KB Output is correct
6 Correct 159 ms 476 KB Output is correct
7 Correct 136 ms 472 KB Output is correct
8 Correct 144 ms 476 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 356 KB Output is correct
2 Correct 163 ms 588 KB Output is correct
3 Correct 161 ms 472 KB Output is correct
4 Correct 148 ms 480 KB Output is correct
5 Correct 165 ms 468 KB Output is correct
6 Correct 178 ms 512 KB Output is correct
7 Correct 174 ms 468 KB Output is correct
8 Correct 155 ms 464 KB Output is correct
9 Correct 156 ms 472 KB Output is correct
10 Correct 173 ms 608 KB Output is correct
11 Correct 155 ms 472 KB Output is correct
12 Correct 160 ms 484 KB Output is correct
13 Correct 172 ms 472 KB Output is correct
14 Correct 150 ms 680 KB Output is correct
15 Correct 177 ms 476 KB Output is correct
16 Correct 142 ms 468 KB Output is correct
17 Correct 154 ms 512 KB Output is correct
18 Correct 168 ms 616 KB Output is correct
19 Correct 192 ms 480 KB Output is correct
20 Correct 176 ms 472 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 225 ms 488 KB Wrong Answer[2]
2 Halted 0 ms 0 KB -