Submission #709388

# Submission time Handle Problem Language Result Execution time Memory
709388 2023-03-13T13:54:08 Z 600Mihnea Game (APIO22_game) C++17
60 / 100
4000 ms 45588 KB
#include "game.h"
#include <cmath>
#include <functional>
#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <list>
#include <time.h>
#include <math.h>
#include <random>
#include <deque>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <cassert>
#include <bitset>
#include <sstream>
#include <chrono>
#include <cstring>
#include <numeric>

using namespace std;

const int INF = (int)1e9 + 7;
int n;
int k;
vector<vector<int>> g, ig;
vector<pair<int, int>> range;

void init(int nn, int kk)
{
	n = nn;
	k = kk;
	g.clear();
	ig.clear();
	range.clear();
	g.resize(n + 1);
	ig.resize(n + 1);
	range.resize(n + 1);
	for (int i = 1; i <= k; i++)
	{
		range[i] = { 0, k + 1 };
	}
	for (int i = k + 1; i <= n; i++)
	{
		range[i] = { 0, k + 1 };
	}
}

int upd(int from, int to)
{
	if (range[from].first >= range[to].second) return 1;
	if (range[from].second <= range[to].first) return 0;
	if (from <= k && from > range[to].first)
	{
		range[to].first = from;
		for (auto& vertex : g[to])
		{
			if (upd(to, vertex))
			{
				return 1;
			}
		}
	}
	if (to <= k && to < range[from].second)
	{
		range[from].second = to;
		for (auto& vertex : ig[from])
		{
			if (upd(vertex, from))
			{
				return 1;
			}
		}
	}
	if (range[from].first > range[to].first)
	{
		range[to].first = range[from].first;
		for (auto& vertex : g[to])
		{
			if (upd(to, vertex))
			{
				return 1;
			}
		}
	}
	if (range[to].second < range[from].second)
	{
		range[from].second = range[to].second;
		for (auto& vertex : ig[from])
		{
			if (upd(vertex, from))
			{
				return 1;
			}
		}
	}
	if (range[from].first >= range[from].second) return 1;
	if (range[to].first >= range[to].second) return 1;
	return 0;
}

int add_teleporter(int from, int to)
{
	from++;
	to++;
	assert(1 <= from && from <= n);
	assert(1 <= to && to <= n);

	g[from].push_back(to);
	ig[to].push_back(from);

	if (from >= to && from <= k) return 1;
	if (from == to) return 0;

	return upd(from, to);
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 360 KB Output is correct
24 Correct 6 ms 336 KB Output is correct
25 Correct 6 ms 464 KB Output is correct
26 Correct 3 ms 336 KB Output is correct
27 Correct 2 ms 336 KB Output is correct
28 Correct 2 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 360 KB Output is correct
24 Correct 6 ms 336 KB Output is correct
25 Correct 6 ms 464 KB Output is correct
26 Correct 3 ms 336 KB Output is correct
27 Correct 2 ms 336 KB Output is correct
28 Correct 2 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 25 ms 3084 KB Output is correct
31 Correct 6 ms 2368 KB Output is correct
32 Correct 19 ms 4124 KB Output is correct
33 Correct 22 ms 3812 KB Output is correct
34 Correct 2132 ms 6148 KB Output is correct
35 Correct 471 ms 4648 KB Output is correct
36 Correct 41 ms 3784 KB Output is correct
37 Correct 33 ms 3760 KB Output is correct
38 Correct 35 ms 3568 KB Output is correct
39 Correct 30 ms 3632 KB Output is correct
40 Correct 1730 ms 6388 KB Output is correct
41 Correct 207 ms 4316 KB Output is correct
42 Correct 125 ms 3892 KB Output is correct
43 Correct 45 ms 5064 KB Output is correct
44 Correct 1422 ms 6064 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 360 KB Output is correct
24 Correct 6 ms 336 KB Output is correct
25 Correct 6 ms 464 KB Output is correct
26 Correct 3 ms 336 KB Output is correct
27 Correct 2 ms 336 KB Output is correct
28 Correct 2 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 25 ms 3084 KB Output is correct
31 Correct 6 ms 2368 KB Output is correct
32 Correct 19 ms 4124 KB Output is correct
33 Correct 22 ms 3812 KB Output is correct
34 Correct 2132 ms 6148 KB Output is correct
35 Correct 471 ms 4648 KB Output is correct
36 Correct 41 ms 3784 KB Output is correct
37 Correct 33 ms 3760 KB Output is correct
38 Correct 35 ms 3568 KB Output is correct
39 Correct 30 ms 3632 KB Output is correct
40 Correct 1730 ms 6388 KB Output is correct
41 Correct 207 ms 4316 KB Output is correct
42 Correct 125 ms 3892 KB Output is correct
43 Correct 45 ms 5064 KB Output is correct
44 Correct 1422 ms 6064 KB Output is correct
45 Correct 265 ms 28052 KB Output is correct
46 Correct 14 ms 17104 KB Output is correct
47 Correct 15 ms 17080 KB Output is correct
48 Correct 330 ms 45588 KB Output is correct
49 Correct 303 ms 35648 KB Output is correct
50 Execution timed out 4022 ms 37840 KB Time limit exceeded
51 Halted 0 ms 0 KB -