oj.uz

답안 #1056697

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1056697 2024-08-13T10:39:25 Z parsadox2 송신탑 (IOI22_towers) C++17
58 / 100
 571 ms 36428 KB 
#include <bits/stdc++.h>
#include "towers.h"
#define F first
#define S second
using namespace std;
 
const int N = 1e5 + 10 , inf = 1e9 , Lg = 17;
 
int n , a[N] , rmxq[N][Lg] , rmnq[N][Lg] , lg2[N] , nexL[N] , nexR[N] , las;
int b[N] , psum[N] , m;
vector <int> all;
vector <pair<int , int>> good;
 
int mn_pos(int aa , int bb)
{
	if(a[aa] < a[bb])
		return aa;
	return bb;
}
 
int mx_pos(int aa , int bb)
{
	if(a[aa] > a[bb])
		return aa;
	return bb;
}
 
int Get_mx(int l , int r)
{
	r++;
	int sz = (r - l);  sz = lg2[sz];
	return mx_pos(rmxq[l][sz] , rmxq[r - (1 << sz)][sz]);
}
 
int Get_mn(int l , int r)
{
	r++;
	int sz = (r - l);  sz = lg2[sz];
	return mn_pos(rmnq[l][sz] , rmnq[r - (1 << sz)][sz]);
}


void Build()
{
	lg2[1] = 0;
	for(int i = 2 ; i < N ; i++)
		lg2[i] = lg2[i / 2] + 1;
	for(int i = 0 ; i < n ; i++)
		rmnq[i][0] = rmxq[i][0] = i;
	for(int j = 1 ; j < Lg ; j++)
	{
		int len = (1 << j);
		for(int i = 0 ; i + len <= n ; i++)
		{
			rmnq[i][j] = mn_pos(rmnq[i][j - 1] , rmnq[i + len / 2][j - 1]);
			rmxq[i][j] = mx_pos(rmxq[i][j - 1] , rmxq[i + len / 2][j - 1]);
		}
	}
	for(int i = 1 ; i + 1 < n ; i++)  if(a[i] > a[i - 1] && a[i] > a[i + 1])
		b[i] = 1;
	for(int i = 1 ; i < n ; i++)
		psum[i] = psum[i - 1] + b[i];
	vector <int> st;
	for(int i = 0 ; i < n ; i++)
	{
		nexL[i] = -1;
		nexR[i] = n;
		while(!st.empty())
		{
			if(a[st.back()] < a[i])
			{
				nexR[st.back()] = i;
				st.pop_back();
			}
			else
			{
				nexL[i] = st.back();
				break;
			}
		}
		st.push_back(i);
	}
	for(int i = 0 ; i < n ; i++)  if(i - nexL[i] > 1 && nexR[i] - i > 1)
	{
		int lc = Get_mn(nexL[i] + 1 , i - 1) , rc = Get_mn(i + 1 , nexR[i] - 1);
		all.push_back(a[i] - max(a[lc] , a[rc]));
	}
	sort(all.begin() , all.end());
}
 
void init(int nn , vector <int> vec)
{
	n = nn;
	for(int i = 0 ; i < n ; i++)
		a[i] = vec[i];
	Build();
}
 
int Solve(int l , int r , int d)
{
	if(l > r)
		return 0;
	int pos_mx = Get_mx(l , r);
	int res = Solve(l , pos_mx - 1 , d) + Solve(pos_mx + 1 , r , d);
	if(pos_mx != l && pos_mx != r)
	{
		int lc = Get_mn(l , pos_mx - 1) , rc = Get_mn(pos_mx + 1 , r);
		if(a[pos_mx] - a[lc] >= d && a[pos_mx] - a[rc] >= d)
			res++;
	}
	return res;
}

