Submission #707631

# Submission time Handle Problem Language Result Execution time Memory
707631 2023-03-09T15:06:29 Z 600Mihnea Game (APIO22_game) C++17
60 / 100
4000 ms 39064 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, k;
vector<vector<int>> g, ig;
vector<int> mn;
bool is;

void addedge(int from, int to)
{
	g[from].push_back(to);
	ig[to].push_back(from);
}

void init(int nn, int kk)
{
	is = 0;
	n = nn;
	k = kk;
	g.clear();
	g.resize(n);
	ig.clear();
	ig.resize(n);

	mn.clear();
	mn.resize(n, +INF);

}

void upd(int a, int value)
{
	if (is)
	{
		return;
	}
	if (value < mn[a])
	{
		mn[a] = value;
		if (a < k && mn[a] <= a)
		{
			is = 1;
			return;
		}
		for (auto& b : ig[a])
		{
			upd(b, mn[a]);
		}
	}
}

int add_teleporter(int from, int to)
{
	addedge(from, to);	
	if (to < k)
	{
		upd(from, to);
	}
	else
	{
		upd(from, mn[to]);
	}
	if (is)
	{
		return 1;
	}
	return 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 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 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 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 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 0 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 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 0 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 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 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 0 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 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 0 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 0 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 3 ms 336 KB Output is correct
25 Correct 3 ms 336 KB Output is correct
26 Correct 2 ms 420 KB Output is correct
27 Correct 3 ms 424 KB Output is correct
28 Correct 1 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 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 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 0 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 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 0 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 0 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 3 ms 336 KB Output is correct
25 Correct 3 ms 336 KB Output is correct
26 Correct 2 ms 420 KB Output is correct
27 Correct 3 ms 424 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 13 ms 3024 KB Output is correct
31 Correct 6 ms 2172 KB Output is correct
32 Correct 16 ms 4032 KB Output is correct
33 Correct 22 ms 3580 KB Output is correct
34 Correct 524 ms 4624 KB Output is correct
35 Correct 192 ms 4052 KB Output is correct
36 Correct 28 ms 3612 KB Output is correct
37 Correct 25 ms 3744 KB Output is correct
38 Correct 23 ms 3400 KB Output is correct
39 Correct 27 ms 3428 KB Output is correct
40 Correct 409 ms 4684 KB Output is correct
41 Correct 101 ms 3724 KB Output is correct
42 Correct 69 ms 3592 KB Output is correct
43 Correct 33 ms 4608 KB Output is correct
44 Correct 449 ms 4584 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 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 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 0 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 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 0 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 0 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 3 ms 336 KB Output is correct
25 Correct 3 ms 336 KB Output is correct
26 Correct 2 ms 420 KB Output is correct
27 Correct 3 ms 424 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 13 ms 3024 KB Output is correct
31 Correct 6 ms 2172 KB Output is correct
32 Correct 16 ms 4032 KB Output is correct
33 Correct 22 ms 3580 KB Output is correct
34 Correct 524 ms 4624 KB Output is correct
35 Correct 192 ms 4052 KB Output is correct
36 Correct 28 ms 3612 KB Output is correct
37 Correct 25 ms 3744 KB Output is correct
38 Correct 23 ms 3400 KB Output is correct
39 Correct 27 ms 3428 KB Output is correct
40 Correct 409 ms 4684 KB Output is correct
41 Correct 101 ms 3724 KB Output is correct
42 Correct 69 ms 3592 KB Output is correct
43 Correct 33 ms 4608 KB Output is correct
44 Correct 449 ms 4584 KB Output is correct
45 Correct 223 ms 26936 KB Output is correct
46 Correct 13 ms 15952 KB Output is correct
47 Correct 12 ms 16060 KB Output is correct
48 Correct 328 ms 39064 KB Output is correct
49 Correct 263 ms 34320 KB Output is correct
50 Execution timed out 4099 ms 29660 KB Time limit exceeded
51 Halted 0 ms 0 KB -