#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<vector<int>> g, ig;
vector<pair<int, int>> range;
void init(int nn, int kk)
{
n = nn;
k = kk;
g.clear();
ig.clear();
range.clear();
g.resize(n + 1);
ig.resize(n + 1);
range.resize(n + 1);
for (int i = 1; i <= k; i++)
{
range[i] = { i, i };
}
for (int i = k + 1; i <= n; i++)
{
range[i] = { 0, k + 1 };
}
}
int upd(int from, int to)
{
if (range[from].first >= range[to].second) return 1;
if (range[from].second <= range[to].first) return 0;
while (range[from].first > (range[to].first + range[to].second) / 2)
{
range[to].first = range[from].first;
for (auto& vertex : g[to])
{
if (upd(to, vertex))
{
return 1;
}
}
}
if (range[to].second < range[from].second)
{
range[from].second = range[to].second;
for (auto& vertex : ig[from])
{
if (upd(vertex, from))
{
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);
}
# |
결과 |
실행 시간 |
메모리 |
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 |
1 ms |
208 KB |
Output is correct |
5 |
Correct |
0 ms |
208 KB |
Output is correct |
6 |
Correct |
0 ms |
208 KB |
Output is correct |
7 |
Correct |
1 ms |
208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
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 |
1 ms |
208 KB |
Output is correct |
5 |
Correct |
0 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 |
1 ms |
208 KB |
Output is correct |
9 |
Correct |
1 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 |
0 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 |
0 ms |
208 KB |
Output is correct |
19 |
Correct |
0 ms |
208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
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 |
1 ms |
208 KB |
Output is correct |
5 |
Correct |
0 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 |
1 ms |
208 KB |
Output is correct |
9 |
Correct |
1 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 |
0 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 |
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 |
380 KB |
Output is correct |
24 |
Correct |
3 ms |
464 KB |
Output is correct |
25 |
Correct |
3 ms |
464 KB |
Output is correct |
26 |
Correct |
2 ms |
420 KB |
Output is correct |
27 |
Correct |
2 ms |
336 KB |
Output is correct |
28 |
Correct |
1 ms |
336 KB |
Output is correct |
29 |
Correct |
2 ms |
336 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
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 |
1 ms |
208 KB |
Output is correct |
5 |
Correct |
0 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 |
1 ms |
208 KB |
Output is correct |
9 |
Correct |
1 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 |
0 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 |
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 |
380 KB |
Output is correct |
24 |
Correct |
3 ms |
464 KB |
Output is correct |
25 |
Correct |
3 ms |
464 KB |
Output is correct |
26 |
Correct |
2 ms |
420 KB |
Output is correct |
27 |
Correct |
2 ms |
336 KB |
Output is correct |
28 |
Correct |
1 ms |
336 KB |
Output is correct |
29 |
Correct |
2 ms |
336 KB |
Output is correct |
30 |
Correct |
20 ms |
3028 KB |
Output is correct |
31 |
Correct |
4 ms |
2256 KB |
Output is correct |
32 |
Correct |
19 ms |
4960 KB |
Output is correct |
33 |
Correct |
17 ms |
3788 KB |
Output is correct |
34 |
Correct |
608 ms |
8456 KB |
Output is correct |
35 |
Correct |
211 ms |
5268 KB |
Output is correct |
36 |
Correct |
48 ms |
3788 KB |
Output is correct |
37 |
Correct |
29 ms |
3784 KB |
Output is correct |
38 |
Correct |
24 ms |
3456 KB |
Output is correct |
39 |
Correct |
24 ms |
3516 KB |
Output is correct |
40 |
Correct |
520 ms |
8044 KB |
Output is correct |
41 |
Correct |
102 ms |
4816 KB |
Output is correct |
42 |
Correct |
80 ms |
4296 KB |
Output is correct |
43 |
Correct |
45 ms |
5048 KB |
Output is correct |
44 |
Correct |
520 ms |
6172 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
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 |
1 ms |
208 KB |
Output is correct |
5 |
Correct |
0 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 |
1 ms |
208 KB |
Output is correct |
9 |
Correct |
1 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 |
0 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 |
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 |
380 KB |
Output is correct |
24 |
Correct |
3 ms |
464 KB |
Output is correct |
25 |
Correct |
3 ms |
464 KB |
Output is correct |
26 |
Correct |
2 ms |
420 KB |
Output is correct |
27 |
Correct |
2 ms |
336 KB |
Output is correct |
28 |
Correct |
1 ms |
336 KB |
Output is correct |
29 |
Correct |
2 ms |
336 KB |
Output is correct |
30 |
Correct |
20 ms |
3028 KB |
Output is correct |
31 |
Correct |
4 ms |
2256 KB |
Output is correct |
32 |
Correct |
19 ms |
4960 KB |
Output is correct |
33 |
Correct |
17 ms |
3788 KB |
Output is correct |
34 |
Correct |
608 ms |
8456 KB |
Output is correct |
35 |
Correct |
211 ms |
5268 KB |
Output is correct |
36 |
Correct |
48 ms |
3788 KB |
Output is correct |
37 |
Correct |
29 ms |
3784 KB |
Output is correct |
38 |
Correct |
24 ms |
3456 KB |
Output is correct |
39 |
Correct |
24 ms |
3516 KB |
Output is correct |
40 |
Correct |
520 ms |
8044 KB |
Output is correct |
41 |
Correct |
102 ms |
4816 KB |
Output is correct |
42 |
Correct |
80 ms |
4296 KB |
Output is correct |
43 |
Correct |
45 ms |
5048 KB |
Output is correct |
44 |
Correct |
520 ms |
6172 KB |
Output is correct |
45 |
Correct |
274 ms |
28212 KB |
Output is correct |
46 |
Correct |
13 ms |
17104 KB |
Output is correct |
47 |
Correct |
15 ms |
17032 KB |
Output is correct |
48 |
Correct |
352 ms |
45588 KB |
Output is correct |
49 |
Correct |
266 ms |
35468 KB |
Output is correct |
50 |
Execution timed out |
4022 ms |
37988 KB |
Time limit exceeded |
51 |
Halted |
0 ms |
0 KB |
- |