struct SEG
{
	vector <int> t[N << 2];
	int mx[N << 2] , mn[N << 2];
	void Build(int node = 1 , int nl = 0 , int nr = m)
	{
		if(nr - nl == 1)
		{
			t[node].push_back(good[nl].F);
			mx[node] = good[nl].S;
			mn[node] = good[nl].S;
			return;
		}
		int mid = (nl + nr) >> 1 , lc = node << 1 , rc = lc | 1;
		Build(lc , nl , mid);  Build(rc , mid , nr);
		t[node] = t[lc];
		for(auto u : t[rc])
			t[node].push_back(u);
		sort(t[node].begin() , t[node].end());
		mx[node] = max(mx[lc] , mx[rc]);
		mn[node] = min(mn[lc] , mn[rc]);
	}
	int Get(int l , int r , int node = 1 , int nl = 0 , int nr = m)
	{
		if(mx[node] <= r)
		{
			int id = lower_bound(t[node].begin() , t[node].end() , l) - t[node].begin();
			return t[node].size() - id;
		}
		if(mn[node] > r)
			return 0;
		int mid = (nl + nr) >> 1 , lc = node << 1 , rc = lc | 1;
		return Get(l , r , lc , nl , mid) + Get(l , r , rc , mid , nr);
	}
} seg;

void Prep(int d)
{
	for(int i = 0 ; i < n ; i++)  if(i - nexL[i] > 1 && nexR[i] - i > 1)
	{
		int lc = Get_mn(nexL[i] + 1 , i - 1) , rc = Get_mn(i + 1 , nexR[i] - 1);
		int mx_d = a[i] - max(a[lc] , a[rc]);
		if(d > mx_d)
			continue;
		int low = nexL[i] + 1 , high = i;
		while(high - low > 1)
		{
			int mid = (low + high) >> 1;
			lc = Get_mn(mid , i - 1);
			if(a[i] - a[lc] >= d)
				low = mid;
			else
				high = mid;
		}
		int L = low;
		low = i;  high = nexR[i] - 1;
		while(high - low > 1)
		{
			int mid = (low + high) >> 1;
			rc = Get_mn(i + 1 , mid);
			if(a[i] - a[rc] >= d)
				high = mid;
			else
				low = mid;
		}
		int R = high;
		good.push_back({L , R});
	}
	m = good.size();
	seg.Build();
}
 
