oj.uz

답안 #784621

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
784621 2023-07-16T11:09:41 Z kshitij_sodani Park (JOI17_park) C++14
77 / 100
 210 ms 620 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;
	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);
				}
			}
			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:70:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |     if(low+(1<<j)<ss.size()){
      |        ~~~~~~~~~~^~~~~~~~~~
park.cpp:71:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |      for(int ii=0;ii<ss.size();ii++){
      |                   ~~^~~~~~~~~~
park.cpp:115:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |      if(low+(1<<j)<tt.size()){
      |         ~~~~~~~~~~^~~~~~~~~~
park.cpp:116:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |       for(int ii=0;ii<tt.size();ii++){
      |                    ~~^~~~~~~~~~
park.cpp:134:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  134 |     if(low+1==tt.size()){
      |        ~~~~~^~~~~~~~~~~
park.cpp:43:6: warning: unused variable 'i' [-Wunused-variable]
   43 |  int i;
      |      ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 5 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 157 ms 536 KB Output is correct
2 Correct 86 ms 472 KB Output is correct
3 Correct 102 ms 544 KB Output is correct
4 Correct 169 ms 492 KB Output is correct
5 Correct 157 ms 468 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 123 ms 480 KB Output is correct
2 Correct 132 ms 476 KB Output is correct
3 Correct 167 ms 468 KB Output is correct
4 Correct 142 ms 600 KB Output is correct
5 Correct 139 ms 472 KB Output is correct
6 Correct 133 ms 468 KB Output is correct
7 Correct 128 ms 476 KB Output is correct
8 Correct 143 ms 468 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 448 KB Output is correct
2 Correct 165 ms 472 KB Output is correct
3 Correct 156 ms 588 KB Output is correct
4 Correct 150 ms 584 KB Output is correct
5 Correct 159 ms 476 KB Output is correct
6 Correct 170 ms 512 KB Output is correct
7 Correct 173 ms 620 KB Output is correct
8 Correct 146 ms 468 KB Output is correct
9 Correct 148 ms 472 KB Output is correct
10 Correct 155 ms 484 KB Output is correct
11 Correct 149 ms 496 KB Output is correct
12 Correct 148 ms 468 KB Output is correct
13 Correct 169 ms 508 KB Output is correct
14 Correct 144 ms 492 KB Output is correct
15 Correct 176 ms 468 KB Output is correct
16 Correct 133 ms 480 KB Output is correct
17 Correct 175 ms 524 KB Output is correct
18 Correct 143 ms 484 KB Output is correct
19 Correct 175 ms 488 KB Output is correct
20 Correct 155 ms 480 KB Output is correct

Subtask #5
0 / 23.0

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