답안 #707644

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
707644	2023-03-09T15:43:13 Z	600Mihnea	게임 (APIO22_game)	C++17	60 / 100	4000 ms	41344 KB

game

#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 rad;

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

int n, k;
vector<vector<int>> g, ig;
vector<int> mn, mn2,isprec;
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;
	rad = sqrt(n) + 2;

	g.clear();
	g.resize(n);
	ig.clear();
	ig.resize(n);

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

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

	isprec.clear();
	isprec.resize(n, 0);
}

void upd(int a, int value, int esteprec)
{
	if (is)
	{
		return;
	}
	assert(esteprec == 0 || esteprec == 1);
	if (esteprec == 1)
	{
		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], 1);
			}
		}
		return;
	}
	assert(esteprec == 0);
	if (value < mn2[a])
	{
		mn2[a] = value;
		for (auto& b : ig[a])
		{
			upd(b, mn2[a], 1);
		}
	}
}

int add_teleporter(int from, int to)
{
	addedge(from, to);
	if (to < k)
	{
		upd(from, to, 1);
		//upd(from, getbucket(to), 0);
	}
	else
	{
		upd(from, mn[to], 1);
		//upd(from, mn2[to], 0);
	}
	if (is)
	{
		return 1;
	}
	return 0;
}

Subtask #1
2.0 / 2.0

#	결과	실행 시간	메모리	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	0 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	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	0 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	0 ms	208 KB	Output is correct
16	Correct	0 ms	208 KB	Output is correct
17	Correct	0 ms	208 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	1 ms	208 KB	Output is correct

Subtask #3
18.0 / 18.0

#	결과	실행 시간	메모리	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	0 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	0 ms	208 KB	Output is correct
16	Correct	0 ms	208 KB	Output is correct
17	Correct	0 ms	208 KB	Output is correct
18	Correct	0 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	4 ms	336 KB	Output is correct
25	Correct	3 ms	336 KB	Output is correct
26	Correct	4 ms	336 KB	Output is correct
27	Correct	2 ms	364 KB	Output is correct
28	Correct	1 ms	336 KB	Output is correct
29	Correct	2 ms	336 KB	Output is correct

Subtask #4
30.0 / 30.0

#	결과	실행 시간	메모리	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	0 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	0 ms	208 KB	Output is correct
16	Correct	0 ms	208 KB	Output is correct
17	Correct	0 ms	208 KB	Output is correct
18	Correct	0 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	4 ms	336 KB	Output is correct
25	Correct	3 ms	336 KB	Output is correct
26	Correct	4 ms	336 KB	Output is correct
27	Correct	2 ms	364 KB	Output is correct
28	Correct	1 ms	336 KB	Output is correct
29	Correct	2 ms	336 KB	Output is correct
30	Correct	16 ms	3220 KB	Output is correct
31	Correct	6 ms	2592 KB	Output is correct
32	Correct	20 ms	4296 KB	Output is correct
33	Correct	16 ms	3912 KB	Output is correct
34	Correct	500 ms	4732 KB	Output is correct
35	Correct	192 ms	4300 KB	Output is correct
36	Correct	33 ms	3856 KB	Output is correct
37	Correct	29 ms	3784 KB	Output is correct
38	Correct	26 ms	3656 KB	Output is correct
39	Correct	24 ms	3668 KB	Output is correct
40	Correct	437 ms	4928 KB	Output is correct
41	Correct	93 ms	3996 KB	Output is correct
42	Correct	81 ms	3764 KB	Output is correct
43	Correct	38 ms	4948 KB	Output is correct
44	Correct	446 ms	4920 KB	Output is correct

Subtask #5
0.0 / 40.0

#	결과	실행 시간	메모리	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	0 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	0 ms	208 KB	Output is correct
16	Correct	0 ms	208 KB	Output is correct
17	Correct	0 ms	208 KB	Output is correct
18	Correct	0 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	4 ms	336 KB	Output is correct
25	Correct	3 ms	336 KB	Output is correct
26	Correct	4 ms	336 KB	Output is correct
27	Correct	2 ms	364 KB	Output is correct
28	Correct	1 ms	336 KB	Output is correct
29	Correct	2 ms	336 KB	Output is correct
30	Correct	16 ms	3220 KB	Output is correct
31	Correct	6 ms	2592 KB	Output is correct
32	Correct	20 ms	4296 KB	Output is correct
33	Correct	16 ms	3912 KB	Output is correct
34	Correct	500 ms	4732 KB	Output is correct
35	Correct	192 ms	4300 KB	Output is correct
36	Correct	33 ms	3856 KB	Output is correct
37	Correct	29 ms	3784 KB	Output is correct
38	Correct	26 ms	3656 KB	Output is correct
39	Correct	24 ms	3668 KB	Output is correct
40	Correct	437 ms	4928 KB	Output is correct
41	Correct	93 ms	3996 KB	Output is correct
42	Correct	81 ms	3764 KB	Output is correct
43	Correct	38 ms	4948 KB	Output is correct
44	Correct	446 ms	4920 KB	Output is correct
45	Correct	214 ms	29432 KB	Output is correct
46	Correct	14 ms	18284 KB	Output is correct
47	Correct	17 ms	18300 KB	Output is correct
48	Correct	281 ms	41344 KB	Output is correct
49	Correct	243 ms	36816 KB	Output is correct
50	Execution timed out	4029 ms	32120 KB	Time limit exceeded
51	Halted	0 ms	0 KB	-

답안 #707644

Compilation message

Subtask #1 2.0 / 2.0

Subtask #2 10.0 / 10.0

Subtask #3 18.0 / 18.0

Subtask #4 30.0 / 30.0

Subtask #5 0.0 / 40.0

Subtask #1
2.0 / 2.0

Subtask #2
10.0 / 10.0

Subtask #3
18.0 / 18.0

Subtask #4
30.0 / 30.0

Subtask #5
0.0 / 40.0