Submission #238722

# Submission time Handle Problem Language Result Execution time Memory
238722 2020-06-12T12:37:31 Z b00n0rp Meetings (JOI19_meetings) C++17
100 / 100
1156 ms 1016 KB
#include <bits/stdc++.h>
#include "meetings.h"
using namespace std;
 
typedef long double LD;
typedef long long ll;
#define pb push_back
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define all(v) v.begin(),v.end()
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
 
vi gg[2005];
vpii edges;

int globalu;

bool cmp(int x,int y){
	return Query(globalu,x,y) == x;
}

void dfs(int u){
	vi mkc;
	for(auto x:gg[u]) mkc.pb(x);
	gg[u].clear();
	if(mkc.size() == 0) return;
	if(mkc.size() == 1){
		edges.pb({u,mkc[0]});
		return;
	}
	int v = mkc[rand()%mkc.size()];
	vi path;
	for(auto x:mkc){
		if(x == v) continue;
		int lol = Query(u,v,x);
		if(lol == x) path.pb(x);
		else gg[lol].pb(x);
	}
	path.pb(v);
	globalu = u;
	sort(all(path),cmp);
	edges.pb({u,path[0]});
	REP(i,path.size()-1) edges.pb({path[i],path[i+1]});
	dfs(u);
	for(auto x:path) dfs(x);
}

void Solve(int n){
	int root = rand()%n;
	REP(i,n){
		if(i != root){
			gg[root].pb(i);
		}
	}
	dfs(root);
	for(auto x:edges){
		Bridge(min(x.F,x.S),max(x.F,x.S));
	}
}

Compilation message

meetings.cpp: In function 'void dfs(int)':
meetings.cpp:8:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,n) for (int i = 0; i < n; i++)
meetings.cpp:48:6:
  REP(i,path.size()-1) edges.pb({path[i],path[i+1]});
      ~~~~~~~~~~~~~~~                
meetings.cpp:48:2: note: in expansion of macro 'REP'
  REP(i,path.size()-1) edges.pb({path[i],path[i+1]});
  ^~~
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 12 ms 512 KB Output is correct
28 Correct 10 ms 512 KB Output is correct
29 Correct 9 ms 512 KB Output is correct
30 Correct 9 ms 512 KB Output is correct
31 Correct 9 ms 512 KB Output is correct
32 Correct 13 ms 512 KB Output is correct
33 Correct 17 ms 512 KB Output is correct
34 Correct 20 ms 512 KB Output is correct
35 Correct 19 ms 512 KB Output is correct
36 Correct 11 ms 512 KB Output is correct
37 Correct 16 ms 512 KB Output is correct
38 Correct 20 ms 512 KB Output is correct
39 Correct 20 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 540 ms 760 KB Output is correct
2 Correct 606 ms 736 KB Output is correct
3 Correct 658 ms 1016 KB Output is correct
4 Correct 575 ms 760 KB Output is correct
5 Correct 383 ms 888 KB Output is correct
6 Correct 382 ms 760 KB Output is correct
7 Correct 645 ms 760 KB Output is correct
8 Correct 757 ms 760 KB Output is correct
9 Correct 690 ms 888 KB Output is correct
10 Correct 651 ms 892 KB Output is correct
11 Correct 852 ms 888 KB Output is correct
12 Correct 595 ms 864 KB Output is correct
13 Correct 303 ms 760 KB Output is correct
14 Correct 562 ms 760 KB Output is correct
15 Correct 475 ms 760 KB Output is correct
16 Correct 490 ms 932 KB Output is correct
17 Correct 710 ms 760 KB Output is correct
18 Correct 439 ms 760 KB Output is correct
19 Correct 470 ms 760 KB Output is correct
20 Correct 573 ms 760 KB Output is correct
21 Correct 733 ms 760 KB Output is correct
22 Correct 564 ms 760 KB Output is correct
23 Correct 635 ms 760 KB Output is correct
24 Correct 554 ms 760 KB Output is correct
25 Correct 584 ms 760 KB Output is correct
26 Correct 560 ms 1016 KB Output is correct
27 Correct 601 ms 760 KB Output is correct
28 Correct 825 ms 812 KB Output is correct
29 Correct 701 ms 844 KB Output is correct
30 Correct 700 ms 888 KB Output is correct
31 Correct 788 ms 888 KB Output is correct
32 Correct 881 ms 904 KB Output is correct
33 Correct 1156 ms 856 KB Output is correct
34 Correct 14 ms 512 KB Output is correct
35 Correct 10 ms 512 KB Output is correct
36 Correct 10 ms 512 KB Output is correct
37 Correct 10 ms 512 KB Output is correct
38 Correct 9 ms 512 KB Output is correct
39 Correct 13 ms 512 KB Output is correct
40 Correct 17 ms 508 KB Output is correct
41 Correct 20 ms 508 KB Output is correct
42 Correct 20 ms 512 KB Output is correct
43 Correct 12 ms 512 KB Output is correct
44 Correct 19 ms 512 KB Output is correct
45 Correct 19 ms 512 KB Output is correct
46 Correct 19 ms 512 KB Output is correct
47 Correct 5 ms 384 KB Output is correct
48 Correct 5 ms 384 KB Output is correct
49 Correct 4 ms 384 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 5 ms 384 KB Output is correct
52 Correct 5 ms 384 KB Output is correct
53 Correct 5 ms 384 KB Output is correct
54 Correct 5 ms 384 KB Output is correct
55 Correct 5 ms 384 KB Output is correct
56 Correct 5 ms 384 KB Output is correct
57 Correct 5 ms 384 KB Output is correct
58 Correct 5 ms 384 KB Output is correct
59 Correct 5 ms 384 KB Output is correct
60 Correct 4 ms 384 KB Output is correct
61 Correct 4 ms 384 KB Output is correct
62 Correct 4 ms 384 KB Output is correct
63 Correct 4 ms 384 KB Output is correct
64 Correct 4 ms 384 KB Output is correct
65 Correct 5 ms 384 KB Output is correct
66 Correct 5 ms 384 KB Output is correct
67 Correct 4 ms 384 KB Output is correct
68 Correct 4 ms 384 KB Output is correct
69 Correct 4 ms 384 KB Output is correct
70 Correct 4 ms 384 KB Output is correct
71 Correct 4 ms 384 KB Output is correct
72 Correct 5 ms 384 KB Output is correct