oj.uz

Submission #112562

# Submission time Handle Problem Language Result Execution time Memory
112562 2019-05-20T14:47:32 Z reality Meetings (JOI19_meetings) C++17
100 / 100
 1127 ms 948 KB 
#include "meetings.h"
#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define vii vector < pii >
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template < class P , class Q > ostream& operator<<(ostream& stream, pair < P , Q > v){ stream << "(" << v.fi << ',' << v.se << ")"; return stream;}
template < class T > ostream& operator<<(ostream& stream, const vector<T> v){ stream << "[ "; for (int i=0; i<(int)v.size(); i++) stream << v[i] << " "; stream << "]"; return stream;}
template < class T > T smin(T &a,T b) {if (a > b) a = b;return a;}
template < class T > T smax(T &a,T b) {if (a < b) a = b;return a;}
int n;
void shit(int x,int y) {
	if (x > y)
		Bridge(y,x);
	else
		Bridge(x,y);
}
#define Bridge shit
void Go(vi p) {
	if (p.size() <= 1) 
		return;
	else 
	if (p.size() == 2) {
		Bridge(p[0],p[1]);
	}
	else {
		const int sz = p.size();
		random_shuffle(all(p));
		vector < pii > v;
		for (int i = 2;i < sz;++i) {
			v.pb(mp(Query(p[0],p[1],p[i]),p[i]));
		}
		sort(all(v));
		vi w;
		w.pb(p[0]);
		w.pb(p[1]);
		for (int i = 0;i < v.size();) {
			int j = i;
			vi vr;
			w.pb(v[i].fi);
			while (j < v.size() && v[i].fi == v[j].fi)
				vr.pb(v[j].se),++j;
			vr.pb(v[i].fi);
			sort(all(vr));
			vr.resize(unique(all(vr)) - vr.begin());
			Go(vr);
			i = j;
		}
		sort(all(w));
		w.resize(unique(all(w)) - w.begin());
		sort(all(w),[&](int x,int y) {
				if (x == p[0] || y == p[1])
					return true;
				if (y == p[0] || x == p[1])
					return false;
				return x == Query(p[0],x,y);
			});
		for (int i = 0;i + 1 < w.size();++i)
			Bridge(w[i],w[i + 1]);
	}
}
void Solve(int NN) {
	srand(time(0));
	n = NN;
	vi p;
	for (int i = 0;i < n;++i)
		p.pb(i);
	Go(p);
}

Compilation message

meetings.cpp: In function 'void Go(std::vector<int>)':
meetings.cpp:46:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0;i < v.size();) {
                  ~~^~~~~~~~~~
meetings.cpp:50:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    while (j < v.size() && v[i].fi == v[j].fi)
           ~~^~~~~~~~~~
meetings.cpp:67:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0;i + 1 < w.size();++i)
                  ~~~~~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 381 ms 684 KB Output is correct
2 Correct 520 ms 948 KB Output is correct
3 Correct 604 ms 676 KB Output is correct
4 Correct 549 ms 744 KB Output is correct
5 Correct 303 ms 688 KB Output is correct
6 Correct 318 ms 680 KB Output is correct
7 Correct 347 ms 920 KB Output is correct
8 Correct 400 ms 732 KB Output is correct
9 Correct 463 ms 680 KB Output is correct
10 Correct 441 ms 744 KB Output is correct
11 Correct 497 ms 760 KB Output is correct
12 Correct 439 ms 760 KB Output is correct
13 Correct 264 ms 632 KB Output is correct
14 Correct 308 ms 680 KB Output is correct
15 Correct 365 ms 852 KB Output is correct
16 Correct 311 ms 760 KB Output is correct
17 Correct 463 ms 888 KB Output is correct
18 Correct 331 ms 892 KB Output is correct
19 Correct 322 ms 716 KB Output is correct
20 Correct 381 ms 644 KB Output is correct
21 Correct 374 ms 756 KB Output is correct
22 Correct 352 ms 760 KB Output is correct
23 Correct 307 ms 632 KB Output is correct
24 Correct 339 ms 836 KB Output is correct
25 Correct 303 ms 612 KB Output is correct
26 Correct 293 ms 808 KB Output is correct
27 Correct 325 ms 632 KB Output is correct
28 Correct 471 ms 808 KB Output is correct
29 Correct 360 ms 816 KB Output is correct
30 Correct 413 ms 680 KB Output is correct
31 Correct 498 ms 748 KB Output is correct
32 Correct 1127 ms 888 KB Output is correct
33 Correct 541 ms 760 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 6 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 4 ms 384 KB Output is correct
39 Correct 6 ms 384 KB Output is correct
40 Correct 8 ms 384 KB Output is correct
41 Correct 9 ms 384 KB Output is correct
42 Correct 9 ms 512 KB Output is correct
43 Correct 5 ms 384 KB Output is correct
44 Correct 9 ms 384 KB Output is correct
45 Correct 8 ms 512 KB Output is correct
46 Correct 5 ms 384 KB Output is correct
47 Correct 2 ms 256 KB Output is correct
48 Correct 2 ms 256 KB Output is correct
49 Correct 1 ms 384 KB Output is correct
50 Correct 2 ms 256 KB Output is correct
51 Correct 2 ms 384 KB Output is correct
52 Correct 2 ms 256 KB Output is correct
53 Correct 2 ms 256 KB Output is correct
54 Correct 2 ms 256 KB Output is correct
55 Correct 2 ms 256 KB Output is correct
56 Correct 2 ms 384 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 2 ms 384 KB Output is correct
59 Correct 2 ms 256 KB Output is correct
60 Correct 2 ms 256 KB Output is correct
61 Correct 2 ms 384 KB Output is correct
62 Correct 2 ms 256 KB Output is correct
63 Correct 1 ms 256 KB Output is correct
64 Correct 2 ms 384 KB Output is correct
65 Correct 2 ms 256 KB Output is correct
66 Correct 2 ms 384 KB Output is correct
67 Correct 3 ms 384 KB Output is correct
68 Correct 2 ms 384 KB Output is correct
69 Correct 2 ms 384 KB Output is correct
70 Correct 2 ms 256 KB Output is correct
71 Correct 2 ms 384 KB Output is correct
72 Correct 2 ms 384 KB Output is correct