oj.uz

Submission #651462

# Submission time Handle Problem Language Result Execution time Memory
651462 2022-10-18T21:23:19 Z Lobo Radio Towers (IOI22_towers) C++17
23 / 100
 4000 ms 88588 KB 
#include "towers.h"
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fr first
#define sc second
#define pb push_back
#define all(x) x.begin(),x.end()

const int maxn = 1e5+10;
const int inf = 1e9+10;

int n, a[maxn], atvl[maxn], atvr[maxn], pf[maxn];
pair<int,int> trmn[4*maxn], trmx[4*maxn];
vector<vector<int>> atvs;

void att(int no, int l, int r, int pos, int val) {
    if(l > pos || r < pos) return;
    if(l == r) {
        trmn[no] = mp(val,pos);
        trmx[no] = mp(val,pos);
        return;
    }
    int f1=2*no,f2=2*no+1,mid=(l+r)/2;
    att(f1,l,mid,pos,val);
    att(f2,mid+1,r,pos,val);
    trmn[no] = min(trmn[f1],trmn[f2]);
    trmx[no] = max(trmx[f1],trmx[f2]);
}
pair<int,int> qrmn(int no, int l, int r, int L, int R) {
    if(l > R || r < L) return mp(inf,0);
    if(l >= L && r <= R) return trmn[no];
    int f1=2*no,f2=2*no+1,mid=(l+r)/2;
    return min(qrmn(f1,l,mid,L,R),qrmn(f2,mid+1,r,L,R));
}
pair<int,int> qrmx(int no, int l, int r, int L, int R) {
    if(l > R || r < L) return mp(-inf,0);
    if(l >= L && r <= R) return trmx[no];
    int f1=2*no,f2=2*no+1,mid=(l+r)/2;
    return max(qrmx(f1,l,mid,L,R),qrmx(f2,mid+1,r,L,R));
}

void init(int N, vector<int> H) {
    n = N;
    for(int i = 0; i < n; i++) {
        a[i] = H[i];
        att(1,0,n-1,i,a[i]);
    }
}

int sol(int l, int r, int d, int hant) {
    int i = qrmx(1,0,n-1,l,r).sc;
    int ans = 0;
    int ansl=0,ansr=0;
    if(i != l && qrmn(1,0,n-1,l,i-1).fr <= a[i]-d) {
        ansl = sol(l,i-1,d,a[i]);
        ans+= max(ansl,1);
        if(ansl == 0) {
            ansl = 1;
            // procuro do l ate o i-1 pelos que dao certo
            atvs.pb({});
            for(int j = l; j <= i-1; j++) {
                atvs.back().pb(j);
            }
        }
    }
    int szbf = atvs.size(); // se quiser acesar o primeiro de ansr da pra ver o atvs[szbf]
    if(i != r && qrmn(1,0,n-1,i+1,r).fr <= a[i]-d) {
        ansr = sol(i+1,r,d,a[i]);
        ans+= max(ansr,1);
        if(ansr == 0) {
            ansr = 1;
            // procuro do i+1 ate o r pelos que dao certo
            atvs.pb({});
            for(int j = i+1; j <= r; j++) {
                atvs.back().pb(j);
            }
        }
    }
    if(ansl != 0 && ansr == 0) {
        // eu posso pegar somente o i e nao pegar os caras em ansl
        // falo que da pra pegar o i colocando ele no ultimo de ansl
        if(a[i] <= hant-d) atvs.back().pb(i);
    }
    if(ansl == 0 && ansr != 0) {
        // falo que da pra pegar o i colocando ele no primeiro de ansr
        if(a[i] <= hant-d) atvs[szbf].pb(i); // coloca no final mas depois ajeita
    }

    // if(i != l && qrmn(1,0,n-1,l,i-1).fr <= a[i]-d) ans+= max(1,sol(l,i-1,d));
    // if(i != r && qrmn(1,0,n-1,i+1,r).fr <= a[i]-d) ans+= max(1,sol(i+1,r,d));
    // cout << l << " " << r << " " << d << " " << ans << endl;
    return ans;
}

bool calc = false;
int max_towers(int L, int R, int D) {
    for(int i = 0; i < n; i++) atvl[i] = 0;
    for(int i = 0; i < n; i++) atvr[i] = 0;
    sol(L,R,D,inf);
    int ans = 0;
    for(auto vc : atvs) {
        int ok = 0;
        for(auto x : vc) {
            if(L <= x && x <= R) ok = 1;
            // cout << x << " ";
        }
        // cout << endl;
        ans+= ok;
    }
    return max(1,ans);
    // pfl[0] = atvl[0];
    // pfr[0] = atvr[0];
    // for(int i = 1; i < n; i++) pfl[i] = pfl[i-1]+atvl[i];
    // for(int i = 1; i < n; i++) pfr[i] = pfr[i-1]+atvr[i];
    // return max(1,pf[R]-(L==0 ? 0 : pf[L-1]));
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4089 ms 33660 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 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 2 ms 464 KB Output is correct
21 Correct 2 ms 464 KB Output is correct
22 Correct 2 ms 464 KB Output is correct
23 Correct 2 ms 720 KB Output is correct
24 Correct 1 ms 592 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 2 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 1 ms 320 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 592 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 1 ms 592 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 2 ms 464 KB Output is correct
21 Correct 2 ms 464 KB Output is correct
22 Correct 2 ms 464 KB Output is correct
23 Correct 2 ms 720 KB Output is correct
24 Correct 1 ms 592 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 2 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 1 ms 320 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 592 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 1 ms 592 KB Output is correct
36 Correct 32 ms 3768 KB Output is correct
37 Correct 53 ms 6260 KB Output is correct
38 Correct 44 ms 6168 KB Output is correct
39 Correct 35 ms 6020 KB Output is correct
40 Correct 37 ms 6316 KB Output is correct
41 Correct 66 ms 7368 KB Output is correct
42 Correct 34 ms 5952 KB Output is correct
43 Correct 50 ms 10788 KB Output is correct
44 Correct 32 ms 5952 KB Output is correct
45 Correct 29 ms 5860 KB Output is correct
46 Correct 28 ms 5932 KB Output is correct
47 Correct 45 ms 6636 KB Output is correct
48 Correct 39 ms 6580 KB Output is correct
49 Correct 34 ms 6076 KB Output is correct
50 Correct 38 ms 9204 KB Output is correct
51 Correct 47 ms 11688 KB Output is correct
52 Correct 78 ms 8472 KB Output is correct
53 Correct 83 ms 8696 KB Output is correct
54 Correct 75 ms 8636 KB Output is correct
55 Correct 67 ms 20932 KB Output is correct
56 Correct 107 ms 19364 KB Output is correct
57 Correct 52 ms 6712 KB Output is correct
58 Correct 59 ms 7344 KB Output is correct
59 Correct 64 ms 7428 KB Output is correct
60 Correct 71 ms 8632 KB Output is correct
61 Correct 73 ms 8556 KB Output is correct
62 Correct 60 ms 7528 KB Output is correct
63 Correct 72 ms 8504 KB Output is correct
64 Correct 60 ms 13340 KB Output is correct
65 Correct 44 ms 12576 KB Output is correct
66 Correct 55 ms 11612 KB Output is correct
67 Correct 43 ms 12960 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4022 ms 88588 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 4096 ms 57892 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 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 2 ms 464 KB Output is correct
21 Correct 2 ms 464 KB Output is correct
22 Correct 2 ms 464 KB Output is correct
23 Correct 2 ms 720 KB Output is correct
24 Correct 1 ms 592 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 2 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 1 ms 320 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 592 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 1 ms 592 KB Output is correct
36 Correct 32 ms 3768 KB Output is correct
37 Correct 53 ms 6260 KB Output is correct
38 Correct 44 ms 6168 KB Output is correct
39 Correct 35 ms 6020 KB Output is correct
40 Correct 37 ms 6316 KB Output is correct
41 Correct 66 ms 7368 KB Output is correct
42 Correct 34 ms 5952 KB Output is correct
43 Correct 50 ms 10788 KB Output is correct
44 Correct 32 ms 5952 KB Output is correct
45 Correct 29 ms 5860 KB Output is correct
46 Correct 28 ms 5932 KB Output is correct
47 Correct 45 ms 6636 KB Output is correct
48 Correct 39 ms 6580 KB Output is correct
49 Correct 34 ms 6076 KB Output is correct
50 Correct 38 ms 9204 KB Output is correct
51 Correct 47 ms 11688 KB Output is correct
52 Correct 78 ms 8472 KB Output is correct
53 Correct 83 ms 8696 KB Output is correct
54 Correct 75 ms 8636 KB Output is correct
55 Correct 67 ms 20932 KB Output is correct
56 Correct 107 ms 19364 KB Output is correct
57 Correct 52 ms 6712 KB Output is correct
58 Correct 59 ms 7344 KB Output is correct
59 Correct 64 ms 7428 KB Output is correct
60 Correct 71 ms 8632 KB Output is correct
61 Correct 73 ms 8556 KB Output is correct
62 Correct 60 ms 7528 KB Output is correct
63 Correct 72 ms 8504 KB Output is correct
64 Correct 60 ms 13340 KB Output is correct
65 Correct 44 ms 12576 KB Output is correct
66 Correct 55 ms 11612 KB Output is correct
67 Correct 43 ms 12960 KB Output is correct
68 Execution timed out 4022 ms 88588 KB Time limit exceeded
69 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

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