oj.uz

Submission #708945

# Submission time Handle Problem Language Result Execution time Memory
708945 2023-03-12T19:30:10 Z 600Mihnea Game (APIO22_game) C++17
60 / 100
 4000 ms 42588 KB 
#include <cstdio>
#include <cstdlib>
#include <vector>
#include "game.h"

#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 <bitset>
#include <cassert>
#include <sstream>
#include <chrono>
#include <cstring>
#include <numeric>

using namespace std;

const int R = 50;

bool F;
int n;
int k;
vector<vector<int>> g;
vector<vector<int>> ig;
vector<int> minAjungBucket;
vector<int> minAjung;

int getbucket(int x)
{
	return x / R;
}

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

	g.resize(n + 1);
	ig.resize(n + 1);
	minAjungBucket.resize(n + 1);
	minAjung.resize(n + 1);

	for (int i = 1; i <= n; i++)
	{
		minAjungBucket[i] = getbucket(k + 1);
		minAjung[i] = k + 1;
	}
}

void upd(int from)
{
	if (F)
	{
		return;
	}
	if (from <= k && minAjung[from] <= from)
	{
		F = 1;
	}
	for (auto& vec : ig[from])
	{
		if (minAjung[from] < minAjung[vec])
		{
			minAjung[vec] = minAjung[from];
			upd(vec);
		}
	}
}

void updBucket(int from)
{
	if (F)
	{
		return;
	}
	if (from <= k && minAjungBucket[from] <= getbucket(from))
	{
	//	F = 1;
	}
	for (auto& vec : ig[from])
	{
		if (minAjungBucket[from] < minAjungBucket[vec])
		{
			minAjungBucket[vec] = minAjungBucket[from];
			updBucket(vec);
		}
	}
}

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);

	{
		int val = ((to <= k) ? (to) : (minAjung[to]));
		if (val < minAjung[from])
		{
			minAjung[from] = val;
			upd(from);
		}
	}
	{
		int val = ((to <= k) ? (getbucket(to)) : (minAjungBucket[to]));
		if (val < minAjungBucket[from])
		{
			minAjungBucket[from] = val;
			updBucket(from);
		}
	}
	return F;
}

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 0 ms 208 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 304 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 0 ms 208 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 304 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 0 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 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 0 ms 208 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 304 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 0 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 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 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 412 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 352 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 0 ms 208 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 304 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 0 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 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 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 412 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 352 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 15 ms 3000 KB Output is correct
31 Correct 5 ms 2256 KB Output is correct
32 Correct 17 ms 4384 KB Output is correct
33 Correct 22 ms 3816 KB Output is correct
34 Correct 593 ms 5392 KB Output is correct
35 Correct 206 ms 4356 KB Output is correct
36 Correct 34 ms 3892 KB Output is correct
37 Correct 31 ms 3736 KB Output is correct
38 Correct 27 ms 3656 KB Output is correct
39 Correct 29 ms 3616 KB Output is correct
40 Correct 595 ms 5304 KB Output is correct
41 Correct 114 ms 3972 KB Output is correct
42 Correct 89 ms 3816 KB Output is correct
43 Correct 65 ms 5276 KB Output is correct
44 Correct 488 ms 5276 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 0 ms 208 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 304 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 0 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 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 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 412 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 352 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 15 ms 3000 KB Output is correct
31 Correct 5 ms 2256 KB Output is correct
32 Correct 17 ms 4384 KB Output is correct
33 Correct 22 ms 3816 KB Output is correct
34 Correct 593 ms 5392 KB Output is correct
35 Correct 206 ms 4356 KB Output is correct
36 Correct 34 ms 3892 KB Output is correct
37 Correct 31 ms 3736 KB Output is correct
38 Correct 27 ms 3656 KB Output is correct
39 Correct 29 ms 3616 KB Output is correct
40 Correct 595 ms 5304 KB Output is correct
41 Correct 114 ms 3972 KB Output is correct
42 Correct 89 ms 3816 KB Output is correct
43 Correct 65 ms 5276 KB Output is correct
44 Correct 488 ms 5276 KB Output is correct
45 Correct 312 ms 28056 KB Output is correct
46 Correct 14 ms 17104 KB Output is correct
47 Correct 15 ms 16996 KB Output is correct
48 Correct 281 ms 42588 KB Output is correct
49 Correct 242 ms 35524 KB Output is correct
50 Execution timed out 4021 ms 33176 KB Time limit exceeded
51 Halted 0 ms 0 KB -