oj.uz

Submission #838631

# Submission time Handle Problem Language Result Execution time Memory
838631 2023-08-27T13:39:38 Z erekle Radio Towers (IOI22_towers) C++17
14 / 100
 773 ms 1836 KB 
#include "towers.h"
#include <vector>
#include <algorithm>

using namespace std;

int n;
vector<int> H, prefixLocalMX;

void init(int N, vector<int> Hs) {
    n = N, H = Hs;
    prefixLocalMX.resize(1+n);
    for (int i = 1; i < n-1; ++i) {
        prefixLocalMX[i+1] += prefixLocalMX[i];
        if (H[i] > H[i-1] && H[i] > H[i+1]) ++prefixLocalMX[i+1];
    }
}

int max_towers(int L, int R, int D) { // case D = 1
    return 1+max(0, prefixLocalMX[R] - prefixLocalMX[L+1]);
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 391 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 0 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 0 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 480 ms 1808 KB Output is correct
2 Correct 652 ms 1736 KB Output is correct
3 Correct 663 ms 1808 KB Output is correct
4 Correct 632 ms 1816 KB Output is correct
5 Correct 616 ms 1808 KB Output is correct
6 Correct 692 ms 1824 KB Output is correct
7 Correct 717 ms 1736 KB Output is correct
8 Correct 498 ms 1744 KB Output is correct
9 Correct 632 ms 1824 KB Output is correct
10 Correct 773 ms 1808 KB Output is correct
11 Correct 653 ms 1796 KB Output is correct
12 Correct 715 ms 1820 KB Output is correct
13 Correct 523 ms 1744 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 9 ms 1836 KB Output is correct
18 Correct 9 ms 1824 KB Output is correct
19 Correct 9 ms 1744 KB Output is correct
20 Correct 9 ms 1820 KB Output is correct
21 Correct 9 ms 1804 KB Output is correct
22 Correct 9 ms 1812 KB Output is correct
23 Correct 9 ms 1744 KB Output is correct
24 Correct 9 ms 1804 KB Output is correct
25 Correct 9 ms 1792 KB Output is correct
26 Correct 9 ms 1744 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 0 ms 208 KB Output is correct
29 Correct 0 ms 208 KB Output is correct
30 Correct 0 ms 208 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 0 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 201 ms 640 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 0 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 391 ms 1232 KB 2nd lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -