답안 #707870

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
707870	2023-03-10T10:33:32 Z	600Mihnea	게임 (APIO22_game)	C++17	60 / 100	4000 ms	39012 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 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)
{
	is = 0;
	addedge(from, to);
	if (to < k)
	{
		upd(from, to);
	}
	else
	{
		upd(from, mn[to]);
	}
	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	1 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	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	1 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	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	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	0 ms	208 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	0 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	1 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	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	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	0 ms	208 KB	Output is correct
17	Correct	1 ms	208 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	1 ms	336 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	2 ms	336 KB	Output is correct
24	Correct	3 ms	336 KB	Output is correct
25	Correct	4 ms	336 KB	Output is correct
26	Correct	2 ms	336 KB	Output is correct
27	Correct	3 ms	356 KB	Output is correct
28	Correct	3 ms	372 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	1 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	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	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	0 ms	208 KB	Output is correct
17	Correct	1 ms	208 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	1 ms	336 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	2 ms	336 KB	Output is correct
24	Correct	3 ms	336 KB	Output is correct
25	Correct	4 ms	336 KB	Output is correct
26	Correct	2 ms	336 KB	Output is correct
27	Correct	3 ms	356 KB	Output is correct
28	Correct	3 ms	372 KB	Output is correct
29	Correct	2 ms	336 KB	Output is correct
30	Correct	14 ms	2888 KB	Output is correct
31	Correct	5 ms	2128 KB	Output is correct
32	Correct	14 ms	4068 KB	Output is correct
33	Correct	17 ms	3664 KB	Output is correct
34	Correct	505 ms	4700 KB	Output is correct
35	Correct	190 ms	4056 KB	Output is correct
36	Correct	38 ms	3652 KB	Output is correct
37	Correct	21 ms	3556 KB	Output is correct
38	Correct	26 ms	3556 KB	Output is correct
39	Correct	27 ms	3412 KB	Output is correct
40	Correct	414 ms	4696 KB	Output is correct
41	Correct	94 ms	3724 KB	Output is correct
42	Correct	66 ms	3648 KB	Output is correct
43	Correct	42 ms	4768 KB	Output is correct
44	Correct	449 ms	4700 KB	Output is correct

Subtask #5
0.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 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	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	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	0 ms	208 KB	Output is correct
17	Correct	1 ms	208 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	1 ms	336 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	2 ms	336 KB	Output is correct
24	Correct	3 ms	336 KB	Output is correct
25	Correct	4 ms	336 KB	Output is correct
26	Correct	2 ms	336 KB	Output is correct
27	Correct	3 ms	356 KB	Output is correct
28	Correct	3 ms	372 KB	Output is correct
29	Correct	2 ms	336 KB	Output is correct
30	Correct	14 ms	2888 KB	Output is correct
31	Correct	5 ms	2128 KB	Output is correct
32	Correct	14 ms	4068 KB	Output is correct
33	Correct	17 ms	3664 KB	Output is correct
34	Correct	505 ms	4700 KB	Output is correct
35	Correct	190 ms	4056 KB	Output is correct
36	Correct	38 ms	3652 KB	Output is correct
37	Correct	21 ms	3556 KB	Output is correct
38	Correct	26 ms	3556 KB	Output is correct
39	Correct	27 ms	3412 KB	Output is correct
40	Correct	414 ms	4696 KB	Output is correct
41	Correct	94 ms	3724 KB	Output is correct
42	Correct	66 ms	3648 KB	Output is correct
43	Correct	42 ms	4768 KB	Output is correct
44	Correct	449 ms	4700 KB	Output is correct
45	Correct	246 ms	26932 KB	Output is correct
46	Correct	12 ms	15996 KB	Output is correct
47	Correct	11 ms	15952 KB	Output is correct
48	Correct	318 ms	39012 KB	Output is correct
49	Correct	239 ms	34352 KB	Output is correct
50	Execution timed out	4019 ms	29780 KB	Time limit exceeded
51	Halted	0 ms	0 KB	-

답안 #707870

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