oj.uz

Submission #709401

# Submission time Handle Problem Language Result Execution time Memory
709401 2023-03-13T14:00:41 Z 600Mihnea Game (APIO22_game) C++17
60 / 100
 4000 ms 44804 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<int> prec;
vector<vector<int>> g, ig;
vector<pair<int, int>> range;

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

int upd(int from, int to);

int test(int v)
{
	if (prec[v] == 1) return 0;
	if (range[v].first / prec[v] == range[v].second / prec[v])
	{
		assert(prec[v] >= 2);
		assert(prec[v] % 2 == 0);
		prec[v] /= 2;
		for (auto& vec : g[v])
		{
			if (upd(v, vec)) return 1;
		}
		for (auto& vec : ig[v])
		{
			if (upd(vec, v)) return 1;
		}
	}
	return 0;
}

int upd(int from, int to)
{
	{
		int val = (from <= k) ? (from) : range[from].first;
		if (val/prec[to] > range[to].first/prec[to])
		{
			range[to].first = val;
			for (auto& vertex : g[to])
			{
				if (upd(to, vertex))
				{
					return 1;
				}
			}
		}
	}
	{
		int val = (to <= k) ? (to) : range[to].second;
		if (val/prec[from] < range[from].second/prec[from])
		{
			range[from].second = val;
			for (auto& vertex : ig[from])
			{
				if (upd(vertex, from))
				{
					return 1;
				}
			}
		}
	}
	if (test(from)) return 1;
	if (test(to)) 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);
}

Subtask #1
2.0 / 2.0

# 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 304 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct

Subtask #2
10.0 / 10.0

# 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 304 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 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 1 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct

Subtask #3
18.0 / 18.0

# 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 304 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 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 1 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 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 336 KB Output is correct
24 Correct 9 ms 424 KB Output is correct
25 Correct 7 ms 336 KB Output is correct
26 Correct 4 ms 336 KB Output is correct
27 Correct 3 ms 336 KB Output is correct
28 Correct 2 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct

Subtask #4
30.0 / 30.0

# 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 304 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 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 1 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 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 336 KB Output is correct
24 Correct 9 ms 424 KB Output is correct
25 Correct 7 ms 336 KB Output is correct
26 Correct 4 ms 336 KB Output is correct
27 Correct 3 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 20 ms 3192 KB Output is correct
31 Correct 5 ms 2464 KB Output is correct
32 Correct 20 ms 4280 KB Output is correct
33 Correct 21 ms 3880 KB Output is correct
34 Correct 1944 ms 5844 KB Output is correct
35 Correct 510 ms 4628 KB Output is correct
36 Correct 42 ms 3900 KB Output is correct
37 Correct 36 ms 3844 KB Output is correct
38 Correct 29 ms 3660 KB Output is correct
39 Correct 37 ms 3656 KB Output is correct
40 Correct 1379 ms 5736 KB Output is correct
41 Correct 288 ms 4160 KB Output is correct
42 Correct 151 ms 3964 KB Output is correct
43 Correct 57 ms 5828 KB Output is correct
44 Correct 1253 ms 5952 KB Output is correct

Subtask #5
0.0 / 40.0

# 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 304 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 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 1 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 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 336 KB Output is correct
24 Correct 9 ms 424 KB Output is correct
25 Correct 7 ms 336 KB Output is correct
26 Correct 4 ms 336 KB Output is correct
27 Correct 3 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 20 ms 3192 KB Output is correct
31 Correct 5 ms 2464 KB Output is correct
32 Correct 20 ms 4280 KB Output is correct
33 Correct 21 ms 3880 KB Output is correct
34 Correct 1944 ms 5844 KB Output is correct
35 Correct 510 ms 4628 KB Output is correct
36 Correct 42 ms 3900 KB Output is correct
37 Correct 36 ms 3844 KB Output is correct
38 Correct 29 ms 3660 KB Output is correct
39 Correct 37 ms 3656 KB Output is correct
40 Correct 1379 ms 5736 KB Output is correct
41 Correct 288 ms 4160 KB Output is correct
42 Correct 151 ms 3964 KB Output is correct
43 Correct 57 ms 5828 KB Output is correct
44 Correct 1253 ms 5952 KB Output is correct
45 Correct 261 ms 29180 KB Output is correct
46 Correct 15 ms 18256 KB Output is correct
47 Correct 14 ms 18256 KB Output is correct
48 Correct 348 ms 44804 KB Output is correct
49 Correct 310 ms 36632 KB Output is correct
50 Execution timed out 4050 ms 36692 KB Time limit exceeded
51 Halted 0 ms 0 KB -