oj.uz

Submission #764224

# Submission time Handle Problem Language Result Execution time Memory
764224 2023-06-23T08:54:32 Z raysh07 Radio Towers (IOI22_towers) C++17
14 / 100
 828 ms 1872 KB 
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;

const int maxn = 1e5 + 69;
int a[maxn], p[maxn];
int n;
 
void init(int N, vector<int> H) {
    n = N;
    for (int i = 0; i < N; i++){
        a[i + 1] = H[i];
    }
    
    for (int i = 2; i < n; i++){
        p[i] = (a[i] < a[i - 1]) && (a[i] < a[i + 1]);
    }
    
    for (int i = 1; i <= n; i++) p[i] += p[i - 1];
}
 
int max_towers(int l, int r, int D) {
    l++;
    r++;
    if (D != 1) return 0;
    
    if (l == r) return 1;
    
    int ans = p[r - 1] - p[l];
    if (a[l] < a[l + 1]) ans++;
    if (a[r] < a[r - 1]) ans++;
    return ans;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 359 ms 1232 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 537 ms 1744 KB Output is correct
2 Correct 777 ms 1840 KB Output is correct
3 Correct 726 ms 1872 KB Output is correct
4 Correct 775 ms 1820 KB Output is correct
5 Correct 773 ms 1832 KB Output is correct
6 Correct 828 ms 1832 KB Output is correct
7 Correct 796 ms 1872 KB Output is correct
8 Correct 498 ms 1848 KB Output is correct
9 Correct 807 ms 1840 KB Output is correct
10 Correct 614 ms 1872 KB Output is correct
11 Correct 622 ms 1840 KB Output is correct
12 Correct 474 ms 1836 KB Output is correct
13 Correct 579 ms 1856 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 17 ms 1852 KB Output is correct
18 Correct 9 ms 1872 KB Output is correct
19 Correct 10 ms 1872 KB Output is correct
20 Correct 10 ms 1860 KB Output is correct
21 Correct 9 ms 1860 KB Output is correct
22 Correct 17 ms 1836 KB Output is correct
23 Correct 10 ms 1872 KB Output is correct
24 Correct 10 ms 1840 KB Output is correct
25 Correct 9 ms 1832 KB Output is correct
26 Correct 9 ms 1836 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 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 0 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 0 ms 336 KB Output is correct

Subtask #5
0 / 17.0

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