oj.uz

Submission #1062879

# Submission time Handle Problem Language Result Execution time Memory
1062879 2024-08-17T11:30:23 Z MarwenElarbi Radio Towers (IOI22_towers) C++17
14 / 100
 683 ms 2252 KB 
#include <bits/stdc++.h>
using namespace std;
#include "towers.h"
#define pb push_back
#define ll long long
#define fi first
#define se second
const int nax=1e5+5;
int n;
vector<int> tab;
int pre[nax];
void init(int N, std::vector<int> H) {
  n=N;
  for (int i = 0; i < N; ++i)
  {
    tab.pb(H[i]);
  }
  for (int i = 1; i < n-1; ++i)
  {
    if(tab[i]<=tab[i-1]&&tab[i]<=tab[i+1]) pre[i]=1;
    pre[i]+=pre[i-1];
  }
  pre[n-1]+=pre[n-2];
}

int max_towers(int L, int R, int D){
  if(R-L+1<=2) return 1;
  return pre[R-1]-pre[L]+(tab[L]<=tab[L+1])+(tab[R]<=tab[R-1]);
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 238 ms 1312 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 348 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 348 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 406 ms 2000 KB Output is correct
2 Correct 623 ms 2000 KB Output is correct
3 Correct 683 ms 2000 KB Output is correct
4 Correct 631 ms 2088 KB Output is correct
5 Correct 596 ms 2000 KB Output is correct
6 Correct 582 ms 2000 KB Output is correct
7 Correct 606 ms 1996 KB Output is correct
8 Correct 627 ms 2000 KB Output is correct
9 Correct 637 ms 2000 KB Output is correct
10 Correct 633 ms 2000 KB Output is correct
11 Correct 535 ms 2000 KB Output is correct
12 Correct 618 ms 2000 KB Output is correct
13 Correct 640 ms 2000 KB Output is correct
14 Correct 1 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 11 ms 2084 KB Output is correct
18 Correct 9 ms 2000 KB Output is correct
19 Correct 9 ms 2092 KB Output is correct
20 Correct 16 ms 2252 KB Output is correct
21 Correct 10 ms 2000 KB Output is correct
22 Correct 9 ms 1988 KB Output is correct
23 Correct 9 ms 1996 KB Output is correct
24 Correct 9 ms 1996 KB Output is correct
25 Correct 10 ms 2000 KB Output is correct
26 Correct 11 ms 1980 KB Output is correct
27 Correct 0 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 1 ms 344 KB Output is correct
32 Correct 0 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 188 ms 856 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 348 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 238 ms 1312 KB 2nd lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -