oj.uz

Submission #418071

# Submission time Handle Problem Language Result Execution time Memory
418071 2021-06-05T03:37:36 Z 8e7 Rainforest Jumps (APIO21_jumps) C++14
77 / 100
 4000 ms 59816 KB 
//Challenge: Accepted
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <stack>
#include <set>
#include <map>
#include <assert.h>
#include <queue>
#include <iomanip>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define ll long long
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
#define maxn 200005
#define mod 1000000007
using namespace std;
using namespace __gnu_pbds;
void debug() {
	cout << endl;
}
template<class T, class ...U> void debug(T a, U ...b) {
	cout << a << " ";debug(b...);
}
template<class T> void pary(T l, T r) {
	while (l != r) {
		cout << *l << " ";
		l++;
	}
	cout << endl;
}

//template<class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//gp_hash_table<int, int> mp;
//find by order, order of key

#include "jumps.h"

vector<int> adj[maxn];
int to[18][maxn], anc[18][maxn], par[maxn], dep[maxn];
int lef[maxn], rig[maxn];
int ti = 0;
void dfs(int n, int par, int d) {
	dep[n] = d;
	lef[n] = n, rig[n] = n;
	for (int v:adj[n]) {
		if (v != par) {
			dfs(v, n, d + 1);
			lef[n] = min(lef[n], lef[v]);
			rig[n] = max(rig[n], rig[v]);
		}
	}
}
void init(int N, vector<int> H) {
	stack<int> stk;
	for (int i = 0;i < N;i++) par[i] = N, lef[i] = N, rig[i] = N;
	for (int i = 0;i < N;i++) {
		vector<int> po;
		while (stk.size() && H[i] >= H[stk.top()]) {
			po.push_back(stk.top());
			rig[stk.top()] = i;
			stk.pop();
		}
		if (po.size()) {
			adj[i].push_back(po.back());
			par[po.back()] = i;
			for (int j = 0;j < po.size() - 1;j++) {
				adj[po[j + 1]].push_back(po[j]);
				par[po[j]] = po[j + 1];
			}
		}
		if (stk.size()) lef[i] = stk.top();
		stk.push(i);
	}	
	int prv = -1;
	while (stk.size()) {
		int cur = stk.top();
		if (prv != -1) {
			adj[cur].push_back(prv);
			par[prv] = cur;
		}
		prv = cur;
		stk.pop();
	}
	//pary(par, par + N);
	for (int i = 0;i < N;i++) {
		anc[0][i] = par[i];
		if (par[i] == lef[i]) to[0][i] = rig[i];
		else to[0][i] = lef[i];
	}
	dep[N] = -1, to[0][N] = anc[0][N] = N;
	//pary(to[0], to[0] + N);
	for (int i = 1;i < 18;i++) {
		for (int j = 0;j <= N;j++) to[i][j] = to[i - 1][to[i - 1][j]], anc[i][j] = anc[i - 1][anc[i - 1][j]];
	}
	int root = max_element(H.begin(), H.end()) - H.begin();
	dfs(root, root, 0);
}

int dis(int s, int t) {
	int dif = dep[s] - dep[t];
	if (dif < 0) return -1;
	int ret = 0, cur = s;
	for (int i = 17;i >= 0;i--) {
		if (dep[to[i][cur]] >= dep[t]) {
			cur = to[i][cur];
			ret += 1<<i;
		}	
	}
	for (int i = 17;i >= 0;i--) {
		if (dep[anc[i][cur]] >= dep[t]) {
			cur = anc[i][cur];
			ret += 1<<i;
		}
	}
	return (cur == t ? ret : -1);
}
int lca(int a, int b) {
	if (dep[a] < dep[b]) swap(a, b);
	int hdif = dep[a] - dep[b], cnt = 0;
	while (hdif) {
		if (hdif & 1) {
			a = anc[cnt][a];
		}
		hdif>>=1, cnt++;
	}
	if (a == b) return a;
	for (int i = 17;i >= 0;i--) {
		if (anc[i][a] != anc[i][b]) {
			a = anc[i][a], b = anc[i][b];
		}
	}
	return anc[0][a];
}
int solve(int A, int B, int C) {
	int l = max(lef[C], A), r = min(rig[C], B);
	if (r < l) return -1;
	return dis(lca(l, r), C);	
}
int minimum_jumps(int A, int B, int C, int D) {
	int ret = -1;
	for (int i = C;i <= D;i++) {
		int tmp = solve(A, B, i);
		if (tmp != -1) {
			if (ret == -1) ret = tmp;
			else ret = min(ret, tmp);
		}
	}
	return ret;
}
/*
7 4
3 2 1 6 4 5 7
4 5 6 6
0 3 6 6
0 1 2 2
1 1 3 3


*/

Compilation message

jumps.cpp: In function 'void init(int, std::vector<int>)':
jumps.cpp:71:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |    for (int j = 0;j < po.size() - 1;j++) {
      |                   ~~^~~~~~~~~~~~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5192 KB Output is correct
2 Correct 3 ms 5192 KB Output is correct
3 Execution timed out 4078 ms 48704 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5192 KB Output is correct
2 Correct 3 ms 5192 KB Output is correct
3 Correct 3 ms 5192 KB Output is correct
4 Correct 3 ms 5192 KB Output is correct
5 Correct 6 ms 5196 KB Output is correct
6 Correct 6 ms 5124 KB Output is correct
7 Correct 5 ms 5192 KB Output is correct
8 Correct 6 ms 5192 KB Output is correct
9 Correct 4 ms 5192 KB Output is correct
10 Correct 6 ms 5192 KB Output is correct
11 Correct 6 ms 5192 KB Output is correct
12 Correct 5 ms 5192 KB Output is correct
13 Correct 5 ms 5192 KB Output is correct
14 Correct 5 ms 5192 KB Output is correct
15 Correct 6 ms 5192 KB Output is correct
16 Correct 7 ms 5192 KB Output is correct
17 Correct 6 ms 5236 KB Output is correct
18 Correct 3 ms 5192 KB Output is correct
19 Correct 4 ms 5192 KB Output is correct
20 Correct 4 ms 5192 KB Output is correct
21 Correct 5 ms 5192 KB Output is correct
22 Correct 5 ms 5192 KB Output is correct
23 Correct 4 ms 5192 KB Output is correct
24 Correct 5 ms 5192 KB Output is correct
25 Correct 3 ms 5192 KB Output is correct
26 Correct 3 ms 5192 KB Output is correct
27 Correct 5 ms 5192 KB Output is correct
28 Correct 5 ms 5188 KB Output is correct
29 Correct 5 ms 5192 KB Output is correct
30 Correct 5 ms 5192 KB Output is correct
31 Correct 5 ms 5192 KB Output is correct
32 Correct 4 ms 5192 KB Output is correct
33 Correct 3 ms 5192 KB Output is correct
34 Correct 3 ms 5192 KB Output is correct
35 Correct 3 ms 5192 KB Output is correct
36 Correct 3 ms 5192 KB Output is correct
37 Correct 4 ms 5192 KB Output is correct
38 Correct 4 ms 5192 KB Output is correct
39 Correct 4 ms 5192 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5192 KB Output is correct
2 Correct 3 ms 5192 KB Output is correct
3 Correct 3 ms 5192 KB Output is correct
4 Correct 3 ms 5192 KB Output is correct
5 Correct 6 ms 5196 KB Output is correct
6 Correct 6 ms 5124 KB Output is correct
7 Correct 5 ms 5192 KB Output is correct
8 Correct 6 ms 5192 KB Output is correct
9 Correct 4 ms 5192 KB Output is correct
10 Correct 6 ms 5192 KB Output is correct
11 Correct 6 ms 5192 KB Output is correct
12 Correct 5 ms 5192 KB Output is correct
13 Correct 5 ms 5192 KB Output is correct
14 Correct 5 ms 5192 KB Output is correct
15 Correct 6 ms 5192 KB Output is correct
16 Correct 7 ms 5192 KB Output is correct
17 Correct 6 ms 5236 KB Output is correct
18 Correct 3 ms 5192 KB Output is correct
19 Correct 4 ms 5192 KB Output is correct
20 Correct 4 ms 5192 KB Output is correct
21 Correct 5 ms 5192 KB Output is correct
22 Correct 5 ms 5192 KB Output is correct
23 Correct 4 ms 5192 KB Output is correct
24 Correct 5 ms 5192 KB Output is correct
25 Correct 3 ms 5192 KB Output is correct
26 Correct 3 ms 5192 KB Output is correct
27 Correct 5 ms 5192 KB Output is correct
28 Correct 5 ms 5188 KB Output is correct
29 Correct 5 ms 5192 KB Output is correct
30 Correct 5 ms 5192 KB Output is correct
31 Correct 5 ms 5192 KB Output is correct
32 Correct 4 ms 5192 KB Output is correct
33 Correct 3 ms 5192 KB Output is correct
34 Correct 3 ms 5192 KB Output is correct
35 Correct 3 ms 5192 KB Output is correct
36 Correct 3 ms 5192 KB Output is correct
37 Correct 4 ms 5192 KB Output is correct
38 Correct 4 ms 5192 KB Output is correct
39 Correct 4 ms 5192 KB Output is correct
40 Correct 3 ms 5192 KB Output is correct
41 Correct 3 ms 5192 KB Output is correct
42 Correct 3 ms 5192 KB Output is correct
43 Correct 3 ms 5192 KB Output is correct
44 Correct 4 ms 5192 KB Output is correct
45 Correct 5 ms 5192 KB Output is correct
46 Correct 5 ms 5192 KB Output is correct
47 Correct 6 ms 5192 KB Output is correct
48 Correct 4 ms 5192 KB Output is correct
49 Correct 5 ms 5192 KB Output is correct
50 Correct 6 ms 5192 KB Output is correct
51 Correct 5 ms 5192 KB Output is correct
52 Correct 5 ms 5192 KB Output is correct
53 Correct 5 ms 5192 KB Output is correct
54 Correct 5 ms 5192 KB Output is correct
55 Correct 5 ms 5192 KB Output is correct
56 Correct 5 ms 5192 KB Output is correct
57 Correct 3 ms 5192 KB Output is correct
58 Correct 18 ms 5448 KB Output is correct
59 Correct 29 ms 5448 KB Output is correct
60 Correct 8 ms 5320 KB Output is correct
61 Correct 16 ms 5448 KB Output is correct
62 Correct 18 ms 5192 KB Output is correct
63 Correct 22 ms 5576 KB Output is correct
64 Correct 74 ms 5704 KB Output is correct
65 Correct 79 ms 5704 KB Output is correct
66 Correct 61 ms 5704 KB Output is correct
67 Correct 15 ms 5576 KB Output is correct
68 Correct 52 ms 5704 KB Output is correct
69 Correct 34 ms 5704 KB Output is correct
70 Correct 81 ms 5704 KB Output is correct
71 Correct 3 ms 5192 KB Output is correct
72 Correct 4 ms 5192 KB Output is correct
73 Correct 5 ms 5192 KB Output is correct
74 Correct 5 ms 5192 KB Output is correct
75 Correct 5 ms 5192 KB Output is correct
76 Correct 5 ms 5192 KB Output is correct
77 Correct 5 ms 5192 KB Output is correct
78 Correct 3 ms 5192 KB Output is correct
79 Correct 3 ms 5192 KB Output is correct
80 Correct 4 ms 5192 KB Output is correct
81 Correct 5 ms 5192 KB Output is correct
82 Correct 5 ms 5192 KB Output is correct
83 Correct 5 ms 5192 KB Output is correct
84 Correct 6 ms 5216 KB Output is correct
85 Correct 5 ms 5192 KB Output is correct
86 Correct 3 ms 5192 KB Output is correct
87 Correct 3 ms 5192 KB Output is correct
88 Correct 3 ms 5192 KB Output is correct
89 Correct 3 ms 5192 KB Output is correct
90 Correct 3 ms 5148 KB Output is correct
91 Correct 3 ms 5192 KB Output is correct
92 Correct 3 ms 5192 KB Output is correct
93 Correct 4 ms 5192 KB Output is correct
94 Correct 6 ms 5192 KB Output is correct
95 Correct 20 ms 5448 KB Output is correct
96 Correct 15 ms 5636 KB Output is correct
97 Correct 21 ms 5448 KB Output is correct
98 Correct 20 ms 5704 KB Output is correct
99 Correct 13 ms 5704 KB Output is correct
100 Correct 3 ms 5192 KB Output is correct
101 Correct 4 ms 5320 KB Output is correct
102 Correct 19 ms 5448 KB Output is correct
103 Correct 22 ms 5704 KB Output is correct
104 Correct 13 ms 5448 KB Output is correct
105 Correct 14 ms 5704 KB Output is correct
106 Correct 22 ms 5704 KB Output is correct
107 Correct 3 ms 5192 KB Output is correct
108 Correct 3 ms 5320 KB Output is correct
109 Correct 4 ms 5576 KB Output is correct
110 Correct 5 ms 5704 KB Output is correct
111 Correct 4 ms 5576 KB Output is correct
112 Correct 4 ms 5704 KB Output is correct
113 Correct 4 ms 5704 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5192 KB Output is correct
2 Correct 3 ms 5192 KB Output is correct
3 Correct 3 ms 5192 KB Output is correct
4 Correct 3 ms 5192 KB Output is correct
5 Correct 73 ms 34916 KB Output is correct
6 Correct 76 ms 41960 KB Output is correct
7 Correct 40 ms 24000 KB Output is correct
8 Correct 78 ms 41988 KB Output is correct
9 Correct 14 ms 10696 KB Output is correct
10 Correct 76 ms 41972 KB Output is correct
11 Correct 83 ms 59712 KB Output is correct
12 Correct 100 ms 55492 KB Output is correct
13 Correct 78 ms 55128 KB Output is correct
14 Correct 75 ms 42176 KB Output is correct
15 Correct 88 ms 59760 KB Output is correct
16 Correct 85 ms 59780 KB Output is correct
17 Correct 90 ms 59712 KB Output is correct
18 Correct 4 ms 5192 KB Output is correct
19 Correct 3 ms 5188 KB Output is correct
20 Correct 3 ms 5192 KB Output is correct
21 Correct 3 ms 5192 KB Output is correct
22 Correct 3 ms 5192 KB Output is correct
23 Correct 3 ms 5192 KB Output is correct
24 Correct 3 ms 5192 KB Output is correct
25 Correct 3 ms 5192 KB Output is correct
26 Correct 4 ms 5320 KB Output is correct
27 Correct 4 ms 5448 KB Output is correct
28 Correct 4 ms 5704 KB Output is correct
29 Correct 4 ms 5448 KB Output is correct
30 Correct 4 ms 5704 KB Output is correct
31 Correct 4 ms 5704 KB Output is correct
32 Correct 3 ms 5192 KB Output is correct
33 Correct 76 ms 41920 KB Output is correct
34 Correct 78 ms 41972 KB Output is correct
35 Correct 71 ms 55980 KB Output is correct
36 Correct 74 ms 42096 KB Output is correct
37 Correct 74 ms 59768 KB Output is correct
38 Correct 71 ms 59732 KB Output is correct
39 Correct 3 ms 5192 KB Output is correct
40 Correct 44 ms 26560 KB Output is correct
41 Correct 88 ms 41920 KB Output is correct
42 Correct 69 ms 57280 KB Output is correct
43 Correct 88 ms 42304 KB Output is correct
44 Correct 80 ms 59816 KB Output is correct
45 Correct 67 ms 59732 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5192 KB Output is correct
2 Correct 3 ms 5192 KB Output is correct
3 Correct 3 ms 5192 KB Output is correct
4 Correct 210 ms 21984 KB Output is correct
5 Correct 911 ms 41920 KB Output is correct
6 Correct 620 ms 11200 KB Output is correct
7 Correct 994 ms 41920 KB Output is correct
8 Correct 506 ms 17924 KB Output is correct
9 Correct 905 ms 41976 KB Output is correct
10 Correct 1176 ms 59768 KB Output is correct
11 Correct 1088 ms 58432 KB Output is correct
12 Correct 1142 ms 57536 KB Output is correct
13 Correct 833 ms 42176 KB Output is correct
14 Correct 968 ms 59720 KB Output is correct
15 Correct 853 ms 59728 KB Output is correct
16 Correct 840 ms 59808 KB Output is correct
17 Correct 3 ms 5192 KB Output is correct
18 Correct 3 ms 5192 KB Output is correct
19 Correct 4 ms 5192 KB Output is correct
20 Correct 6 ms 5192 KB Output is correct
21 Correct 5 ms 5192 KB Output is correct
22 Correct 5 ms 5192 KB Output is correct
23 Correct 4 ms 5192 KB Output is correct
24 Correct 4 ms 5192 KB Output is correct
25 Correct 3 ms 5192 KB Output is correct
26 Correct 4 ms 5320 KB Output is correct
27 Correct 19 ms 5448 KB Output is correct
28 Correct 21 ms 5704 KB Output is correct
29 Correct 13 ms 5576 KB Output is correct
30 Correct 21 ms 5704 KB Output is correct
31 Correct 21 ms 5704 KB Output is correct
32 Correct 3 ms 5192 KB Output is correct
33 Correct 44 ms 26560 KB Output is correct
34 Correct 79 ms 41968 KB Output is correct
35 Correct 74 ms 57260 KB Output is correct
36 Correct 76 ms 42228 KB Output is correct
37 Correct 90 ms 59712 KB Output is correct
38 Correct 69 ms 59800 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5192 KB Output is correct
2 Correct 3 ms 5192 KB Output is correct
3 Correct 3 ms 5192 KB Output is correct
4 Correct 210 ms 21984 KB Output is correct
5 Correct 911 ms 41920 KB Output is correct
6 Correct 620 ms 11200 KB Output is correct
7 Correct 994 ms 41920 KB Output is correct
8 Correct 506 ms 17924 KB Output is correct
9 Correct 905 ms 41976 KB Output is correct
10 Correct 1176 ms 59768 KB Output is correct
11 Correct 1088 ms 58432 KB Output is correct
12 Correct 1142 ms 57536 KB Output is correct
13 Correct 833 ms 42176 KB Output is correct
14 Correct 968 ms 59720 KB Output is correct
15 Correct 853 ms 59728 KB Output is correct
16 Correct 840 ms 59808 KB Output is correct
17 Correct 3 ms 5192 KB Output is correct
18 Correct 3 ms 5192 KB Output is correct
19 Correct 4 ms 5192 KB Output is correct
20 Correct 6 ms 5192 KB Output is correct
21 Correct 5 ms 5192 KB Output is correct
22 Correct 5 ms 5192 KB Output is correct
23 Correct 4 ms 5192 KB Output is correct
24 Correct 4 ms 5192 KB Output is correct
25 Correct 3 ms 5192 KB Output is correct
26 Correct 4 ms 5320 KB Output is correct
27 Correct 19 ms 5448 KB Output is correct
28 Correct 21 ms 5704 KB Output is correct
29 Correct 13 ms 5576 KB Output is correct
30 Correct 21 ms 5704 KB Output is correct
31 Correct 21 ms 5704 KB Output is correct
32 Correct 3 ms 5192 KB Output is correct
33 Correct 44 ms 26560 KB Output is correct
34 Correct 79 ms 41968 KB Output is correct
35 Correct 74 ms 57260 KB Output is correct
36 Correct 76 ms 42228 KB Output is correct
37 Correct 90 ms 59712 KB Output is correct
38 Correct 69 ms 59800 KB Output is correct
39 Correct 3 ms 5192 KB Output is correct
40 Correct 3 ms 5192 KB Output is correct
41 Correct 3 ms 5192 KB Output is correct
42 Correct 264 ms 22092 KB Output is correct
43 Correct 977 ms 41920 KB Output is correct
44 Correct 599 ms 11200 KB Output is correct
45 Correct 941 ms 41972 KB Output is correct
46 Correct 504 ms 17908 KB Output is correct
47 Correct 957 ms 41984 KB Output is correct
48 Correct 1128 ms 59752 KB Output is correct
49 Correct 1081 ms 58472 KB Output is correct
50 Correct 1110 ms 57600 KB Output is correct
51 Correct 861 ms 42116 KB Output is correct
52 Correct 1052 ms 59780 KB Output is correct
53 Correct 934 ms 59728 KB Output is correct
54 Correct 775 ms 59816 KB Output is correct
55 Correct 3 ms 5192 KB Output is correct
56 Correct 135 ms 42004 KB Output is correct
57 Correct 874 ms 41976 KB Output is correct
58 Correct 488 ms 11592 KB Output is correct
59 Correct 853 ms 42048 KB Output is correct
60 Correct 358 ms 18240 KB Output is correct
61 Correct 871 ms 41920 KB Output is correct
62 Correct 1223 ms 59768 KB Output is correct
63 Correct 1159 ms 55912 KB Output is correct
64 Correct 1124 ms 53952 KB Output is correct
65 Correct 879 ms 42212 KB Output is correct
66 Correct 1018 ms 59768 KB Output is correct
67 Correct 943 ms 59672 KB Output is correct
68 Correct 891 ms 59780 KB Output is correct
69 Correct 3 ms 5192 KB Output is correct
70 Correct 3 ms 5192 KB Output is correct
71 Correct 5 ms 5192 KB Output is correct
72 Correct 5 ms 5192 KB Output is correct
73 Correct 5 ms 5192 KB Output is correct
74 Correct 5 ms 5192 KB Output is correct
75 Correct 5 ms 5192 KB Output is correct
76 Correct 3 ms 5192 KB Output is correct
77 Correct 3 ms 5192 KB Output is correct
78 Correct 5 ms 5320 KB Output is correct
79 Correct 5 ms 5192 KB Output is correct
80 Correct 4 ms 5192 KB Output is correct
81 Correct 5 ms 5192 KB Output is correct
82 Correct 5 ms 5192 KB Output is correct
83 Correct 4 ms 5192 KB Output is correct
84 Correct 3 ms 5192 KB Output is correct
85 Correct 5 ms 5192 KB Output is correct
86 Correct 21 ms 5448 KB Output is correct
87 Correct 22 ms 5576 KB Output is correct
88 Correct 21 ms 5448 KB Output is correct
89 Correct 21 ms 5704 KB Output is correct
90 Correct 23 ms 5704 KB Output is correct
91 Correct 4 ms 5192 KB Output is correct
92 Correct 4 ms 5320 KB Output is correct
93 Correct 21 ms 5448 KB Output is correct
94 Correct 21 ms 5704 KB Output is correct
95 Correct 26 ms 5448 KB Output is correct
96 Correct 23 ms 5704 KB Output is correct
97 Correct 21 ms 5704 KB Output is correct
98 Correct 3 ms 5192 KB Output is correct
99 Correct 74 ms 41920 KB Output is correct
100 Correct 75 ms 41968 KB Output is correct
101 Correct 71 ms 55940 KB Output is correct
102 Correct 73 ms 42176 KB Output is correct
103 Correct 75 ms 59712 KB Output is correct
104 Correct 71 ms 59684 KB Output is correct
105 Correct 3 ms 5192 KB Output is correct
106 Correct 52 ms 26556 KB Output is correct
107 Correct 74 ms 42024 KB Output is correct
108 Correct 73 ms 57332 KB Output is correct
109 Correct 86 ms 42176 KB Output is correct
110 Correct 77 ms 59776 KB Output is correct
111 Correct 69 ms 59772 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5192 KB Output is correct
2 Correct 3 ms 5192 KB Output is correct
3 Execution timed out 4078 ms 48704 KB Time limit exceeded
4 Halted 0 ms 0 KB -