Submission #238727

# Submission time Handle Problem Language Result Execution time Memory
238727 2020-06-12T12:41:26 Z b00n0rp Meetings (JOI19_meetings) C++17
29 / 100
1136 ms 1528 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;

int quer = 0;

bool cmp(int x,int y){
	quer++;
	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;
		quer++;
		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));
	}
	assert(quer <= 39000);
}

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:52:6:
  REP(i,path.size()-1) edges.pb({path[i],path[i+1]});
      ~~~~~~~~~~~~~~~                
meetings.cpp:52: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 4 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 4 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 4 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 4 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 4 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 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 512 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 4 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 4 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 4 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 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 512 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 12 ms 512 KB Output is correct
28 Correct 9 ms 512 KB Output is correct
29 Correct 9 ms 512 KB Output is correct
30 Correct 10 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 18 ms 512 KB Output is correct
34 Correct 20 ms 512 KB Output is correct
35 Correct 20 ms 512 KB Output is correct
36 Correct 11 ms 512 KB Output is correct
37 Correct 17 ms 512 KB Output is correct
38 Correct 18 ms 512 KB Output is correct
39 Correct 19 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 525 ms 760 KB Output is correct
2 Correct 590 ms 888 KB Output is correct
3 Correct 651 ms 760 KB Output is correct
4 Correct 567 ms 888 KB Output is correct
5 Correct 366 ms 760 KB Output is correct
6 Correct 376 ms 760 KB Output is correct
7 Correct 650 ms 1016 KB Output is correct
8 Correct 745 ms 896 KB Output is correct
9 Correct 709 ms 888 KB Output is correct
10 Correct 680 ms 760 KB Output is correct
11 Correct 883 ms 1016 KB Output is correct
12 Correct 569 ms 888 KB Output is correct
13 Correct 301 ms 760 KB Output is correct
14 Correct 544 ms 900 KB Output is correct
15 Correct 467 ms 760 KB Output is correct
16 Correct 479 ms 760 KB Output is correct
17 Correct 742 ms 888 KB Output is correct
18 Correct 434 ms 812 KB Output is correct
19 Correct 467 ms 736 KB Output is correct
20 Correct 573 ms 760 KB Output is correct
21 Correct 713 ms 888 KB Output is correct
22 Correct 546 ms 764 KB Output is correct
23 Correct 605 ms 888 KB Output is correct
24 Correct 542 ms 824 KB Output is correct
25 Correct 573 ms 760 KB Output is correct
26 Correct 555 ms 736 KB Output is correct
27 Correct 605 ms 888 KB Output is correct
28 Correct 791 ms 888 KB Output is correct
29 Correct 686 ms 768 KB Output is correct
30 Correct 691 ms 760 KB Output is correct
31 Correct 798 ms 888 KB Output is correct
32 Correct 861 ms 760 KB Output is correct
33 Runtime error 1136 ms 1528 KB Execution killed with signal 11 (could be triggered by violating memory limits)