oj.uz

Submission #712961

# Submission time Handle Problem Language Result Execution time Memory
712961 2023-03-20T16:19:57 Z t6twotwo Radio Towers (IOI22_towers) C++17
14 / 100
 895 ms 1948 KB 
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int N;
vector<int> H, pfs;
void init(int _N, vector<int> _H) {
    N = _N;
    H = _H;
    pfs.resize(N + 1);
    for (int i = 0; i < N; i++) {
        pfs[i + 1] = pfs[i];
        if ((i == 0 || H[i] < H[i - 1]) && (i == N - 1 || H[i] < H[i + 1])) {
            pfs[i + 1]++;
        }
    }
}
int max_towers(int L, int R, int D) {
    if (L == R) return 1;
    int ans = pfs[R] - pfs[L + 1];
    if (H[L] < H[L + 1]) ans++;
    if (H[R] < H[R - 1]) ans++;
    return ans;
}

Subtask #1
0 / 4.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 12.0

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

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 667 ms 1828 KB Output is correct
2 Correct 868 ms 1800 KB Output is correct
3 Correct 797 ms 1948 KB Output is correct
4 Correct 895 ms 1808 KB Output is correct
5 Correct 729 ms 1736 KB Output is correct
6 Correct 885 ms 1820 KB Output is correct
7 Correct 630 ms 1824 KB Output is correct
8 Correct 638 ms 1840 KB Output is correct
9 Correct 716 ms 1808 KB Output is correct
10 Correct 581 ms 1836 KB Output is correct
11 Correct 501 ms 1808 KB Output is correct
12 Correct 812 ms 1820 KB Output is correct
13 Correct 710 ms 1872 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 12 ms 1832 KB Output is correct
18 Correct 11 ms 1736 KB Output is correct
19 Correct 12 ms 1944 KB Output is correct
20 Correct 18 ms 1816 KB Output is correct
21 Correct 11 ms 1824 KB Output is correct
22 Correct 12 ms 1832 KB Output is correct
23 Correct 11 ms 1872 KB Output is correct
24 Correct 11 ms 1824 KB Output is correct
25 Correct 10 ms 1868 KB Output is correct
26 Correct 11 ms 1808 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 208 KB Output is correct
30 Correct 1 ms 208 KB Output is correct
31 Correct 1 ms 292 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 1 ms 208 KB Output is correct

Subtask #5
0 / 17.0

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

Subtask #6
0 / 19.0

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

Subtask #7
0 / 23.0

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