oj.uz

Submission #825007

# Submission time Handle Problem Language Result Execution time Memory
825007 2023-08-14T13:12:10 Z LittleCube Radio Towers (IOI22_towers) C++17
14 / 100
 769 ms 1872 KB 
#include "towers.h"
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

namespace
{
  int N;
  vector<int> H, s;
}

void init(int _N, vector<int> _H)
{
  H = _H;
  N = _N;
  s.resize(N);
  for (int i = 1; i + 1 < N; i++)
    s[i] = (H[i - 1] < H[i] && H[i] > H[i + 1]);
  for (int i = 1; i < N; i++)
    s[i] += s[i - 1];
}

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

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 354 ms 1192 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 576 ms 1840 KB Output is correct
2 Correct 520 ms 1736 KB Output is correct
3 Correct 558 ms 1828 KB Output is correct
4 Correct 613 ms 1736 KB Output is correct
5 Correct 676 ms 1832 KB Output is correct
6 Correct 411 ms 1740 KB Output is correct
7 Correct 665 ms 1828 KB Output is correct
8 Correct 681 ms 1816 KB Output is correct
9 Correct 577 ms 1744 KB Output is correct
10 Correct 577 ms 1872 KB Output is correct
11 Correct 691 ms 1844 KB Output is correct
12 Correct 570 ms 1820 KB Output is correct
13 Correct 769 ms 1836 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 10 ms 1872 KB Output is correct
18 Correct 10 ms 1848 KB Output is correct
19 Correct 13 ms 1872 KB Output is correct
20 Correct 9 ms 1804 KB Output is correct
21 Correct 9 ms 1852 KB Output is correct
22 Correct 10 ms 1872 KB Output is correct
23 Correct 9 ms 1832 KB Output is correct
24 Correct 9 ms 1864 KB Output is correct
25 Correct 10 ms 1828 KB Output is correct
26 Correct 15 ms 1820 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 1 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 0 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 0 ms 208 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 183 ms 660 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 354 ms 1192 KB 2nd lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -