oj.uz

Submission #788597

# Submission time Handle Problem Language Result Execution time Memory
788597 2023-07-20T11:49:28 Z mosiashvililuka Radio Towers (IOI22_towers) C++17
14 / 100
 758 ms 2256 KB 
#include<bits/stdc++.h>
#include "towers.h"
using namespace std;
int a,b,c,d,e,i,j,ii,jj,zx,xc,f[100009],K,pas,L,R,D,pr[100009],bo[100009];
void init(int NN, std::vector<int> HH) {
    a=NN;
    for(i=1; i<=a; i++){
        f[i]=HH[i-1];
    }

    for(i=1; i<=a; i++){
        e=0;
        if(i!=1&&f[i-1]<f[i]) e++;
        if(i!=a&&f[i+1]<f[i]) e++;
        if(e==0){
            pr[i]++;
            bo[i]=1;
        }
    }
    for(i=1; i<=a; i++){
        pr[i]+=pr[i-1];
        //cout<<i<<" "<<pr[i]<<"\n";
    }
}

int max_towers(int LL, int RR, int DD) {
    pas=1;LL++;RR++;
    L=LL;R=RR;D=DD;

    if(L==R) return 1;
    zx=pr[R]-pr[L-1];

    zx-=bo[L];
    if(f[L+1]>f[L]) zx++;
    zx-=bo[R];
    if(f[R-1]>f[R]) zx++;
    pas=zx;
    return pas;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 320 ms 1232 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 601 ms 2128 KB Output is correct
2 Correct 623 ms 2220 KB Output is correct
3 Correct 656 ms 2256 KB Output is correct
4 Correct 758 ms 2120 KB Output is correct
5 Correct 614 ms 2240 KB Output is correct
6 Correct 735 ms 2256 KB Output is correct
7 Correct 495 ms 2236 KB Output is correct
8 Correct 725 ms 1744 KB Output is correct
9 Correct 649 ms 1896 KB Output is correct
10 Correct 647 ms 1872 KB Output is correct
11 Correct 713 ms 1868 KB Output is correct
12 Correct 689 ms 1824 KB Output is correct
13 Correct 538 ms 1736 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 11 ms 2208 KB Output is correct
18 Correct 10 ms 2220 KB Output is correct
19 Correct 10 ms 2212 KB Output is correct
20 Correct 10 ms 1844 KB Output is correct
21 Correct 16 ms 1828 KB Output is correct
22 Correct 10 ms 2236 KB Output is correct
23 Correct 11 ms 2128 KB Output is correct
24 Correct 10 ms 2212 KB Output is correct
25 Correct 10 ms 1828 KB Output is correct
26 Correct 10 ms 1872 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 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct

Subtask #5
0 / 17.0

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