oj.uz

Submission #1056708

# Submission time Handle Problem Language Result Execution time Memory
1056708 2024-08-13T10:41:40 Z parsadox2 Radio Towers (IOI22_towers) C++17
58 / 100
 602 ms 36252 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;
}

bool cmp(pair <int , int> aa , pair <int , int> bb)
{
	return aa.S < bb.S;
}

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();
	sort(good.begin() , good.end() , cmp);
	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

# Verdict Execution time Memory Grader output
1 Correct 257 ms 23920 KB Output is correct
2 Correct 485 ms 27356 KB Output is correct
3 Correct 464 ms 27224 KB Output is correct
4 Correct 436 ms 27144 KB Output is correct
5 Correct 418 ms 27784 KB Output is correct
6 Correct 426 ms 27160 KB Output is correct
7 Correct 545 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

# Verdict Execution time Memory Grader output
1 Correct 2 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 2 ms 19032 KB Output is correct
5 Correct 2 ms 19108 KB Output is correct
6 Correct 3 ms 19032 KB Output is correct
7 Correct 3 ms 19032 KB Output is correct
8 Correct 2 ms 16984 KB Output is correct
9 Correct 2 ms 16984 KB Output is correct
10 Correct 2 ms 16984 KB Output is correct
11 Correct 2 ms 17016 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 17044 KB Output is correct
19 Correct 2 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 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 16808 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 2 ms 16996 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

# Verdict Execution time Memory Grader output
1 Correct 2 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 2 ms 19032 KB Output is correct
5 Correct 2 ms 19108 KB Output is correct
6 Correct 3 ms 19032 KB Output is correct
7 Correct 3 ms 19032 KB Output is correct
8 Correct 2 ms 16984 KB Output is correct
9 Correct 2 ms 16984 KB Output is correct
10 Correct 2 ms 16984 KB Output is correct
11 Correct 2 ms 17016 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 17044 KB Output is correct
19 Correct 2 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 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 16808 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 2 ms 16996 KB Output is correct
34 Correct 2 ms 16984 KB Output is correct
35 Correct 2 ms 16984 KB Output is correct
36 Correct 19 ms 30552 KB Output is correct
37 Correct 21 ms 30020 KB Output is correct
38 Correct 39 ms 32076 KB Output is correct
39 Correct 28 ms 29252 KB Output is correct
40 Correct 36 ms 34740 KB Output is correct
41 Correct 27 ms 32324 KB Output is correct
42 Correct 33 ms 36252 KB Output is correct
43 Correct 14 ms 27224 KB Output is correct
44 Correct 15 ms 27780 KB Output is correct
45 Correct 14 ms 27224 KB Output is correct
46 Correct 21 ms 27656 KB Output is correct
47 Correct 17 ms 27736 KB Output is correct
48 Correct 17 ms 27736 KB Output is correct
49 Correct 27 ms 27564 KB Output is correct
50 Correct 15 ms 27892 KB Output is correct
51 Correct 18 ms 27360 KB Output is correct
52 Correct 18 ms 27896 KB Output is correct
53 Correct 24 ms 27736 KB Output is correct
54 Correct 18 ms 27604 KB Output is correct
55 Correct 15 ms 27860 KB Output is correct
56 Correct 16 ms 27144 KB Output is correct
57 Correct 17 ms 27224 KB Output is correct
58 Correct 18 ms 27736 KB Output is correct
59 Correct 24 ms 27652 KB Output is correct
60 Correct 17 ms 27736 KB Output is correct
61 Correct 20 ms 27656 KB Output is correct
62 Correct 24 ms 27652 KB Output is correct
63 Correct 17 ms 27584 KB Output is correct
64 Correct 14 ms 27224 KB Output is correct
65 Correct 14 ms 27988 KB Output is correct
66 Correct 14 ms 27224 KB Output is correct
67 Correct 14 ms 27772 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 326 ms 27480 KB Output is correct
2 Correct 464 ms 27736 KB Output is correct
3 Correct 503 ms 27736 KB Output is correct
4 Correct 569 ms 27736 KB Output is correct
5 Correct 602 ms 27736 KB Output is correct
6 Correct 571 ms 27608 KB Output is correct
7 Correct 564 ms 27736 KB Output is correct
8 Correct 565 ms 27224 KB Output is correct
9 Correct 505 ms 27860 KB Output is correct
10 Correct 468 ms 27224 KB Output is correct
11 Correct 492 ms 27860 KB Output is correct
12 Correct 533 ms 27224 KB Output is correct
13 Correct 546 ms 27852 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 27608 KB Output is correct
18 Correct 17 ms 27736 KB Output is correct
19 Correct 18 ms 27612 KB Output is correct
20 Correct 15 ms 27776 KB Output is correct
21 Correct 14 ms 27352 KB Output is correct
22 Correct 18 ms 27736 KB Output is correct
23 Correct 23 ms 27736 KB Output is correct
24 Correct 18 ms 27736 KB Output is correct
25 Correct 15 ms 27988 KB Output is correct
26 Correct 20 ms 27332 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 2 ms 16984 KB Output is correct
31 Correct 2 ms 16984 KB Output is correct
32 Correct 2 ms 17044 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 17040 KB Output is correct
36 Correct 2 ms 16984 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 17488 KB Output is correct
2 Correct 578 ms 27652 KB Output is correct
3 Correct 531 ms 27660 KB Output is correct
4 Correct 579 ms 27736 KB Output is correct
5 Correct 546 ms 27736 KB Output is correct
6 Correct 588 ms 27736 KB Output is correct
7 Correct 553 ms 27736 KB Output is correct
8 Correct 518 ms 27224 KB Output is correct
9 Correct 469 ms 27852 KB Output is correct
10 Correct 432 ms 27168 KB Output is correct
11 Correct 390 ms 27984 KB Output is correct
12 Correct 21 ms 27728 KB Output is correct
13 Correct 19 ms 27656 KB Output is correct
14 Correct 20 ms 27612 KB Output is correct
15 Correct 19 ms 27772 KB Output is correct
16 Correct 15 ms 27252 KB Output is correct
17 Correct 18 ms 27224 KB Output is correct
18 Correct 19 ms 27628 KB Output is correct
19 Correct 21 ms 27664 KB Output is correct
20 Correct 21 ms 27736 KB Output is correct
21 Correct 18 ms 27676 KB Output is correct
22 Correct 21 ms 27660 KB Output is correct
23 Correct 20 ms 27660 KB Output is correct
24 Correct 15 ms 27224 KB Output is correct
25 Correct 15 ms 27860 KB Output is correct
26 Correct 17 ms 27144 KB Output is correct
27 Correct 15 ms 27988 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 3 ms 16984 KB Output is correct
34 Correct 3 ms 16984 KB Output is correct
35 Correct 2 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 3 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

