oj.uz

Submission #201826

# Submission time Handle Problem Language Result Execution time Memory
201826 2020-02-12T06:11:15 Z _7_7_ Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 16504 KB 
#include "meetings.h"

#include <bits/stdc++.h>

#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
using namespace std;
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;                             
 
 
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 333;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 2e3 + 11;
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;

using namespace std;

int res[N][N];
vi g[N];



int ask (int x, int y) {
	if (x > y)
		swap(x, y);
	if (res[x][y] != -1)
		return res[x][y];
	return res[x][y] = Query(0, x, y);
}

void Solve(int n) {
	memset(res, -1, sizeof(res));
	forn (i, 1, n - 1) {
		forn (j, 1, n - 1)
			if (i != j && ask(i, j) == i) 
				g[i].pb(j);						
		g[0].pb(i);
	}

	queue < int > q;
	q.push(0);

	while (sz(q)) {
		int v = q.front();
		q.pop();
		for (auto x : g[v]) {
			bool ok = 1;
			for (auto y : g[v])
				if (x != y && ask(x, y) != x && ask(x, y) != v) {
					ok = 0;
					break;
				}
			
			if (ok) {
				Bridge(min(x, v), max(x, v));
				q.push(x);
			}									
		}
	}
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 16120 KB Output is correct
2 Correct 13 ms 16120 KB Output is correct
3 Correct 13 ms 16248 KB Output is correct
4 Correct 13 ms 16248 KB Output is correct
5 Correct 13 ms 16192 KB Output is correct
6 Correct 14 ms 16172 KB Output is correct
7 Correct 13 ms 16248 KB Output is correct
8 Correct 13 ms 16120 KB Output is correct
9 Correct 13 ms 16120 KB Output is correct
10 Correct 13 ms 16248 KB Output is correct
11 Correct 14 ms 16248 KB Output is correct
12 Correct 13 ms 16248 KB Output is correct
13 Correct 14 ms 16120 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 16120 KB Output is correct
2 Correct 13 ms 16120 KB Output is correct
3 Correct 13 ms 16248 KB Output is correct
4 Correct 13 ms 16248 KB Output is correct
5 Correct 13 ms 16192 KB Output is correct
6 Correct 14 ms 16172 KB Output is correct
7 Correct 13 ms 16248 KB Output is correct
8 Correct 13 ms 16120 KB Output is correct
9 Correct 13 ms 16120 KB Output is correct
10 Correct 13 ms 16248 KB Output is correct
11 Correct 14 ms 16248 KB Output is correct
12 Correct 13 ms 16248 KB Output is correct
13 Correct 14 ms 16120 KB Output is correct
14 Correct 14 ms 16248 KB Output is correct
15 Correct 14 ms 16248 KB Output is correct
16 Correct 14 ms 16248 KB Output is correct
17 Correct 14 ms 16248 KB Output is correct
18 Correct 17 ms 16248 KB Output is correct
19 Correct 13 ms 16152 KB Output is correct
20 Correct 13 ms 16248 KB Output is correct
21 Correct 13 ms 16248 KB Output is correct
22 Correct 14 ms 16248 KB Output is correct
23 Correct 14 ms 16248 KB Output is correct
24 Correct 14 ms 16248 KB Output is correct
25 Correct 14 ms 16252 KB Output is correct
26 Correct 14 ms 16248 KB Output is correct
27 Correct 159 ms 16376 KB Output is correct
28 Correct 159 ms 16248 KB Output is correct
29 Correct 168 ms 16380 KB Output is correct
30 Correct 166 ms 16376 KB Output is correct
31 Correct 174 ms 16376 KB Output is correct
32 Correct 178 ms 16264 KB Output is correct
33 Correct 155 ms 16248 KB Output is correct
34 Correct 150 ms 16376 KB Output is correct
35 Correct 149 ms 16248 KB Output is correct
36 Correct 167 ms 16248 KB Output is correct
37 Correct 231 ms 16376 KB Output is correct
38 Correct 260 ms 16504 KB Output is correct
39 Correct 228 ms 16504 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3083 ms 16504 KB Time limit exceeded
2 Halted 0 ms 0 KB -