oj.uz

Submission #1035138

# Submission time Handle Problem Language Result Execution time Memory
1035138 2024-07-26T05:11:58 Z NeroZein Radio Towers (IOI22_towers) C++17
14 / 100
 667 ms 1964 KB 
#include "towers.h"
#include <bits/stdc++.h>
using namespace std; 

const int LOG = 18; 

int n;
int k;
vector<int> h;
vector<int> pref;

void init(int N_, vector<int> H_) {
  n = N_, h = H_;
  pref.resize(n - 1);
  for (int i = 1; i < n - 1; ++i) {
    pref[i] = (h[i - 1] < h[i]) && (h[i] > h[i + 1]);
  }
  for (int i = 1; i < n - 1; ++i) {
    pref[i] += pref[i - 1]; 
  }
}

int max_towers(int l, int r, int d) {
  if (l == r) {
    return 1; 
  }
  int ans = pref[r - 1] - pref[l] + 1;
  return ans;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 252 ms 1368 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 344 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 344 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 394 ms 1880 KB Output is correct
2 Correct 611 ms 1880 KB Output is correct
3 Correct 593 ms 1880 KB Output is correct
4 Correct 636 ms 1880 KB Output is correct
5 Correct 557 ms 1880 KB Output is correct
6 Correct 667 ms 1880 KB Output is correct
7 Correct 598 ms 1880 KB Output is correct
8 Correct 560 ms 1852 KB Output is correct
9 Correct 626 ms 1880 KB Output is correct
10 Correct 622 ms 1880 KB Output is correct
11 Correct 617 ms 1880 KB Output is correct
12 Correct 584 ms 1880 KB Output is correct
13 Correct 612 ms 1880 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 9 ms 1880 KB Output is correct
18 Correct 8 ms 1876 KB Output is correct
19 Correct 9 ms 1876 KB Output is correct
20 Correct 9 ms 1880 KB Output is correct
21 Correct 9 ms 1880 KB Output is correct
22 Correct 9 ms 1880 KB Output is correct
23 Correct 8 ms 1964 KB Output is correct
24 Correct 9 ms 1880 KB Output is correct
25 Correct 9 ms 1856 KB Output is correct
26 Correct 8 ms 1936 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 0 ms 344 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 153 ms 788 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 344 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 252 ms 1368 KB 2nd lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -