oj.uz

Submission #835113

# Submission time Handle Problem Language Result Execution time Memory
835113 2023-08-23T08:34:40 Z gagik_2007 Radio Towers (IOI22_towers) C++17
11 / 100
 4000 ms 2888 KB 
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define ff first
#define ss second

ll ttt;
const ll INF=1e18;
const ll MOD=1e9+7;
const ll N=5007;
ll n,m,k;
vector<int>a;

int recurs(int l, int r, int vl, int d){
    if(l>r)return 0;
    int mx=l,mn=l;
    for(int i=l;i<=r;i++){
        if(a[i]>a[mx])mx=i;
        if(a[i]<a[mn])mn=i;
    }
    if(a[mn]>vl-d)return 0;
    int lft=recurs(l,mx-1,a[mx],d);
    int rgh=recurs(mx+1,r,a[mx],d);
    // cout<<l<<" "<<r<<" "<<vl<<" "<<d<<": ";
    if(lft==0&&rgh==0){
        // cout<<1<<endl;
        return 1;
    }
    // cout<<lft+rgh<<endl;
    return lft+rgh;
}

void init(int NN, vector<int> H) {
    n=NN;
    a=H;
}

int max_towers(int L, int R, int D) {
    return recurs(L,R,2e9+7,D);
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4051 ms 2052 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 6 ms 336 KB Output is correct
24 Correct 5 ms 336 KB Output is correct
25 Correct 0 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 1 ms 208 KB Output is correct
30 Correct 1 ms 208 KB Output is correct
31 Correct 1 ms 296 KB Output is correct
32 Correct 5 ms 336 KB Output is correct
33 Correct 5 ms 336 KB Output is correct
34 Correct 2 ms 208 KB Output is correct
35 Correct 6 ms 336 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 6 ms 336 KB Output is correct
24 Correct 5 ms 336 KB Output is correct
25 Correct 0 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 1 ms 208 KB Output is correct
30 Correct 1 ms 208 KB Output is correct
31 Correct 1 ms 296 KB Output is correct
32 Correct 5 ms 336 KB Output is correct
33 Correct 5 ms 336 KB Output is correct
34 Correct 2 ms 208 KB Output is correct
35 Correct 6 ms 336 KB Output is correct
36 Correct 12 ms 936 KB Output is correct
37 Correct 12 ms 1464 KB Output is correct
38 Correct 11 ms 1436 KB Output is correct
39 Correct 12 ms 1360 KB Output is correct
40 Correct 11 ms 1456 KB Output is correct
41 Correct 21 ms 1360 KB Output is correct
42 Correct 11 ms 1436 KB Output is correct
43 Correct 3132 ms 2664 KB Output is correct
44 Correct 10 ms 1360 KB Output is correct
45 Correct 10 ms 1440 KB Output is correct
46 Correct 11 ms 1444 KB Output is correct
47 Correct 12 ms 1440 KB Output is correct
48 Correct 12 ms 1460 KB Output is correct
49 Correct 16 ms 1420 KB Output is correct
50 Correct 663 ms 2096 KB Output is correct
51 Correct 2138 ms 2888 KB Output is correct
52 Correct 23 ms 1352 KB Output is correct
53 Correct 22 ms 1436 KB Output is correct
54 Correct 16 ms 1488 KB Output is correct
55 Execution timed out 4067 ms 1784 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4086 ms 1444 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4058 ms 464 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 6 ms 336 KB Output is correct
24 Correct 5 ms 336 KB Output is correct
25 Correct 0 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 1 ms 208 KB Output is correct
30 Correct 1 ms 208 KB Output is correct
31 Correct 1 ms 296 KB Output is correct
32 Correct 5 ms 336 KB Output is correct
33 Correct 5 ms 336 KB Output is correct
34 Correct 2 ms 208 KB Output is correct
35 Correct 6 ms 336 KB Output is correct
36 Correct 12 ms 936 KB Output is correct
37 Correct 12 ms 1464 KB Output is correct
38 Correct 11 ms 1436 KB Output is correct
39 Correct 12 ms 1360 KB Output is correct
40 Correct 11 ms 1456 KB Output is correct
41 Correct 21 ms 1360 KB Output is correct
42 Correct 11 ms 1436 KB Output is correct
43 Correct 3132 ms 2664 KB Output is correct
44 Correct 10 ms 1360 KB Output is correct
45 Correct 10 ms 1440 KB Output is correct
46 Correct 11 ms 1444 KB Output is correct
47 Correct 12 ms 1440 KB Output is correct
48 Correct 12 ms 1460 KB Output is correct
49 Correct 16 ms 1420 KB Output is correct
50 Correct 663 ms 2096 KB Output is correct
51 Correct 2138 ms 2888 KB Output is correct
52 Correct 23 ms 1352 KB Output is correct
53 Correct 22 ms 1436 KB Output is correct
54 Correct 16 ms 1488 KB Output is correct
55 Execution timed out 4067 ms 1784 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4051 ms 2052 KB Time limit exceeded
2 Halted 0 ms 0 KB -