Submission #775844

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
775844	2023-07-07T05:02:51 Z	SanguineChameleon	Radio Towers (IOI22_towers)	C++17	14 / 100	783 ms	1872 KB

towers

#include "towers.h"
#include <bits/stdc++.h>
using namespace std;

const int maxN = 1e5 + 20;
int cnt_min[maxN];
int H[maxN];
int N;

void init(int _N, vector<int> _H) {
	N = _N;
	for (int i = 0; i < N; i++) {
		H[i] = _H[i];
	}
	for (int i = 1; i < N - 1; i++) {
		cnt_min[i] = cnt_min[i - 1] + (H[i] < H[i - 1] && H[i] < H[i + 1]);
	}
}

int max_towers(int L, int R, int D) {
	if (L == R) {
		return 1;
	}
	if (D == 1) {
		return cnt_min[R - 1] - cnt_min[L] + (H[L] < H[L + 1]) + (H[R] < H[R - 1]);
	}
	return 0;
}

Subtask #1

0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	256 ms	1192 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	Incorrect	0 ms	208 KB	1st lines differ - on the 1st token, expected: '13', found: '0'
2	Halted	0 ms	0 KB	-

Subtask #3

0 / 12.0

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

Subtask #4

14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	473 ms	1716 KB	Output is correct
2	Correct	657 ms	1872 KB	Output is correct
3	Correct	690 ms	1740 KB	Output is correct
4	Correct	622 ms	1736 KB	Output is correct
5	Correct	727 ms	1832 KB	Output is correct
6	Correct	602 ms	1832 KB	Output is correct
7	Correct	783 ms	1744 KB	Output is correct
8	Correct	598 ms	1736 KB	Output is correct
9	Correct	750 ms	1872 KB	Output is correct
10	Correct	738 ms	1836 KB	Output is correct
11	Correct	597 ms	1736 KB	Output is correct
12	Correct	567 ms	1868 KB	Output is correct
13	Correct	513 ms	1872 KB	Output is correct
14	Correct	0 ms	208 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	208 KB	Output is correct
17	Correct	10 ms	1832 KB	Output is correct
18	Correct	9 ms	1736 KB	Output is correct
19	Correct	14 ms	1820 KB	Output is correct
20	Correct	9 ms	1844 KB	Output is correct
21	Correct	9 ms	1736 KB	Output is correct
22	Correct	9 ms	1856 KB	Output is correct
23	Correct	9 ms	1832 KB	Output is correct
24	Correct	14 ms	1736 KB	Output is correct
25	Correct	9 ms	1828 KB	Output is correct
26	Correct	9 ms	1736 KB	Output is correct
27	Correct	1 ms	208 KB	Output is correct
28	Correct	1 ms	208 KB	Output is correct
29	Correct	1 ms	336 KB	Output is correct
30	Correct	1 ms	336 KB	Output is correct
31	Correct	0 ms	208 KB	Output is correct
32	Correct	0 ms	336 KB	Output is correct
33	Correct	1 ms	336 KB	Output is correct
34	Correct	1 ms	208 KB	Output is correct
35	Correct	1 ms	280 KB	Output is correct
36	Correct	0 ms	208 KB	Output is correct

Subtask #5

0 / 17.0

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

Subtask #6

0 / 19.0

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

Subtask #7

0 / 23.0

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