oj.uz

Submission #799952

# Submission time Handle Problem Language Result Execution time Memory
799952 2023-08-01T08:47:48 Z adrilen Radio Towers (IOI22_towers) C++17
14 / 100
 802 ms 1956 KB 
#include "towers.h"
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using arr = array<int, 2>;
using arrr = array<int, 3>;
constexpr int maxn = 1e5 + 5;
int n;

int pref[maxn] = { 0 };
int h[maxn] = { 0 };

void init(int N, std::vector<int> H) {
    n = N;

    for (int i = 0; i < n; i++) h[i] = H[i];

    if (n < 3) return ;

    if (H[0] < H[1]) pref[0] ++;
    for( int i = 1; i < n - 1;i++) pref[i] += (H[i - 1] > H[i] && H[i] < H[i + 1]);
    if (H[n - 1] < H[n - 2]) pref[n - 1]++;
    for (int i = 1; i < n; i++) pref[i] += pref[i - 1];


    // for (int i = 0; i < n; i++) cout << pref[i] << " ";
    // cout << "\n";
}

int max_towers(int L, int R, int D) {
    if (R - L < 2) return 1;

    int output = pref[R] - (L != 0 ? pref[L - 1] : 0);
    if (L != 0 && pref[L] == pref[L - 1]) output += (h[L] < h[L + 1]);

    if (R != n - 1 && pref[R] == pref[R - 1]) output += (h[R] < h[R - 1]);

    return output;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 341 ms 1180 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 496 ms 1856 KB Output is correct
2 Correct 769 ms 1864 KB Output is correct
3 Correct 680 ms 1860 KB Output is correct
4 Correct 643 ms 1832 KB Output is correct
5 Correct 694 ms 1744 KB Output is correct
6 Correct 799 ms 1736 KB Output is correct
7 Correct 564 ms 1856 KB Output is correct
8 Correct 726 ms 1840 KB Output is correct
9 Correct 547 ms 1872 KB Output is correct
10 Correct 802 ms 1852 KB Output is correct
11 Correct 746 ms 1872 KB Output is correct
12 Correct 755 ms 1824 KB Output is correct
13 Correct 667 ms 1832 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 336 KB Output is correct
17 Correct 12 ms 1956 KB Output is correct
18 Correct 16 ms 1852 KB Output is correct
19 Correct 13 ms 1836 KB Output is correct
20 Correct 16 ms 1836 KB Output is correct
21 Correct 10 ms 1840 KB Output is correct
22 Correct 12 ms 1844 KB Output is correct
23 Correct 9 ms 1828 KB Output is correct
24 Correct 9 ms 1844 KB Output is correct
25 Correct 10 ms 1852 KB Output is correct
26 Correct 13 ms 1848 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 208 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 0 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 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 209 ms 592 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 341 ms 1180 KB 2nd lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -