oj.uz

답안 #410343

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
410343 2021-05-22T14:24:20 Z nathanlee726 Meetings (JOI19_meetings) C++14
100 / 100
 1020 ms 1060 KB 
//#include<i_am_noob_orz>
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
//#define int ll
#define ull unsigned long long
#define pii pair<int,int>
#define X first
#define Y second
#define mod ((ll)1e9+7)
#define pb push_back
#define mp make_pair
#define abs(x) ((x)>0?(x):(-(x)))
#define F(n) Fi(i,n)
#define Fi(i,n) Fl(i,0,n)
#define Fl(i,l,n) for(int i=l;i<n;i++)
#define memres(a) memset(a,0,sizeof(a))
#define all(a) a.begin(),a.end()
#define sz(a) ((int)a.size())
#define ceiling(a,b) (((a)+(b)-1)/(b))
#define endl '\n'
#define bit_count(x) __builtin_popcountll((x))
#define ykh mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define jimmy_is_kind false
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> rbtree;
 
//#define LOCAL
#ifdef LOCAL
#define bug(...) cerr<<"#"<<__LINE__<<' '<<#__VA_ARGS__<<"- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x) {cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr<<x<<", "; _do(y...);}
#define IOS()
int Query(int x,int y,int z){return x;}
void Bridge(int u,int v){cout<<u<<" "<<v<<endl;}
#else
#include<meetings.h> 
#define IOS() ios_base::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#define bug(...)
#endif
 
int add(int a,int b){return(a+b>=mod?a+b-mod:a+b);}
int sub(int a,int b){return(a<b?a+mod-b:a-b);}
int po(int a,int b){
	if(b==0)return 1;
	if(b==1)return(a%mod);
	int tem=po(a,b/2);
	if(b&1)return(((tem*tem)%mod)*a)%mod;
	else return(tem*tem)%mod; 
}
int GCD(int a,int b){
	int x=0;
	int ra,rb;
	while(a&&b){
		if(((a&1)==0)&&((b&1)==0)){
			a>>=1,b>>=1,x++;
		}
		else if((a^b)&1){
			if(a&1)b>>=1;
			else a>>=1;
		}
		else{
			ra=abs(a-b),rb=min(a,b);
			a=ra,b=rb;
		}
	}
	return max(a,b)<<x;
}
int gcd(int a,int b){if(b==0)return a;return gcd(b,a%b);}
set<int> g[2005];
bool used[2005],vis[2005];
int pa[2005];
pii dfs(int v,int f){
	pa[v]=f;
	int re0=v,re1=0;
	for(int u:g[v]){
		if(u==f||vis[u])continue;
		pii re=dfs(u,v);
		if(re.Y>re1)re0=re.X,re1=re.Y;
	}
	return {re0,re1+1};
}
void Solve(int n){
	int x=Query(0,1,2);
	if(x>=0&&x<=2){
		F(3){
			if(i==x)continue;
			g[i].insert(x);
			g[x].insert(i);
		}
	}
	else{
		F(3){
			g[i].insert(x);
			g[x].insert(i);
		}
	} 
	memres(used);
	F(3)used[i]=1;
	used[x]=1;
	Fl(i,3,n){
		if(used[i])continue;
		memres(vis);
		pii tmp=dfs(0,-1);
		int p1=tmp.X;
		tmp=dfs(p1,-1);
		int p2=tmp.X;
		int re;
		if(p1!=p2)re=Query(p1,p2,i);
		else re=p1;
		while(1){
			if(re==p1||re==p2){
				used[i]=1;
				g[re].insert(i);
				g[i].insert(re);
				break;
			}
			if(used[re]){
				int tp2=p2;
				while(tp2!=-1){
					vis[tp2]=1;
					tp2=pa[tp2]; 
				}
				vis[re]=0;
				tmp=dfs(re,-1);
				p1=tmp.X;
				tmp=dfs(p1,-1);
				p2=tmp.X;
				if(p1!=p2)re=Query(p1,p2,i);
				else re=p1;
			}
			else{
				int tp2=p2;
				vector<int> v;
				while(tp2!=-1){
					v.pb(tp2);
					tp2=pa[tp2];
				}
				int l=0,r=sz(v)-1;
				while(l+1<r){
					int mi=(l+r)/2;
					int t1=Query(v[l],v[mi],i);
					if(t1!=v[mi])r=mi;
					else l=mi;
				}
				assert(l+1==r);
				p1=v[l],p2=v[r];
				g[p1].erase(g[p1].find(p2));
				g[p2].erase(g[p2].find(p1));
				g[p1].insert(re);
				g[re].insert(p1);
				g[p2].insert(re);
				g[re].insert(p2);
				if(re!=i){
					g[re].insert(i);
					g[i].insert(re);
				} 
				used[i]=1;
				used[re]=1;
				break;
			}
		}
	}
	F(n){
		for(int j:g[i]){
			if(i<j)Bridge(i,j);
		}
	}
}
#ifdef LOCAL 
signed main(){
	int n;
	cin>>n;
	Solve(n);
	return 0;
}
#endif

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 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 1 ms 328 KB Output is correct
10 Correct 1 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 1 ms 328 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 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 1 ms 328 KB Output is correct
10 Correct 1 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 1 ms 328 KB Output is correct
14 Correct 1 ms 456 KB Output is correct
15 Correct 1 ms 456 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 456 KB Output is correct
18 Correct 1 ms 456 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 456 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 456 KB Output is correct
24 Correct 1 ms 456 KB Output is correct
25 Correct 1 ms 456 KB Output is correct
26 Correct 1 ms 456 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 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 1 ms 328 KB Output is correct
10 Correct 1 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 1 ms 328 KB Output is correct
14 Correct 1 ms 456 KB Output is correct
15 Correct 1 ms 456 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 456 KB Output is correct
18 Correct 1 ms 456 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 456 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 456 KB Output is correct
24 Correct 1 ms 456 KB Output is correct
25 Correct 1 ms 456 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 7 ms 456 KB Output is correct
28 Correct 7 ms 492 KB Output is correct
29 Correct 7 ms 456 KB Output is correct
30 Correct 7 ms 456 KB Output is correct
31 Correct 6 ms 456 KB Output is correct
32 Correct 8 ms 456 KB Output is correct
33 Correct 12 ms 496 KB Output is correct
34 Correct 16 ms 452 KB Output is correct
35 Correct 14 ms 456 KB Output is correct
36 Correct 7 ms 456 KB Output is correct
37 Correct 16 ms 500 KB Output is correct
38 Correct 15 ms 456 KB Output is correct
39 Correct 4 ms 456 KB Output is correct

Subtask #4
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 436 ms 848 KB Output is correct
2 Correct 486 ms 888 KB Output is correct
3 Correct 461 ms 956 KB Output is correct
4 Correct 466 ms 860 KB Output is correct
5 Correct 289 ms 760 KB Output is correct
6 Correct 358 ms 844 KB Output is correct
7 Correct 551 ms 892 KB Output is correct
8 Correct 738 ms 972 KB Output is correct
9 Correct 650 ms 1060 KB Output is correct
10 Correct 623 ms 776 KB Output is correct
11 Correct 659 ms 880 KB Output is correct
12 Correct 459 ms 936 KB Output is correct
13 Correct 313 ms 804 KB Output is correct
14 Correct 391 ms 772 KB Output is correct
15 Correct 361 ms 888 KB Output is correct
16 Correct 386 ms 860 KB Output is correct
17 Correct 544 ms 896 KB Output is correct
18 Correct 306 ms 900 KB Output is correct
19 Correct 318 ms 860 KB Output is correct
20 Correct 424 ms 880 KB Output is correct
21 Correct 422 ms 832 KB Output is correct
22 Correct 416 ms 984 KB Output is correct
23 Correct 420 ms 948 KB Output is correct
24 Correct 410 ms 848 KB Output is correct
25 Correct 441 ms 872 KB Output is correct
26 Correct 433 ms 872 KB Output is correct
27 Correct 452 ms 996 KB Output is correct
28 Correct 721 ms 784 KB Output is correct
29 Correct 593 ms 772 KB Output is correct
30 Correct 609 ms 764 KB Output is correct
31 Correct 671 ms 912 KB Output is correct
32 Correct 1020 ms 1052 KB Output is correct
33 Correct 156 ms 892 KB Output is correct
34 Correct 8 ms 584 KB Output is correct
35 Correct 7 ms 456 KB Output is correct
36 Correct 7 ms 456 KB Output is correct
37 Correct 7 ms 456 KB Output is correct
38 Correct 6 ms 456 KB Output is correct
39 Correct 8 ms 496 KB Output is correct
40 Correct 15 ms 484 KB Output is correct
41 Correct 16 ms 496 KB Output is correct
42 Correct 17 ms 488 KB Output is correct
43 Correct 7 ms 472 KB Output is correct
44 Correct 15 ms 508 KB Output is correct
45 Correct 15 ms 456 KB Output is correct
46 Correct 4 ms 456 KB Output is correct
47 Correct 1 ms 456 KB Output is correct
48 Correct 1 ms 456 KB Output is correct
49 Correct 1 ms 328 KB Output is correct
50 Correct 1 ms 456 KB Output is correct
51 Correct 1 ms 328 KB Output is correct
52 Correct 1 ms 456 KB Output is correct
53 Correct 1 ms 456 KB Output is correct
54 Correct 1 ms 328 KB Output is correct
55 Correct 1 ms 456 KB Output is correct
56 Correct 1 ms 456 KB Output is correct
57 Correct 1 ms 456 KB Output is correct
58 Correct 1 ms 456 KB Output is correct
59 Correct 1 ms 456 KB Output is correct
60 Correct 1 ms 328 KB Output is correct
61 Correct 1 ms 328 KB Output is correct
62 Correct 1 ms 328 KB Output is correct
63 Correct 1 ms 328 KB Output is correct
64 Correct 1 ms 328 KB Output is correct
65 Correct 1 ms 328 KB Output is correct
66 Correct 1 ms 328 KB Output is correct
67 Correct 1 ms 328 KB Output is correct
68 Correct 1 ms 328 KB Output is correct
69 Correct 1 ms 328 KB Output is correct
70 Correct 1 ms 328 KB Output is correct
71 Correct 1 ms 328 KB Output is correct
72 Correct 1 ms 328 KB Output is correct