Submission #667090

# Submission time Handle Problem Language Result Execution time Memory
667090 2022-11-30T11:21:45 Z tatyam Radio Towers (IOI22_towers) C++17
0 / 100
761 ms 1824 KB
#include <bits/stdc++.h>
using namespace std;


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

int max_towers(int L, int R, int D) {
    assert(D == 1);
    return S[R - 1] - S[L] + 1;
}
# Verdict Execution time Memory Grader output
1 Runtime error 12 ms 1764 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 464 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 464 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 629 ms 1736 KB Output is correct
2 Correct 469 ms 1820 KB Output is correct
3 Incorrect 761 ms 1824 KB 18409th lines differ - on the 1st token, expected: '1', found: '0'
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 4 ms 1104 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 464 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 12 ms 1764 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -