oj.uz

답안 #651427

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
651427 2022-10-18T18:06:32 Z Lobo 송신탑 (IOI22_towers) C++17
23 / 100
 4000 ms 11436 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], atv[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]);
    }
}

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) {
            atv[qrmn(1,0,n-1,l,i-1).sc] = 1;
        }
    }
    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) {
            atv[qrmn(1,0,n-1,i+1,r).sc] = 1;
        }
    }
    // 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;
}

int max_towers(int L, int R, int D) {
    return max(1,sol(L,R,D));
}

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4042 ms 6072 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 2 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 2 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 2 ms 336 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 2 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 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 336 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 2 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 1 ms 336 KB Output is correct
27 Correct 2 ms 336 KB Output is correct
28 Correct 3 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 2 ms 336 KB Output is correct
32 Correct 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 2 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 2 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 2 ms 336 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 2 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 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 336 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 2 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 1 ms 336 KB Output is correct
27 Correct 2 ms 336 KB Output is correct
28 Correct 3 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 2 ms 336 KB Output is correct
32 Correct 1 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 31 ms 3116 KB Output is correct
37 Correct 44 ms 5548 KB Output is correct
38 Correct 38 ms 5456 KB Output is correct
39 Correct 44 ms 5556 KB Output is correct
40 Correct 57 ms 5588 KB Output is correct
41 Correct 64 ms 5472 KB Output is correct
42 Correct 33 ms 5564 KB Output is correct
43 Correct 46 ms 7192 KB Output is correct
44 Correct 32 ms 5540 KB Output is correct
45 Correct 45 ms 5556 KB Output is correct
46 Correct 29 ms 5540 KB Output is correct
47 Correct 47 ms 5532 KB Output is correct
48 Correct 40 ms 5544 KB Output is correct
49 Correct 45 ms 5520 KB Output is correct
50 Correct 50 ms 6548 KB Output is correct
51 Correct 66 ms 7628 KB Output is correct
52 Correct 75 ms 5560 KB Output is correct
53 Correct 72 ms 5556 KB Output is correct
54 Correct 76 ms 5576 KB Output is correct
55 Correct 73 ms 11436 KB Output is correct
56 Correct 71 ms 10780 KB Output is correct
57 Correct 52 ms 5528 KB Output is correct
58 Correct 65 ms 5644 KB Output is correct
59 Correct 85 ms 5576 KB Output is correct
60 Correct 76 ms 5496 KB Output is correct
61 Correct 78 ms 5548 KB Output is correct
62 Correct 66 ms 5596 KB Output is correct
63 Correct 76 ms 5576 KB Output is correct
64 Correct 51 ms 8208 KB Output is correct
65 Correct 40 ms 7896 KB Output is correct
66 Correct 50 ms 7472 KB Output is correct
67 Correct 45 ms 8000 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4003 ms 5596 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4008 ms 1616 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 2 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 2 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 2 ms 336 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 2 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 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 336 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 2 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 1 ms 336 KB Output is correct
27 Correct 2 ms 336 KB Output is correct
28 Correct 3 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 2 ms 336 KB Output is correct
32 Correct 1 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 31 ms 3116 KB Output is correct
37 Correct 44 ms 5548 KB Output is correct
38 Correct 38 ms 5456 KB Output is correct
39 Correct 44 ms 5556 KB Output is correct
40 Correct 57 ms 5588 KB Output is correct
41 Correct 64 ms 5472 KB Output is correct
42 Correct 33 ms 5564 KB Output is correct
43 Correct 46 ms 7192 KB Output is correct
44 Correct 32 ms 5540 KB Output is correct
45 Correct 45 ms 5556 KB Output is correct
46 Correct 29 ms 5540 KB Output is correct
47 Correct 47 ms 5532 KB Output is correct
48 Correct 40 ms 5544 KB Output is correct
49 Correct 45 ms 5520 KB Output is correct
50 Correct 50 ms 6548 KB Output is correct
51 Correct 66 ms 7628 KB Output is correct
52 Correct 75 ms 5560 KB Output is correct
53 Correct 72 ms 5556 KB Output is correct
54 Correct 76 ms 5576 KB Output is correct
55 Correct 73 ms 11436 KB Output is correct
56 Correct 71 ms 10780 KB Output is correct
57 Correct 52 ms 5528 KB Output is correct
58 Correct 65 ms 5644 KB Output is correct
59 Correct 85 ms 5576 KB Output is correct
60 Correct 76 ms 5496 KB Output is correct
61 Correct 78 ms 5548 KB Output is correct
62 Correct 66 ms 5596 KB Output is correct
63 Correct 76 ms 5576 KB Output is correct
64 Correct 51 ms 8208 KB Output is correct
65 Correct 40 ms 7896 KB Output is correct
66 Correct 50 ms 7472 KB Output is correct
67 Correct 45 ms 8000 KB Output is correct
68 Execution timed out 4003 ms 5596 KB Time limit exceeded
69 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4042 ms 6072 KB Time limit exceeded
2 Halted 0 ms 0 KB -