Submission #836224

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
836224	2023-08-24T08:57:10 Z	tengiz05	Radio Towers (IOI22_towers)	C++17	11 / 100	4000 ms	2616 KB

towers

#include "towers.h"

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

vector<int> h;
int n;
void init(int N, vector<int> H) {
    n = N;
    h = H;
}

int max_towers(int l, int r, int D) {
    vector<int> dp(n);
    deque<pair<int, int>> st;
    vector<int> nxt(n, -1);
    for (int i = n - 1; i >= 0; i--) {
        while (!st.empty() && h[st.front().second] <= h[i]) st.pop_front();
        st.push_front({h[i], i});
        auto p = lower_bound(st.begin(), st.end(), pair{h[i] + D, -1});
        if (p != st.end()) {
            nxt[i] = p->second;
        }
    }
    st.clear();
    vector<int> prev(n, -1);
    for (int i = 0; i < n; i++) {
        while (!st.empty() && h[st.front().second] <= h[i]) st.pop_front();
        st.push_front({h[i], i});
        auto p = lower_bound(st.begin(), st.end(), pair{h[i] + D, -1});
        if (p != st.end()) {
            prev[i] = p->second;
        }
    }
    for (int i = l; i <= r; i++) {
        dp[i] = 1;
        for (int j = l; j < i; j++) {
            if (nxt[j] != -1 && prev[i] != -1 && nxt[j] < i && prev[i] > j) {
                dp[i] = max(dp[i], dp[j] + 1);
            }
        }
    }
    return *max_element(dp.begin(), dp.end());
}

Subtask #1

0 / 4.0

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

Subtask #2

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	2 ms	208 KB	Output is correct
3	Correct	2 ms	208 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	2 ms	208 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	3 ms	208 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	4 ms	208 KB	Output is correct
21	Correct	4 ms	208 KB	Output is correct
22	Correct	5 ms	208 KB	Output is correct
23	Correct	2 ms	348 KB	Output is correct
24	Correct	3 ms	344 KB	Output is correct
25	Correct	2 ms	208 KB	Output is correct
26	Correct	5 ms	208 KB	Output is correct
27	Correct	6 ms	332 KB	Output is correct
28	Correct	5 ms	208 KB	Output is correct
29	Correct	4 ms	208 KB	Output is correct
30	Correct	6 ms	208 KB	Output is correct
31	Correct	5 ms	328 KB	Output is correct
32	Correct	2 ms	336 KB	Output is correct
33	Correct	4 ms	336 KB	Output is correct
34	Correct	2 ms	336 KB	Output is correct
35	Correct	3 ms	336 KB	Output is correct

Subtask #3

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	2 ms	208 KB	Output is correct
3	Correct	2 ms	208 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	2 ms	208 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	3 ms	208 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	4 ms	208 KB	Output is correct
21	Correct	4 ms	208 KB	Output is correct
22	Correct	5 ms	208 KB	Output is correct
23	Correct	2 ms	348 KB	Output is correct
24	Correct	3 ms	344 KB	Output is correct
25	Correct	2 ms	208 KB	Output is correct
26	Correct	5 ms	208 KB	Output is correct
27	Correct	6 ms	332 KB	Output is correct
28	Correct	5 ms	208 KB	Output is correct
29	Correct	4 ms	208 KB	Output is correct
30	Correct	6 ms	208 KB	Output is correct
31	Correct	5 ms	328 KB	Output is correct
32	Correct	2 ms	336 KB	Output is correct
33	Correct	4 ms	336 KB	Output is correct
34	Correct	2 ms	336 KB	Output is correct
35	Correct	3 ms	336 KB	Output is correct
36	Correct	426 ms	1572 KB	Output is correct
37	Correct	1947 ms	2248 KB	Output is correct
38	Correct	321 ms	2196 KB	Output is correct
39	Correct	690 ms	2248 KB	Output is correct
40	Correct	291 ms	2248 KB	Output is correct
41	Execution timed out	4005 ms	2192 KB	Time limit exceeded
42	Halted	0 ms	0 KB	-

Subtask #4

0 / 14.0

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

Subtask #5

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	4027 ms	784 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	208 KB	Output is correct
2	Correct	2 ms	208 KB	Output is correct
3	Correct	2 ms	208 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	2 ms	208 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	3 ms	208 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	4 ms	208 KB	Output is correct
21	Correct	4 ms	208 KB	Output is correct
22	Correct	5 ms	208 KB	Output is correct
23	Correct	2 ms	348 KB	Output is correct
24	Correct	3 ms	344 KB	Output is correct
25	Correct	2 ms	208 KB	Output is correct
26	Correct	5 ms	208 KB	Output is correct
27	Correct	6 ms	332 KB	Output is correct
28	Correct	5 ms	208 KB	Output is correct
29	Correct	4 ms	208 KB	Output is correct
30	Correct	6 ms	208 KB	Output is correct
31	Correct	5 ms	328 KB	Output is correct
32	Correct	2 ms	336 KB	Output is correct
33	Correct	4 ms	336 KB	Output is correct
34	Correct	2 ms	336 KB	Output is correct
35	Correct	3 ms	336 KB	Output is correct
36	Correct	426 ms	1572 KB	Output is correct
37	Correct	1947 ms	2248 KB	Output is correct
38	Correct	321 ms	2196 KB	Output is correct
39	Correct	690 ms	2248 KB	Output is correct
40	Correct	291 ms	2248 KB	Output is correct
41	Execution timed out	4005 ms	2192 KB	Time limit exceeded
42	Halted	0 ms	0 KB	-

Subtask #7

0 / 23.0

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