int max_towers(int l , int r , int d)
{
	if(d == 1)
	{
		if(l + 1 >= r)
			return 1;
		return 1 + psum[r - 1] - psum[l];
	}
	if(psum[r - 1] - psum[l] == 0)
		return 1;
	if(psum[r - 1] - psum[l] == 1)
	{
		int id = Get_mx(l , r);
		int lc = Get_mn(l , id - 1) , rc = Get_mn(id + 1 , r);
		if(a[id] - d >= a[lc] && a[id] - d >= a[rc])
			return 2;
		return 1;
	}
	if(l == 0 && r == n - 1)
	{
		int id = lower_bound(all.begin() , all.end() , d) - all.begin();
		return all.size() - id + 1;
	}
	if(las == 0)
	{
		Prep(d);
		las = d;
	}
	if(las == d)
	{
		return seg.Get(l , r) + 1;
	}
	return 1 + Solve(l , r , d);
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 243 ms 23896 KB Output is correct
2 Correct 536 ms 27224 KB Output is correct
3 Correct 506 ms 27224 KB Output is correct
4 Correct 471 ms 27224 KB Output is correct
5 Correct 541 ms 27860 KB Output is correct
6 Correct 527 ms 27224 KB Output is correct
7 Correct 453 ms 27860 KB Output is correct
8 Correct 2 ms 14936 KB Output is correct
9 Correct 2 ms 16984 KB Output is correct
10 Correct 2 ms 16984 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 16984 KB Output is correct
2 Correct 2 ms 19032 KB Output is correct
3 Correct 3 ms 19032 KB Output is correct
4 Correct 3 ms 19032 KB Output is correct
5 Correct 3 ms 19032 KB Output is correct
6 Correct 3 ms 19100 KB Output is correct
7 Correct 2 ms 19032 KB Output is correct
8 Correct 2 ms 16984 KB Output is correct
9 Correct 3 ms 16984 KB Output is correct
10 Correct 2 ms 16808 KB Output is correct
11 Correct 2 ms 16984 KB Output is correct
12 Correct 2 ms 14936 KB Output is correct
13 Correct 2 ms 16984 KB Output is correct
14 Correct 2 ms 16984 KB Output is correct
15 Correct 2 ms 16984 KB Output is correct
16 Correct 2 ms 16984 KB Output is correct
17 Correct 2 ms 16984 KB Output is correct
18 Correct 2 ms 16984 KB Output is correct
19 Correct 3 ms 16984 KB Output is correct
20 Correct 2 ms 16984 KB Output is correct
21 Correct 2 ms 16984 KB Output is correct
22 Correct 2 ms 16984 KB Output is correct
23 Correct 2 ms 16984 KB Output is correct
24 Correct 2 ms 16984 KB Output is correct
25 Correct 2 ms 16992 KB Output is correct
26 Correct 2 ms 16984 KB Output is correct
27 Correct 2 ms 16984 KB Output is correct
28 Correct 2 ms 16996 KB Output is correct
29 Correct 2 ms 16984 KB Output is correct
30 Correct 2 ms 16984 KB Output is correct
31 Correct 3 ms 16984 KB Output is correct
32 Correct 2 ms 16984 KB Output is correct
33 Correct 2 ms 17044 KB Output is correct
34 Correct 2 ms 16984 KB Output is correct
35 Correct 2 ms 16984 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 16984 KB Output is correct
2 Correct 2 ms 19032 KB Output is correct
3 Correct 3 ms 19032 KB Output is correct
4 Correct 3 ms 19032 KB Output is correct
5 Correct 3 ms 19032 KB Output is correct
6 Correct 3 ms 19100 KB Output is correct
7 Correct 2 ms 19032 KB Output is correct
8 Correct 2 ms 16984 KB Output is correct
9 Correct 3 ms 16984 KB Output is correct
10 Correct 2 ms 16808 KB Output is correct
11 Correct 2 ms 16984 KB Output is correct
12 Correct 2 ms 14936 KB Output is correct
13 Correct 2 ms 16984 KB Output is correct
14 Correct 2 ms 16984 KB Output is correct
15 Correct 2 ms 16984 KB Output is correct
16 Correct 2 ms 16984 KB Output is correct
17 Correct 2 ms 16984 KB Output is correct
18 Correct 2 ms 16984 KB Output is correct
19 Correct 3 ms 16984 KB Output is correct
20 Correct 2 ms 16984 KB Output is correct
21 Correct 2 ms 16984 KB Output is correct
22 Correct 2 ms 16984 KB Output is correct
23 Correct 2 ms 16984 KB Output is correct
24 Correct 2 ms 16984 KB Output is correct
25 Correct 2 ms 16992 KB Output is correct
26 Correct 2 ms 16984 KB Output is correct
27 Correct 2 ms 16984 KB Output is correct
28 Correct 2 ms 16996 KB Output is correct
29 Correct 2 ms 16984 KB Output is correct
30 Correct 2 ms 16984 KB Output is correct
31 Correct 3 ms 16984 KB Output is correct
32 Correct 2 ms 16984 KB Output is correct
33 Correct 2 ms 17044 KB Output is correct
34 Correct 2 ms 16984 KB Output is correct
35 Correct 2 ms 16984 KB Output is correct
36 Correct 18 ms 30552 KB Output is correct
37 Correct 24 ms 30020 KB Output is correct
38 Correct 28 ms 32076 KB Output is correct
39 Correct 18 ms 29284 KB Output is correct
40 Correct 30 ms 34792 KB Output is correct
41 Correct 27 ms 32460 KB Output is correct
42 Correct 31 ms 36428 KB Output is correct
43 Correct 21 ms 27132 KB Output is correct
44 Correct 15 ms 27860 KB Output is correct
45 Correct 14 ms 27220 KB Output is correct
46 Correct 18 ms 27652 KB Output is correct
47 Correct 17 ms 27608 KB Output is correct
48 Correct 18 ms 27736 KB Output is correct
49 Correct 21 ms 27736 KB Output is correct
50 Correct 15 ms 27860 KB Output is correct
51 Correct 14 ms 27136 KB Output is correct
52 Correct 26 ms 27736 KB Output is correct
53 Correct 20 ms 27736 KB Output is correct
54 Correct 17 ms 27736 KB Output is correct
55 Correct 16 ms 27772 KB Output is correct
56 Correct 21 ms 27224 KB Output is correct
57 Correct 19 ms 27224 KB Output is correct
58 Correct 17 ms 27736 KB Output is correct
59 Correct 18 ms 27736 KB Output is correct
60 Correct 24 ms 27736 KB Output is correct
61 Correct 21 ms 27648 KB Output is correct
62 Correct 18 ms 27736 KB Output is correct
63 Correct 18 ms 27736 KB Output is correct
64 Correct 15 ms 27224 KB Output is correct
65 Correct 14 ms 27860 KB Output is correct
66 Correct 14 ms 27148 KB Output is correct
67 Correct 15 ms 27860 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 424 ms 27660 KB Output is correct
2 Correct 512 ms 27736 KB Output is correct
3 Correct 529 ms 27472 KB Output is correct
4 Correct 428 ms 27732 KB Output is correct
5 Correct 534 ms 27736 KB Output is correct
6 Correct 497 ms 27736 KB Output is correct
7 Correct 571 ms 27736 KB Output is correct
8 Correct 555 ms 27224 KB Output is correct
9 Correct 416 ms 27860 KB Output is correct
10 Correct 386 ms 27224 KB Output is correct
11 Correct 484 ms 27780 KB Output is correct
12 Correct 429 ms 27132 KB Output is correct
13 Correct 435 ms 27860 KB Output is correct
14 Correct 3 ms 14936 KB Output is correct
15 Correct 2 ms 16984 KB Output is correct
16 Correct 2 ms 16984 KB Output is correct
17 Correct 17 ms 27736 KB Output is correct
18 Correct 18 ms 27736 KB Output is correct
19 Correct 24 ms 27600 KB Output is correct
20 Correct 22 ms 27860 KB Output is correct
21 Correct 15 ms 27224 KB Output is correct
22 Correct 24 ms 27652 KB Output is correct
23 Correct 30 ms 27732 KB Output is correct
24 Correct 18 ms 27736 KB Output is correct
25 Correct 24 ms 27860 KB Output is correct
26 Correct 24 ms 27148 KB Output is correct
27 Correct 3 ms 16984 KB Output is correct
28 Correct 2 ms 16984 KB Output is correct
29 Correct 2 ms 16984 KB Output is correct
30 Correct 3 ms 16984 KB Output is correct
31 Correct 2 ms 16984 KB Output is correct
32 Correct 2 ms 16984 KB Output is correct
33 Correct 4 ms 16984 KB Output is correct
34 Correct 3 ms 16984 KB Output is correct
35 Correct 3 ms 17040 KB Output is correct
36 Correct 3 ms 16984 KB Output is correct

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 150 ms 17352 KB Output is correct
2 Correct 456 ms 27728 KB Output is correct
3 Correct 441 ms 27592 KB Output is correct
4 Correct 442 ms 27652 KB Output is correct
5 Correct 487 ms 27736 KB Output is correct
6 Correct 480 ms 27736 KB Output is correct
7 Correct 419 ms 27604 KB Output is correct
8 Correct 568 ms 27140 KB Output is correct
9 Correct 547 ms 27860 KB Output is correct
10 Correct 511 ms 27224 KB Output is correct
11 Correct 500 ms 28112 KB Output is correct
12 Correct 20 ms 27736 KB Output is correct
13 Correct 18 ms 27736 KB Output is correct
14 Correct 18 ms 27736 KB Output is correct
15 Correct 14 ms 27860 KB Output is correct
16 Correct 15 ms 27140 KB Output is correct
17 Correct 16 ms 27248 KB Output is correct
18 Correct 17 ms 27736 KB Output is correct
19 Correct 17 ms 27736 KB Output is correct
20 Correct 20 ms 27736 KB Output is correct
21 Correct 18 ms 27736 KB Output is correct
22 Correct 18 ms 27736 KB Output is correct
23 Correct 18 ms 27736 KB Output is correct
24 Correct 21 ms 27224 KB Output is correct
25 Correct 15 ms 27736 KB Output is correct
26 Correct 14 ms 27224 KB Output is correct
27 Correct 14 ms 27860 KB Output is correct
28 Correct 2 ms 16984 KB Output is correct
29 Correct 2 ms 16984 KB Output is correct
30 Correct 2 ms 16984 KB Output is correct
31 Correct 2 ms 16984 KB Output is correct
32 Correct 2 ms 16984 KB Output is correct
33 Correct 2 ms 16984 KB Output is correct
34 Correct 2 ms 16984 KB Output is correct
35 Correct 3 ms 16984 KB Output is correct
36 Correct 2 ms 16984 KB Output is correct
37 Correct 2 ms 16984 KB Output is correct
38 Correct 2 ms 16984 KB Output is correct
39 Correct 2 ms 16984 KB Output is correct
40 Correct 2 ms 16984 KB Output is correct
41 Correct 2 ms 16984 KB Output is correct
42 Correct 2 ms 16984 KB Output is correct
43 Correct 2 ms 16984 KB Output is correct

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 16984 KB Output is correct
2 Correct 2 ms 19032 KB Output is correct
3 Correct 3 ms 19032 KB Output is correct
4 Correct 3 ms 19032 KB Output is correct
5 Correct 3 ms 19032 KB Output is correct
6 Correct 3 ms 19100 KB Output is correct
7 Correct 2 ms 19032 KB Output is correct
8 Correct 2 ms 16984 KB Output is correct
9 Correct 3 ms 16984 KB Output is correct
10 Correct 2 ms 16808 KB Output is correct
11 Correct 2 ms 16984 KB Output is correct
12 Correct 2 ms 14936 KB Output is correct
13 Correct 2 ms 16984 KB Output is correct
14 Correct 2 ms 16984 KB Output is correct
15 Correct 2 ms 16984 KB Output is correct
16 Correct 2 ms 16984 KB Output is correct
17 Correct 2 ms 16984 KB Output is correct
18 Correct 2 ms 16984 KB Output is correct
19 Correct 3 ms 16984 KB Output is correct
20 Correct 2 ms 16984 KB Output is correct
21 Correct 2 ms 16984 KB Output is correct
22 Correct 2 ms 16984 KB Output is correct
23 Correct 2 ms 16984 KB Output is correct
24 Correct 2 ms 16984 KB Output is correct
25 Correct 2 ms 16992 KB Output is correct
26 Correct 2 ms 16984 KB Output is correct
27 Correct 2 ms 16984 KB Output is correct
28 Correct 2 ms 16996 KB Output is correct
29 Correct 2 ms 16984 KB Output is correct
30 Correct 2 ms 16984 KB Output is correct
31 Correct 3 ms 16984 KB Output is correct
32 Correct 2 ms 16984 KB Output is correct
33 Correct 2 ms 17044 KB Output is correct
34 Correct 2 ms 16984 KB Output is correct
35 Correct 2 ms 16984 KB Output is correct
36 Correct 18 ms 30552 KB Output is correct
37 Correct 24 ms 30020 KB Output is correct
38 Correct 28 ms 32076 KB Output is correct
39 Correct 18 ms 29284 KB Output is correct
40 Correct 30 ms 34792 KB Output is correct
41 Correct 27 ms 32460 KB Output is correct
42 Correct 31 ms 36428 KB Output is correct
43 Correct 21 ms 27132 KB Output is correct
44 Correct 15 ms 27860 KB Output is correct
45 Correct 14 ms 27220 KB Output is correct
46 Correct 18 ms 27652 KB Output is correct
47 Correct 17 ms 27608 KB Output is correct
48 Correct 18 ms 27736 KB Output is correct
49 Correct 21 ms 27736 KB Output is correct
50 Correct 15 ms 27860 KB Output is correct
51 Correct 14 ms 27136 KB Output is correct
52 Correct 26 ms 27736 KB Output is correct
53 Correct 20 ms 27736 KB Output is correct
54 Correct 17 ms 27736 KB Output is correct
55 Correct 16 ms 27772 KB Output is correct
56 Correct 21 ms 27224 KB Output is correct
57 Correct 19 ms 27224 KB Output is correct
58 Correct 17 ms 27736 KB Output is correct
59 Correct 18 ms 27736 KB Output is correct
60 Correct 24 ms 27736 KB Output is correct
61 Correct 21 ms 27648 KB Output is correct
62 Correct 18 ms 27736 KB Output is correct
63 Correct 18 ms 27736 KB Output is correct
64 Correct 15 ms 27224 KB Output is correct
65 Correct 14 ms 27860 KB Output is correct
66 Correct 14 ms 27148 KB Output is correct
67 Correct 15 ms 27860 KB Output is correct
68 Correct 424 ms 27660 KB Output is correct
69 Correct 512 ms 27736 KB Output is correct
70 Correct 529 ms 27472 KB Output is correct
71 Correct 428 ms 27732 KB Output is correct
72 Correct 534 ms 27736 KB Output is correct
73 Correct 497 ms 27736 KB Output is correct
74 Correct 571 ms 27736 KB Output is correct
75 Correct 555 ms 27224 KB Output is correct
76 Correct 416 ms 27860 KB Output is correct
77 Correct 386 ms 27224 KB Output is correct
78 Correct 484 ms 27780 KB Output is correct
79 Correct 429 ms 27132 KB Output is correct
80 Correct 435 ms 27860 KB Output is correct
81 Correct 3 ms 14936 KB Output is correct
82 Correct 2 ms 16984 KB Output is correct
83 Correct 2 ms 16984 KB Output is correct
84 Correct 17 ms 27736 KB Output is correct
85 Correct 18 ms 27736 KB Output is correct
86 Correct 24 ms 27600 KB Output is correct
87 Correct 22 ms 27860 KB Output is correct
88 Correct 15 ms 27224 KB Output is correct
89 Correct 24 ms 27652 KB Output is correct
90 Correct 30 ms 27732 KB Output is correct
91 Correct 18 ms 27736 KB Output is correct
92 Correct 24 ms 27860 KB Output is correct
93 Correct 24 ms 27148 KB Output is correct
94 Correct 3 ms 16984 KB Output is correct
95 Correct 2 ms 16984 KB Output is correct
96 Correct 2 ms 16984 KB Output is correct
97 Correct 3 ms 16984 KB Output is correct
98 Correct 2 ms 16984 KB Output is correct
99 Correct 2 ms 16984 KB Output is correct
100 Correct 4 ms 16984 KB Output is correct
101 Correct 3 ms 16984 KB Output is correct
102 Correct 3 ms 17040 KB Output is correct
103 Correct 3 ms 16984 KB Output is correct
104 Incorrect 520 ms 31712 KB 18220th lines differ - on the 1st token, expected: '1', found: '2'
105 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 243 ms 23896 KB Output is correct
2 Correct 536 ms 27224 KB Output is correct
3 Correct 506 ms 27224 KB Output is correct
4 Correct 471 ms 27224 KB Output is correct
5 Correct 541 ms 27860 KB Output is correct
6 Correct 527 ms 27224 KB Output is correct
7 Correct 453 ms 27860 KB Output is correct
8 Correct 2 ms 14936 KB Output is correct
9 Correct 2 ms 16984 KB Output is correct
10 Correct 2 ms 16984 KB Output is correct
11 Correct 3 ms 16984 KB Output is correct
12 Correct 2 ms 19032 KB Output is correct
13 Correct 3 ms 19032 KB Output is correct
14 Correct 3 ms 19032 KB Output is correct
15 Correct 3 ms 19032 KB Output is correct
16 Correct 3 ms 19100 KB Output is correct
17 Correct 2 ms 19032 KB Output is correct
18 Correct 2 ms 16984 KB Output is correct
19 Correct 3 ms 16984 KB Output is correct
20 Correct 2 ms 16808 KB Output is correct
21 Correct 2 ms 16984 KB Output is correct
22 Correct 2 ms 14936 KB Output is correct
23 Correct 2 ms 16984 KB Output is correct
24 Correct 2 ms 16984 KB Output is correct
25 Correct 2 ms 16984 KB Output is correct
26 Correct 2 ms 16984 KB Output is correct
27 Correct 2 ms 16984 KB Output is correct
28 Correct 2 ms 16984 KB Output is correct
29 Correct 3 ms 16984 KB Output is correct
30 Correct 2 ms 16984 KB Output is correct
31 Correct 2 ms 16984 KB Output is correct
32 Correct 2 ms 16984 KB Output is correct
33 Correct 2 ms 16984 KB Output is correct
34 Correct 2 ms 16984 KB Output is correct
35 Correct 2 ms 16992 KB Output is correct
36 Correct 2 ms 16984 KB Output is correct
37 Correct 2 ms 16984 KB Output is correct
38 Correct 2 ms 16996 KB Output is correct
39 Correct 2 ms 16984 KB Output is correct
40 Correct 2 ms 16984 KB Output is correct
41 Correct 3 ms 16984 KB Output is correct
42 Correct 2 ms 16984 KB Output is correct
43 Correct 2 ms 17044 KB Output is correct
44 Correct 2 ms 16984 KB Output is correct
45 Correct 2 ms 16984 KB Output is correct
46 Correct 18 ms 30552 KB Output is correct
47 Correct 24 ms 30020 KB Output is correct
48 Correct 28 ms 32076 KB Output is correct
49 Correct 18 ms 29284 KB Output is correct
50 Correct 30 ms 34792 KB Output is correct
51 Correct 27 ms 32460 KB Output is correct
52 Correct 31 ms 36428 KB Output is correct
53 Correct 21 ms 27132 KB Output is correct
54 Correct 15 ms 27860 KB Output is correct
55 Correct 14 ms 27220 KB Output is correct
56 Correct 18 ms 27652 KB Output is correct
57 Correct 17 ms 27608 KB Output is correct
58 Correct 18 ms 27736 KB Output is correct
59 Correct 21 ms 27736 KB Output is correct
60 Correct 15 ms 27860 KB Output is correct
61 Correct 14 ms 27136 KB Output is correct
62 Correct 26 ms 27736 KB Output is correct
63 Correct 20 ms 27736 KB Output is correct
64 Correct 17 ms 27736 KB Output is correct
65 Correct 16 ms 27772 KB Output is correct
66 Correct 21 ms 27224 KB Output is correct
67 Correct 19 ms 27224 KB Output is correct
68 Correct 17 ms 27736 KB Output is correct
69 Correct 18 ms 27736 KB Output is correct
70 Correct 24 ms 27736 KB Output is correct
71 Correct 21 ms 27648 KB Output is correct
72 Correct 18 ms 27736 KB Output is correct
73 Correct 18 ms 27736 KB Output is correct
74 Correct 15 ms 27224 KB Output is correct
75 Correct 14 ms 27860 KB Output is correct
76 Correct 14 ms 27148 KB Output is correct
77 Correct 15 ms 27860 KB Output is correct
78 Correct 424 ms 27660 KB Output is correct
79 Correct 512 ms 27736 KB Output is correct
80 Correct 529 ms 27472 KB Output is correct
81 Correct 428 ms 27732 KB Output is correct
82 Correct 534 ms 27736 KB Output is correct
83 Correct 497 ms 27736 KB Output is correct
84 Correct 571 ms 27736 KB Output is correct
85 Correct 555 ms 27224 KB Output is correct
86 Correct 416 ms 27860 KB Output is correct
87 Correct 386 ms 27224 KB Output is correct
88 Correct 484 ms 27780 KB Output is correct
89 Correct 429 ms 27132 KB Output is correct
90 Correct 435 ms 27860 KB Output is correct
91 Correct 3 ms 14936 KB Output is correct
92 Correct 2 ms 16984 KB Output is correct
93 Correct 2 ms 16984 KB Output is correct
94 Correct 17 ms 27736 KB Output is correct
95 Correct 18 ms 27736 KB Output is correct
96 Correct 24 ms 27600 KB Output is correct
97 Correct 22 ms 27860 KB Output is correct
98 Correct 15 ms 27224 KB Output is correct
99 Correct 24 ms 27652 KB Output is correct
100 Correct 30 ms 27732 KB Output is correct
101 Correct 18 ms 27736 KB Output is correct
102 Correct 24 ms 27860 KB Output is correct
103 Correct 24 ms 27148 KB Output is correct
104 Correct 3 ms 16984 KB Output is correct
105 Correct 2 ms 16984 KB Output is correct
106 Correct 2 ms 16984 KB Output is correct
107 Correct 3 ms 16984 KB Output is correct
108 Correct 2 ms 16984 KB Output is correct
109 Correct 2 ms 16984 KB Output is correct
110 Correct 4 ms 16984 KB Output is correct
111 Correct 3 ms 16984 KB Output is correct
112 Correct 3 ms 17040 KB Output is correct
113 Correct 3 ms 16984 KB Output is correct
114 Correct 150 ms 17352 KB Output is correct
115 Correct 456 ms 27728 KB Output is correct
116 Correct 441 ms 27592 KB Output is correct
117 Correct 442 ms 27652 KB Output is correct
118 Correct 487 ms 27736 KB Output is correct
119 Correct 480 ms 27736 KB Output is correct
120 Correct 419 ms 27604 KB Output is correct
121 Correct 568 ms 27140 KB Output is correct
122 Correct 547 ms 27860 KB Output is correct
123 Correct 511 ms 27224 KB Output is correct
124 Correct 500 ms 28112 KB Output is correct
125 Correct 20 ms 27736 KB Output is correct
126 Correct 18 ms 27736 KB Output is correct
127 Correct 18 ms 27736 KB Output is correct
128 Correct 14 ms 27860 KB Output is correct
129 Correct 15 ms 27140 KB Output is correct
130 Correct 16 ms 27248 KB Output is correct
131 Correct 17 ms 27736 KB Output is correct
132 Correct 17 ms 27736 KB Output is correct
133 Correct 20 ms 27736 KB Output is correct
134 Correct 18 ms 27736 KB Output is correct
135 Correct 18 ms 27736 KB Output is correct
136 Correct 18 ms 27736 KB Output is correct
137 Correct 21 ms 27224 KB Output is correct
138 Correct 15 ms 27736 KB Output is correct
139 Correct 14 ms 27224 KB Output is correct
140 Correct 14 ms 27860 KB Output is correct
141 Correct 2 ms 16984 KB Output is correct
142 Correct 2 ms 16984 KB Output is correct
143 Correct 2 ms 16984 KB Output is correct
144 Correct 2 ms 16984 KB Output is correct
145 Correct 2 ms 16984 KB Output is correct
146 Correct 2 ms 16984 KB Output is correct
147 Correct 2 ms 16984 KB Output is correct
148 Correct 3 ms 16984 KB Output is correct
149 Correct 2 ms 16984 KB Output is correct
150 Correct 2 ms 16984 KB Output is correct
151 Correct 2 ms 16984 KB Output is correct
152 Correct 2 ms 16984 KB Output is correct
153 Correct 2 ms 16984 KB Output is correct
154 Correct 2 ms 16984 KB Output is correct
155 Correct 2 ms 16984 KB Output is correct
156 Correct 2 ms 16984 KB Output is correct
157 Incorrect 520 ms 31712 KB 18220th lines differ - on the 1st token, expected: '1', found: '2'
158 Halted 0 ms 0 KB -