oj.uz

Submission #529770

# Submission time Handle Problem Language Result Execution time Memory
529770 2022-02-23T15:44:57 Z Koosha_mv Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 1756 KB 
#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<(x.F)<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
#include "meetings.h"

const int N=2020;

int n,rt;
vector<int> g[N];
/*
void Bridge(int u, int v){
	cout<<"BRIDGE "<<u<<" "<<v<<endl;
}
int Query(int u, int v, int w){
	int x;
	cout<<"QUERY "<<u<<" "<<v<<" "<<w<<endl;	
	cin>>x;
	return x;
}*/
bool cmp(int i,int j){
	if(i==rt) return 1;
	if(j==rt) return 0;
	return Query(i,j,rt)==i;
}
void findpath(vector<int> p){
	rt=-1;
	f(i,0,p.size()){
		int check=1;
		f(j,0,p.size()-2){
			int k=j+1;
			j+=(i<=j);
			k+=(i<=k);
			if(j!=i && k!=i && Query(p[i],p[j],p[k])==p[i]){
				check=0;
			}
			
		}
		if(check){
			rt=p[i];
			break;
		}
	}
	if(rt==-1) assert(0);
	vector<int> res;
	for(auto x : p) res.pb(x);
	sort(all(res),cmp);
	f(i,1,res.size()){
		Bridge(min(res[i],res[i-1]),max(res[i],res[i-1]));
	}
}
void solve(vector<int> vec){
	if(vec.size()==1) return ;
	vector<int> path;
	vector<pair<int,int>> e;
	int u=0,v=1;
	while(u==v) u=rand()%vec.size(),v=rand()%vec.size();
	u=vec[u],v=vec[v];
	e.pb({u,u});
	e.pb({v,v});
	for(auto x : vec){
		if(x==u || x==v) continue ;
		e.pb({Query(x,u,v),x});
	}	
	sort(all(e));
	vec.clear();
	f(i,0,e.size()){
		vec.pb(e[i].S);
		if(i==e.size()-1 || e[i].F!=e[i+1].F){
			path.pb(e[i].F);
			solve(vec);
			vec.clear();
		}
	}
	findpath(path);
}
void Solve(int pn){
	n=pn;
	vector<int> vec(n);
	iota(all(vec),0);
	solve(vec);
}
/*
int main(){
	srand(time(NULL));
	cin>>n;
	f(i,1,n){
		int u,v;
		cin>>u>>v;
		g[u].pb(v);
		g[v].pb(u);
	}
	Solve(n);
}
*/

Compilation message

meetings.cpp: In function 'void findpath(std::vector<int>)':
meetings.cpp:8:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define f(i,a,b) for(int i=a;i<b;i++)
......
   45 |  f(i,0,p.size()){
      |    ~~~~~~~~~~~~                
meetings.cpp:45:2: note: in expansion of macro 'f'
   45 |  f(i,0,p.size()){
      |  ^
meetings.cpp:8:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define f(i,a,b) for(int i=a;i<b;i++)
......
   47 |   f(j,0,p.size()-2){
      |     ~~~~~~~~~~~~~~             
meetings.cpp:47:3: note: in expansion of macro 'f'
   47 |   f(j,0,p.size()-2){
      |   ^
meetings.cpp:8:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define f(i,a,b) for(int i=a;i<b;i++)
......
   65 |  f(i,1,res.size()){
      |    ~~~~~~~~~~~~~~              
meetings.cpp:65:2: note: in expansion of macro 'f'
   65 |  f(i,1,res.size()){
      |  ^
meetings.cpp: In function 'void solve(std::vector<int>)':
meetings.cpp:8:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define f(i,a,b) for(int i=a;i<b;i++)
......
   84 |  f(i,0,e.size()){
      |    ~~~~~~~~~~~~                
meetings.cpp:84:2: note: in expansion of macro 'f'
   84 |  f(i,0,e.size()){
      |  ^
meetings.cpp:86:7: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |   if(i==e.size()-1 || e[i].F!=e[i+1].F){
      |      ~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 0 ms 328 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 0 ms 328 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 0 ms 328 KB Output is correct
13 Correct 0 ms 328 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 0 ms 328 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 0 ms 328 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 0 ms 328 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 328 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 0 ms 328 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 0 ms 328 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 0 ms 328 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
27 Correct 4 ms 328 KB Output is correct
28 Correct 3 ms 380 KB Output is correct
29 Correct 4 ms 328 KB Output is correct
30 Correct 4 ms 328 KB Output is correct
31 Correct 4 ms 456 KB Output is correct
32 Correct 7 ms 444 KB Output is correct
33 Correct 8 ms 328 KB Output is correct
34 Correct 9 ms 328 KB Output is correct
35 Correct 7 ms 436 KB Output is correct
36 Correct 4 ms 328 KB Output is correct
37 Correct 7 ms 436 KB Output is correct
38 Correct 12 ms 444 KB Output is correct
39 Correct 146 ms 1264 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 375 ms 672 KB Output is correct
2 Correct 434 ms 580 KB Output is correct
3 Correct 426 ms 572 KB Output is correct
4 Correct 399 ms 736 KB Output is correct
5 Correct 294 ms 564 KB Output is correct
6 Correct 301 ms 620 KB Output is correct
7 Correct 330 ms 700 KB Output is correct
8 Correct 376 ms 660 KB Output is correct
9 Correct 361 ms 956 KB Output is correct
10 Correct 372 ms 728 KB Output is correct
11 Correct 394 ms 836 KB Output is correct
12 Correct 384 ms 876 KB Output is correct
13 Correct 294 ms 768 KB Output is correct
14 Correct 355 ms 704 KB Output is correct
15 Correct 253 ms 600 KB Output is correct
16 Correct 306 ms 600 KB Output is correct
17 Correct 358 ms 736 KB Output is correct
18 Execution timed out 2133 ms 1756 KB Time limit exceeded
19 Halted 0 ms 0 KB -