oj.uz

Submission #651439

# Submission time Handle Problem Language Result Execution time Memory
651439 2022-10-18T18:25:22 Z Lobo Radio Towers (IOI22_towers) C++17
23 / 100
 4000 ms 13728 KB 
#include "towers.h"
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fr first
#define sc second

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];

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]);
    }
}

// binary search left, find the more to the left <= x
int bsl(int l, int r, int x) {
    int ans;
    while(l <= r) {
        int mid = (l+r)/2;
        if(qrmn(1,0,n-1,l,mid).fr <= x) {
            ans = mid;
            r = mid-1;
        }
        else {
            l = mid+1;
        }
    }
    return ans;
}
int bsr(int l, int r, int x) {
    int ans;
    while(l <= r) {
        int mid = (l+r)/2;
        if(qrmn(1,0,n-1,mid,r).fr <= x) {
            ans = mid;
            l = mid+1;
        }
        else {
            r = mid-1;
        }
    }
    return ans;
}

int sol(int l, int r, int d) {
    int i = qrmx(1,0,n-1,l,r).sc;
    int ans = 0;
    if(i != l && qrmn(1,0,n-1,l,i-1).fr <= a[i]-d) {
        int ansl = sol(l,i-1,d);
        ans+= max(ansl,1);
        if(ansl == 0) {
            for(int j = l; j <= i-1; j++) {
                if(a[j] <= a[i]-d) {
                    atvl[j] = 1;
                    break;
                }
            }
            for(int j = i-1; j >= l; j--) {
                if(a[j] <= a[i]-d) {
                    atvr[j] = 1;
                    break;
                }
            }
        }

        // more to the left and to the right that is <= a[i]-d
    }
    if(i != r && qrmn(1,0,n-1,i+1,r).fr <= a[i]-d) {
        int ansr = sol(i+1,r,d);
        ans+= max(ansr,1);
        if(ansr == 0) {
            for(int j = i+1; j <= r; j++) {
                if(a[j] <= a[i]-d) {
                    atvl[j] = 1;
                    break;
                }
            }
            for(int j = r; j >= i+1; j--) {
                if(a[j] <= a[i]-d) {
                    atvr[j] = 1;
                    break;
                }
            }
        }
    }
    // 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;
    sol(L,R,D);
    pf[0] = atvl[0];
    for(int i = 1; i < n; i++) pf[i] = pf[i-1]+atvl[i];
    return max(1,pf[R]-(L==0 ? 0 : pf[L-1]));
}

Compilation message

towers.cpp: In function 'int bsl(int, int, int)':
towers.cpp:61:12: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   61 |     return ans;
      |            ^~~
towers.cpp: In function 'int bsr(int, int, int)':
towers.cpp:75:12: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   75 |     return ans;
      |            ^~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4083 ms 7360 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 312 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 1 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 348 KB Output is correct
12 Correct 0 ms 220 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 2 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 2 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 2 ms 364 KB Output is correct
29 Correct 2 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 2 ms 464 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 2 ms 464 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 312 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 1 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 348 KB Output is correct
12 Correct 0 ms 220 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 2 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 2 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 2 ms 364 KB Output is correct
29 Correct 2 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 2 ms 464 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 2 ms 464 KB Output is correct
36 Correct 27 ms 3380 KB Output is correct
37 Correct 36 ms 6108 KB Output is correct
38 Correct 47 ms 6052 KB Output is correct
39 Correct 33 ms 6072 KB Output is correct
40 Correct 34 ms 5952 KB Output is correct
41 Correct 60 ms 6312 KB Output is correct
42 Correct 32 ms 5944 KB Output is correct
43 Correct 45 ms 8500 KB Output is correct
44 Correct 28 ms 5920 KB Output is correct
45 Correct 32 ms 5916 KB Output is correct
46 Correct 35 ms 5880 KB Output is correct
47 Correct 45 ms 6064 KB Output is correct
48 Correct 38 ms 5988 KB Output is correct
49 Correct 41 ms 5952 KB Output is correct
50 Correct 40 ms 7604 KB Output is correct
51 Correct 47 ms 9024 KB Output is correct
52 Correct 73 ms 6272 KB Output is correct
53 Correct 66 ms 6308 KB Output is correct
54 Correct 65 ms 6304 KB Output is correct
55 Correct 62 ms 13728 KB Output is correct
56 Correct 72 ms 13064 KB Output is correct
57 Correct 47 ms 6224 KB Output is correct
58 Correct 55 ms 6252 KB Output is correct
59 Correct 65 ms 6320 KB Output is correct
60 Correct 68 ms 6336 KB Output is correct
61 Correct 62 ms 6348 KB Output is correct
62 Correct 59 ms 6328 KB Output is correct
63 Correct 67 ms 6296 KB Output is correct
64 Correct 43 ms 9784 KB Output is correct
65 Correct 42 ms 9368 KB Output is correct
66 Correct 44 ms 8928 KB Output is correct
67 Correct 46 ms 9548 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4014 ms 6368 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 4099 ms 1872 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 312 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 1 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 348 KB Output is correct
12 Correct 0 ms 220 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 2 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 2 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 2 ms 364 KB Output is correct
29 Correct 2 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 2 ms 464 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 2 ms 464 KB Output is correct
36 Correct 27 ms 3380 KB Output is correct
37 Correct 36 ms 6108 KB Output is correct
38 Correct 47 ms 6052 KB Output is correct
39 Correct 33 ms 6072 KB Output is correct
40 Correct 34 ms 5952 KB Output is correct
41 Correct 60 ms 6312 KB Output is correct
42 Correct 32 ms 5944 KB Output is correct
43 Correct 45 ms 8500 KB Output is correct
44 Correct 28 ms 5920 KB Output is correct
45 Correct 32 ms 5916 KB Output is correct
46 Correct 35 ms 5880 KB Output is correct
47 Correct 45 ms 6064 KB Output is correct
48 Correct 38 ms 5988 KB Output is correct
49 Correct 41 ms 5952 KB Output is correct
50 Correct 40 ms 7604 KB Output is correct
51 Correct 47 ms 9024 KB Output is correct
52 Correct 73 ms 6272 KB Output is correct
53 Correct 66 ms 6308 KB Output is correct
54 Correct 65 ms 6304 KB Output is correct
55 Correct 62 ms 13728 KB Output is correct
56 Correct 72 ms 13064 KB Output is correct
57 Correct 47 ms 6224 KB Output is correct
58 Correct 55 ms 6252 KB Output is correct
59 Correct 65 ms 6320 KB Output is correct
60 Correct 68 ms 6336 KB Output is correct
61 Correct 62 ms 6348 KB Output is correct
62 Correct 59 ms 6328 KB Output is correct
63 Correct 67 ms 6296 KB Output is correct
64 Correct 43 ms 9784 KB Output is correct
65 Correct 42 ms 9368 KB Output is correct
66 Correct 44 ms 8928 KB Output is correct
67 Correct 46 ms 9548 KB Output is correct
68 Execution timed out 4014 ms 6368 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 4083 ms 7360 KB Time limit exceeded
2 Halted 0 ms 0 KB -