# Verdict Execution time Memory Grader output
1 Correct 2 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 2 ms 19032 KB Output is correct
5 Correct 2 ms 19108 KB Output is correct
6 Correct 3 ms 19032 KB Output is correct
7 Correct 3 ms 19032 KB Output is correct
8 Correct 2 ms 16984 KB Output is correct
9 Correct 2 ms 16984 KB Output is correct
10 Correct 2 ms 16984 KB Output is correct
11 Correct 2 ms 17016 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 17044 KB Output is correct
19 Correct 2 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 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 16808 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 2 ms 16996 KB Output is correct
34 Correct 2 ms 16984 KB Output is correct
35 Correct 2 ms 16984 KB Output is correct
36 Correct 19 ms 30552 KB Output is correct
37 Correct 21 ms 30020 KB Output is correct
38 Correct 39 ms 32076 KB Output is correct
39 Correct 28 ms 29252 KB Output is correct
40 Correct 36 ms 34740 KB Output is correct
41 Correct 27 ms 32324 KB Output is correct
42 Correct 33 ms 36252 KB Output is correct
43 Correct 14 ms 27224 KB Output is correct
44 Correct 15 ms 27780 KB Output is correct
45 Correct 14 ms 27224 KB Output is correct
46 Correct 21 ms 27656 KB Output is correct
47 Correct 17 ms 27736 KB Output is correct
48 Correct 17 ms 27736 KB Output is correct
49 Correct 27 ms 27564 KB Output is correct
50 Correct 15 ms 27892 KB Output is correct
51 Correct 18 ms 27360 KB Output is correct
52 Correct 18 ms 27896 KB Output is correct
53 Correct 24 ms 27736 KB Output is correct
54 Correct 18 ms 27604 KB Output is correct
55 Correct 15 ms 27860 KB Output is correct
56 Correct 16 ms 27144 KB Output is correct
57 Correct 17 ms 27224 KB Output is correct
58 Correct 18 ms 27736 KB Output is correct
59 Correct 24 ms 27652 KB Output is correct
60 Correct 17 ms 27736 KB Output is correct
61 Correct 20 ms 27656 KB Output is correct
62 Correct 24 ms 27652 KB Output is correct
63 Correct 17 ms 27584 KB Output is correct
64 Correct 14 ms 27224 KB Output is correct
65 Correct 14 ms 27988 KB Output is correct
66 Correct 14 ms 27224 KB Output is correct
67 Correct 14 ms 27772 KB Output is correct
68 Correct 326 ms 27480 KB Output is correct
69 Correct 464 ms 27736 KB Output is correct
70 Correct 503 ms 27736 KB Output is correct
71 Correct 569 ms 27736 KB Output is correct
72 Correct 602 ms 27736 KB Output is correct
73 Correct 571 ms 27608 KB Output is correct
74 Correct 564 ms 27736 KB Output is correct
75 Correct 565 ms 27224 KB Output is correct
76 Correct 505 ms 27860 KB Output is correct
77 Correct 468 ms 27224 KB Output is correct
78 Correct 492 ms 27860 KB Output is correct
79 Correct 533 ms 27224 KB Output is correct
80 Correct 546 ms 27852 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 27608 KB Output is correct
85 Correct 17 ms 27736 KB Output is correct
86 Correct 18 ms 27612 KB Output is correct
87 Correct 15 ms 27776 KB Output is correct
88 Correct 14 ms 27352 KB Output is correct
89 Correct 18 ms 27736 KB Output is correct
90 Correct 23 ms 27736 KB Output is correct
91 Correct 18 ms 27736 KB Output is correct
92 Correct 15 ms 27988 KB Output is correct
93 Correct 20 ms 27332 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 2 ms 16984 KB Output is correct
98 Correct 2 ms 16984 KB Output is correct
99 Correct 2 ms 17044 KB Output is correct
100 Correct 2 ms 16984 KB Output is correct
101 Correct 2 ms 16984 KB Output is correct
102 Correct 2 ms 17040 KB Output is correct
103 Correct 2 ms 16984 KB Output is correct
104 Incorrect 477 ms 31768 KB 18220th lines differ - on the 1st token, expected: '1', found: '2'
105 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 257 ms 23920 KB Output is correct
2 Correct 485 ms 27356 KB Output is correct
3 Correct 464 ms 27224 KB Output is correct
4 Correct 436 ms 27144 KB Output is correct
5 Correct 418 ms 27784 KB Output is correct
6 Correct 426 ms 27160 KB Output is correct
7 Correct 545 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 2 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 2 ms 19032 KB Output is correct
15 Correct 2 ms 19108 KB Output is correct
16 Correct 3 ms 19032 KB Output is correct
17 Correct 3 ms 19032 KB Output is correct
18 Correct 2 ms 16984 KB Output is correct
19 Correct 2 ms 16984 KB Output is correct
20 Correct 2 ms 16984 KB Output is correct
21 Correct 2 ms 17016 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 17044 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 2 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 16808 KB Output is correct
39 Correct 2 ms 16984 KB Output is correct
40 Correct 3 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 16996 KB Output is correct
44 Correct 2 ms 16984 KB Output is correct
45 Correct 2 ms 16984 KB Output is correct
46 Correct 19 ms 30552 KB Output is correct
47 Correct 21 ms 30020 KB Output is correct
48 Correct 39 ms 32076 KB Output is correct
49 Correct 28 ms 29252 KB Output is correct
50 Correct 36 ms 34740 KB Output is correct
51 Correct 27 ms 32324 KB Output is correct
52 Correct 33 ms 36252 KB Output is correct
53 Correct 14 ms 27224 KB Output is correct
54 Correct 15 ms 27780 KB Output is correct
55 Correct 14 ms 27224 KB Output is correct
56 Correct 21 ms 27656 KB Output is correct
57 Correct 17 ms 27736 KB Output is correct
58 Correct 17 ms 27736 KB Output is correct
59 Correct 27 ms 27564 KB Output is correct
60 Correct 15 ms 27892 KB Output is correct
61 Correct 18 ms 27360 KB Output is correct
62 Correct 18 ms 27896 KB Output is correct
63 Correct 24 ms 27736 KB Output is correct
64 Correct 18 ms 27604 KB Output is correct
65 Correct 15 ms 27860 KB Output is correct
66 Correct 16 ms 27144 KB Output is correct
67 Correct 17 ms 27224 KB Output is correct
68 Correct 18 ms 27736 KB Output is correct
69 Correct 24 ms 27652 KB Output is correct
70 Correct 17 ms 27736 KB Output is correct
71 Correct 20 ms 27656 KB Output is correct
72 Correct 24 ms 27652 KB Output is correct
73 Correct 17 ms 27584 KB Output is correct
74 Correct 14 ms 27224 KB Output is correct
75 Correct 14 ms 27988 KB Output is correct
76 Correct 14 ms 27224 KB Output is correct
77 Correct 14 ms 27772 KB Output is correct
78 Correct 326 ms 27480 KB Output is correct
79 Correct 464 ms 27736 KB Output is correct
80 Correct 503 ms 27736 KB Output is correct
81 Correct 569 ms 27736 KB Output is correct
82 Correct 602 ms 27736 KB Output is correct
83 Correct 571 ms 27608 KB Output is correct
84 Correct 564 ms 27736 KB Output is correct
85 Correct 565 ms 27224 KB Output is correct
86 Correct 505 ms 27860 KB Output is correct
87 Correct 468 ms 27224 KB Output is correct
88 Correct 492 ms 27860 KB Output is correct
89 Correct 533 ms 27224 KB Output is correct
90 Correct 546 ms 27852 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 27608 KB Output is correct
95 Correct 17 ms 27736 KB Output is correct
96 Correct 18 ms 27612 KB Output is correct
97 Correct 15 ms 27776 KB Output is correct
98 Correct 14 ms 27352 KB Output is correct
99 Correct 18 ms 27736 KB Output is correct
100 Correct 23 ms 27736 KB Output is correct
101 Correct 18 ms 27736 KB Output is correct
102 Correct 15 ms 27988 KB Output is correct
103 Correct 20 ms 27332 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 2 ms 16984 KB Output is correct
108 Correct 2 ms 16984 KB Output is correct
109 Correct 2 ms 17044 KB Output is correct
110 Correct 2 ms 16984 KB Output is correct
111 Correct 2 ms 16984 KB Output is correct
112 Correct 2 ms 17040 KB Output is correct
113 Correct 2 ms 16984 KB Output is correct
114 Correct 144 ms 17488 KB Output is correct
115 Correct 578 ms 27652 KB Output is correct
116 Correct 531 ms 27660 KB Output is correct
117 Correct 579 ms 27736 KB Output is correct
118 Correct 546 ms 27736 KB Output is correct
119 Correct 588 ms 27736 KB Output is correct
120 Correct 553 ms 27736 KB Output is correct
121 Correct 518 ms 27224 KB Output is correct
122 Correct 469 ms 27852 KB Output is correct
123 Correct 432 ms 27168 KB Output is correct
124 Correct 390 ms 27984 KB Output is correct
125 Correct 21 ms 27728 KB Output is correct
126 Correct 19 ms 27656 KB Output is correct
127 Correct 20 ms 27612 KB Output is correct
128 Correct 19 ms 27772 KB Output is correct
129 Correct 15 ms 27252 KB Output is correct
130 Correct 18 ms 27224 KB Output is correct
131 Correct 19 ms 27628 KB Output is correct
132 Correct 21 ms 27664 KB Output is correct
133 Correct 21 ms 27736 KB Output is correct
134 Correct 18 ms 27676 KB Output is correct
135 Correct 21 ms 27660 KB Output is correct
136 Correct 20 ms 27660 KB Output is correct
137 Correct 15 ms 27224 KB Output is correct
138 Correct 15 ms 27860 KB Output is correct
139 Correct 17 ms 27144 KB Output is correct
140 Correct 15 ms 27988 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 3 ms 16984 KB Output is correct
147 Correct 3 ms 16984 KB Output is correct
148 Correct 2 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 3 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 477 ms 31768 KB 18220th lines differ - on the 1st token, expected: '1', found: '2'
158 Halted 0 ms 0 KB -