oj.uz

Submission #529789

# Submission time Handle Problem Language Result Execution time Memory
529789 2022-02-23T16:38:06 Z Koosha_mv Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 1732 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;
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;
}*/
void findpath(vector<int> p){
	vector<int> res;
	if(p.size()<2) assert(0);
	res.pb(p[0]);
	res.pb(p[1]);
	f(i,2,p.size()){
		int u=p[i];
		int l,r;
		if(Query(u,res[0],res[1])==res[0]){
			l=-1,r=0;
		}
		else if(Query(u,res[res.size()-1],res[res.size()-2])==res[res.size()-1]){
			r=res.size();
		}
		else{
			l=0,r=res.size();
			while(l+1<r){
				int mid=(l+r)>>1;
				if(Query(u,res[mid],res[mid-1])==res[mid]) l=mid;
				else r=mid;
			}
		}
		vector<int> pes;
		f(i,0,res.size()){
			if(i==r) pes.pb(u);
			pes.pb(res[i]);
		}
		if(r==res.size()) pes.pb(u);
		res.clear();
		for(auto x : pes) res.pb(x);
	}
	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++)
......
   43 |  f(i,2,p.size()){
      |    ~~~~~~~~~~~~                
meetings.cpp:43:2: note: in expansion of macro 'f'
   43 |  f(i,2,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++)
......
   61 |   f(i,0,res.size()){
      |     ~~~~~~~~~~~~~~             
meetings.cpp:61:3: note: in expansion of macro 'f'
   61 |   f(i,0,res.size()){
      |   ^
meetings.cpp:65:7: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |   if(r==res.size()) pes.pb(u);
      |      ~^~~~~~~~~~~~
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++)
......
   69 |  f(i,1,res.size()){
      |    ~~~~~~~~~~~~~~              
meetings.cpp:69:2: note: in expansion of macro 'f'
   69 |  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++)
......
   88 |  f(i,0,e.size()){
      |    ~~~~~~~~~~~~                
meetings.cpp:88:2: note: in expansion of macro 'f'
   88 |  f(i,0,e.size()){
      |  ^
meetings.cpp:90: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]
   90 |   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 0 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 1 ms 328 KB Output is correct
8 Correct 1 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 1 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 0 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 1 ms 328 KB Output is correct
8 Correct 1 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 1 ms 328 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 0 ms 328 KB Output is correct
15 Correct 0 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 1 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 0 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 1 ms 328 KB Output is correct
8 Correct 1 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 1 ms 328 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 0 ms 328 KB Output is correct
15 Correct 0 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 1 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 4 ms 328 KB Output is correct
29 Correct 7 ms 328 KB Output is correct
30 Correct 5 ms 328 KB Output is correct
31 Correct 5 ms 328 KB Output is correct
32 Correct 5 ms 328 KB Output is correct
33 Correct 9 ms 420 KB Output is correct
34 Correct 8 ms 416 KB Output is correct
35 Correct 8 ms 328 KB Output is correct
36 Correct 4 ms 328 KB Output is correct
37 Correct 7 ms 328 KB Output is correct
38 Correct 10 ms 328 KB Output is correct
39 Correct 165 ms 1340 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 390 ms 612 KB Output is correct
2 Correct 458 ms 676 KB Output is correct
3 Correct 383 ms 660 KB Output is correct
4 Correct 405 ms 704 KB Output is correct
5 Correct 277 ms 580 KB Output is correct
6 Correct 326 ms 564 KB Output is correct
7 Correct 354 ms 704 KB Output is correct
8 Correct 377 ms 576 KB Output is correct
9 Correct 401 ms 736 KB Output is correct
10 Correct 354 ms 716 KB Output is correct
11 Correct 456 ms 752 KB Output is correct
12 Correct 318 ms 768 KB Output is correct
13 Correct 277 ms 796 KB Output is correct
14 Correct 395 ms 704 KB Output is correct
15 Correct 249 ms 716 KB Output is correct
16 Correct 327 ms 596 KB Output is correct
17 Correct 362 ms 736 KB Output is correct
18 Execution timed out 2009 ms 1732 KB Time limit exceeded
19 Halted 0 ms 0 KB -