oj.uz

Submission #1056549

# Submission time Handle Problem Language Result Execution time Memory
1056549 2024-08-13T09:59:46 Z parsadox2 Radio Towers (IOI22_towers) C++17
14 / 100
 4000 ms 15960 KB 
#include <bits/stdc++.h>
#include "towers.h"
 
using namespace std;
 
const int N = 1e5 + 10 , inf = 1e9 , Lg = 17;
 
int n , a[N] , rmxq[N][Lg] , rmnq[N][Lg] , lg2[N];
int b[N] , psum[N];
 
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;
}
 
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];
}
 
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 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 , int val)
{
	if(l > r)
		return 0;
	int mn = a[Get_mn(l , r)];
	int pos_mx = Get_mx(l , r);
	if(mn > val)
		return 0;
	int res = max(1 , Solve(l , pos_mx - 1 , d , a[pos_mx] - d) + Solve(pos_mx + 1 , r , d , a[pos_mx] - d));
	return res;
}
 
 
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 0;
	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;
	}
	return Solve(l , r , d , inf);
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 212 ms 15464 KB 1st lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6488 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Incorrect 1 ms 6488 KB 1st lines differ - on the 1st token, expected: '1', found: '0'
9 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6488 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Incorrect 1 ms 6488 KB 1st lines differ - on the 1st token, expected: '1', found: '0'
9 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 318 ms 15924 KB Output is correct
2 Correct 510 ms 15960 KB Output is correct
3 Correct 476 ms 15948 KB Output is correct
4 Correct 451 ms 15960 KB Output is correct
5 Correct 531 ms 15960 KB Output is correct
6 Correct 499 ms 15960 KB Output is correct
7 Correct 457 ms 15932 KB Output is correct
8 Correct 476 ms 15948 KB Output is correct
9 Correct 523 ms 15960 KB Output is correct
10 Correct 551 ms 15960 KB Output is correct
11 Correct 539 ms 15960 KB Output is correct
12 Correct 477 ms 15960 KB Output is correct
13 Correct 486 ms 15960 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 1 ms 6488 KB Output is correct
17 Correct 14 ms 15944 KB Output is correct
18 Correct 14 ms 15960 KB Output is correct
19 Correct 14 ms 15952 KB Output is correct
20 Correct 14 ms 15960 KB Output is correct
21 Correct 19 ms 15960 KB Output is correct
22 Correct 13 ms 15960 KB Output is correct
23 Correct 19 ms 15948 KB Output is correct
24 Correct 13 ms 15960 KB Output is correct
25 Correct 13 ms 15948 KB Output is correct
26 Correct 17 ms 15960 KB Output is correct
27 Correct 1 ms 6488 KB Output is correct
28 Correct 1 ms 6488 KB Output is correct
29 Correct 1 ms 6488 KB Output is correct
30 Correct 1 ms 6488 KB Output is correct
31 Correct 1 ms 6488 KB Output is correct
32 Correct 1 ms 6488 KB Output is correct
33 Correct 1 ms 6488 KB Output is correct
34 Correct 1 ms 6488 KB Output is correct
35 Correct 1 ms 6488 KB Output is correct
36 Correct 1 ms 6488 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4024 ms 10840 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6488 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Incorrect 1 ms 6488 KB 1st lines differ - on the 1st token, expected: '1', found: '0'
9 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 212 ms 15464 KB 1st lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -