oj.uz

Submission #131534

# Submission time Handle Problem Language Result Execution time Memory
131534 2019-07-17T08:54:07 Z ekrem Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 1304 KB 
#include "meetings.h"
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define mod 1000000007
#define inf 1000000009
#define MAXN 1000005

using namespace std;

typedef long long ll;
typedef pair < int , int > ii;
typedef vector < int > vi;

int n, k, sil[MAXN];

int sor(int x, int y, int z){
	if(x == y)return x;
	if(z == y)return z;
	if(x == z)return x;
	return Query(x - 1, y - 1, z - 1) + 1;
}

void coz(vi a, int x){
	if(a.empty())
		return;
	vi b;
	int son = a[0];
	sil[0] = 1;
	// b.pb(a[0]);
	// cout << x << " -> " << son << " ";
	for(int i = 1; i < a.size(); i++){
		int it = a[i];
		// cout << *it << " ";
		int y = sor(son, x, it);
		// cout << son << " " << x << " " << *it << " = " << y << endl;
		if(y == x){
			sil[i] = 0;
			continue;
		}
		if(y == son){
			sil[+i] = 1;
			// b.pb(*it);
			// b.insert(*it);
			continue;
		}
		son = y;
		sil[i] = 1;
		// b.pb(*it);
	}
	// cout << endl;
	vi of;
	for(int i = 0; i < a.size(); i++)
		if(!sil[i])
			of.pb(a[i]);
		else if(a[i] != son)
			b.pb(a[i]);
	Bridge(min(x - 1, son - 1), max(x - 1, son - 1));
	// cout << x << " " << son << " " << b.size() << endl;
	coz(b, son);
	coz(of, x);
}

void Solve(int nn) {n = nn;
	vi a;
	for(int i = 2; i <= n; i++)
		a.pb(i);
	coz(a, 1);
}

Compilation message

meetings.cpp: In function 'void coz(vi, int)':
meetings.cpp:35:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 1; i < a.size(); i++){
                 ~~^~~~~~~~~~
meetings.cpp:56:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < a.size(); i++)
                 ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 248 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 248 KB Output is correct
9 Correct 2 ms 248 KB Output is correct
10 Correct 2 ms 380 KB Output is correct
11 Correct 2 ms 248 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 248 KB Output is correct
15 Correct 2 ms 248 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 248 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 12 ms 424 KB Output is correct
28 Correct 10 ms 376 KB Output is correct
29 Correct 13 ms 504 KB Output is correct
30 Correct 13 ms 376 KB Output is correct
31 Correct 10 ms 504 KB Output is correct
32 Correct 10 ms 504 KB Output is correct
33 Correct 13 ms 376 KB Output is correct
34 Correct 15 ms 376 KB Output is correct
35 Correct 14 ms 504 KB Output is correct
36 Correct 15 ms 632 KB Output is correct
37 Correct 86 ms 504 KB Output is correct
38 Correct 140 ms 808 KB Output is correct
39 Correct 187 ms 888 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1227 ms 752 KB Output is correct
2 Correct 1308 ms 876 KB Output is correct
3 Correct 1326 ms 888 KB Output is correct
4 Correct 1624 ms 952 KB Output is correct
5 Correct 1037 ms 948 KB Output is correct
6 Correct 769 ms 764 KB Output is correct
7 Correct 768 ms 680 KB Output is correct
8 Correct 739 ms 712 KB Output is correct
9 Correct 778 ms 808 KB Output is correct
10 Correct 738 ms 856 KB Output is correct
11 Correct 884 ms 772 KB Output is correct
12 Execution timed out 3061 ms 1304 KB Time limit exceeded
13 Halted 0 ms 0 KB -