답안 #626088

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
626088	2022-08-11T08:11:20 Z	nigus	송신탑 (IOI22_towers)	C++17	44 / 100	4000 ms	45616 KB

towers

#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;

const ll big = 1000000007;
const int MAXN = 100001;
int n;
vi H2;

struct Segtree {
	Segtree *l = 0, *r = 0;
	int lo, hi, ma = -big, mi = big, ab = 0, ba = 0;
    vi V;
	Segtree(vi& v, int lo, int hi) : lo(lo), hi(hi) {
		if (lo + 1 < hi) {
			int mid = lo + (hi - lo)/2;
			l = new Segtree(v, lo, mid); r = new Segtree(v, mid, hi);
			ma = max(l->ma, r->ma);
            mi = min(l->mi, r->mi);
            ab = max(l->ab, r->ab);
            ab = max(ab, (r->ma) - (l->mi));
            ba = max(l->ba, r->ba);
            ba = max(ba, (l->ma) - (r->mi));
		}
		else{
            ma = v[lo];
            mi = v[lo];
        }
	}
    void setup(vi &v){
        if(lo + 1 < hi){
            l->setup(v);
            r->setup(v);
            V = (l->V);
            trav(y, r->V){
                V.push_back(y);
            }
            sort(all(V));
            reverse(all(V));
        }
        else{
            V = {v[lo]};
        }
    }
	int get_max(int L, int R) {
		if (R <= lo || hi <= L) return -big;
		if (L <= lo && hi <= R) return ma;
		return max(l->get_max(L, R), r->get_max(L, R));
	}
    int get_min(int L, int R) {
		if (R <= lo || hi <= L) return big;
		if (L <= lo && hi <= R) return mi;
		return min(l->get_min(L, R), r->get_min(L, R));
	}
    int get_ab(int L, int R){
        if (R <= lo || hi <= L) return 0;
		if (L <= lo && hi <= R) return ab;

        int res = (l->get_ab(L, R));
        if(res < r->ab){
            res = max(res, r->get_ab(L, R));
        }
        if(res < (r->ma) - (l->mi)){
            int x = l->get_min(L,R);
            int y = r->get_max(L,R);
            res = max(res, y-x);
        }

        return res;
    }
    int get_ba(int L, int R){
        if (R <= lo || hi <= L) return 0;
		if (L <= lo && hi <= R) return ba;
        int res = max(l->get_ba(L, R), r->get_ba(L, R));
        int x = r->get_min(L,R);
        int y = l->get_max(L,R);
        return max(res,y-x);
    }
    int geq(int L, int R, int D){
        if (R <= lo || hi <= L) return 0;
        if (L <= lo && hi <= R){
            int lo = 0;
            int hi = sz(V);
            if(V[0] < D)return 0;
            while(lo < hi-1){
                int mid = (lo + hi) / 2;
                if(V[mid] < D){
                    hi = mid;
                }
                else{
                    lo = mid;
                }
            }
            return hi;
        }
        return (l->geq(L, R, D)) + (r->geq(L, R, D));
    }
};

Segtree *ST;

map<int,int> HI;

vi delta;

vi ind;

void get_ct(int L, int R){
    if(L >= R)return;
    if(L == R-1){
        delta[L] = 0;
        return;
    }
    int i = HI[ST->get_max(L, R)];
    int x = ST->get_min(L,i);
    int y = ST->get_min(i+1,R);
    delta[i] = H2[i]-max(x, y);
    delta[i] = max(delta[i], 0);
    get_ct(L, i);
    get_ct(i+1,R);
}

bool comp(int i, int j){
    return delta[i] > delta[j];
}

void init(int N, vi H){
    n = N;
    rep(c1,0,n){
        H2.push_back(H[c1]);
        HI[H[c1]] = c1;
        ind.push_back(c1);
        delta.push_back(0);
    }
    ST = new Segtree(H2, 0, n);
    get_ct(0, n);
    sort(all(ind), comp);
    ST->setup(delta);
}

int first_ab(int L, int R, int D){
    int lo = L;
    int hi = R;
    while(lo < hi-1){
        int mid = (lo+hi)/2;
        if(ST->get_ab(L, mid+1) < D){
            lo = mid;
        }
        else{
            hi = mid;
        }
    }
    return hi;
}

int last_ba(int L, int R, int D){
    int lo = L;
    int hi = R;
    while(lo < hi-1){
        int mid = (lo+hi)/2;
        if(ST->get_ba(mid, R) >= D){
            lo = mid;
        }
        else{
            hi = mid;
        }
    }
    return lo;
}

int max_towers(int L, int R, int D){
    R++;

    if(ST->get_ab(L, R) < D || ST->get_ba(L, R) < D)return 1;
    int i = first_ab(L, R, D);
    int j = last_ba(L, R, D)+1;
    return (ST->geq(i,j,D))+1;
}


/*
int main() {

    int N;
    N = 7;
    vi H = {1,4,2,9,3,6,5};
    init(N,H);

    cout << max_towers(0, 7, 1) << "\n";
    cout << max_towers(0, 7, 2) << "\n";
    cout << max_towers(0, 7, 3) << "\n";
    cout << max_towers(0, 7, 10) << "\n";


    return 0;
}
*/

Subtask #1
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1002 ms	26000 KB	Output is correct
2	Correct	1774 ms	45164 KB	Output is correct
3	Correct	1497 ms	45336 KB	Output is correct
4	Correct	1472 ms	45576 KB	Output is correct
5	Correct	878 ms	36244 KB	Output is correct
6	Correct	1824 ms	45552 KB	Output is correct
7	Correct	802 ms	36144 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	2 ms	976 KB	Output is correct
10	Correct	2 ms	848 KB	Output is correct

Subtask #2
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	2 ms	848 KB	Output is correct
3	Correct	3 ms	848 KB	Output is correct
4	Correct	3 ms	848 KB	Output is correct
5	Correct	4 ms	848 KB	Output is correct
6	Correct	3 ms	848 KB	Output is correct
7	Correct	2 ms	848 KB	Output is correct
8	Correct	3 ms	1104 KB	Output is correct
9	Correct	2 ms	872 KB	Output is correct
10	Correct	2 ms	976 KB	Output is correct
11	Correct	2 ms	848 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	2 ms	976 KB	Output is correct
14	Correct	2 ms	848 KB	Output is correct
15	Correct	2 ms	848 KB	Output is correct
16	Correct	3 ms	848 KB	Output is correct
17	Correct	2 ms	848 KB	Output is correct
18	Correct	2 ms	848 KB	Output is correct
19	Correct	2 ms	976 KB	Output is correct
20	Correct	4 ms	848 KB	Output is correct
21	Correct	3 ms	848 KB	Output is correct
22	Correct	2 ms	848 KB	Output is correct
23	Correct	2 ms	848 KB	Output is correct
24	Correct	2 ms	976 KB	Output is correct
25	Correct	1 ms	464 KB	Output is correct
26	Correct	2 ms	848 KB	Output is correct
27	Correct	2 ms	848 KB	Output is correct
28	Correct	2 ms	848 KB	Output is correct
29	Correct	2 ms	848 KB	Output is correct
30	Correct	2 ms	848 KB	Output is correct
31	Correct	2 ms	848 KB	Output is correct
32	Correct	3 ms	1104 KB	Output is correct
33	Correct	2 ms	848 KB	Output is correct
34	Correct	3 ms	976 KB	Output is correct
35	Correct	2 ms	848 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	848 KB	Output is correct
3	Correct	3 ms	848 KB	Output is correct
4	Correct	3 ms	848 KB	Output is correct
5	Correct	4 ms	848 KB	Output is correct
6	Correct	3 ms	848 KB	Output is correct
7	Correct	2 ms	848 KB	Output is correct
8	Correct	3 ms	1104 KB	Output is correct
9	Correct	2 ms	872 KB	Output is correct
10	Correct	2 ms	976 KB	Output is correct
11	Correct	2 ms	848 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	2 ms	976 KB	Output is correct
14	Correct	2 ms	848 KB	Output is correct
15	Correct	2 ms	848 KB	Output is correct
16	Correct	3 ms	848 KB	Output is correct
17	Correct	2 ms	848 KB	Output is correct
18	Correct	2 ms	848 KB	Output is correct
19	Correct	2 ms	976 KB	Output is correct
20	Correct	4 ms	848 KB	Output is correct
21	Correct	3 ms	848 KB	Output is correct
22	Correct	2 ms	848 KB	Output is correct
23	Correct	2 ms	848 KB	Output is correct
24	Correct	2 ms	976 KB	Output is correct
25	Correct	1 ms	464 KB	Output is correct
26	Correct	2 ms	848 KB	Output is correct
27	Correct	2 ms	848 KB	Output is correct
28	Correct	2 ms	848 KB	Output is correct
29	Correct	2 ms	848 KB	Output is correct
30	Correct	2 ms	848 KB	Output is correct
31	Correct	2 ms	848 KB	Output is correct
32	Correct	3 ms	1104 KB	Output is correct
33	Correct	2 ms	848 KB	Output is correct
34	Correct	3 ms	976 KB	Output is correct
35	Correct	2 ms	848 KB	Output is correct
36	Correct	91 ms	23308 KB	Output is correct
37	Correct	148 ms	36144 KB	Output is correct
38	Correct	170 ms	36320 KB	Output is correct
39	Correct	186 ms	36256 KB	Output is correct
40	Correct	155 ms	36144 KB	Output is correct
41	Correct	161 ms	36172 KB	Output is correct
42	Correct	159 ms	36236 KB	Output is correct
43	Correct	111 ms	45616 KB	Output is correct
44	Correct	112 ms	36228 KB	Output is correct
45	Correct	123 ms	42968 KB	Output is correct
46	Correct	108 ms	36276 KB	Output is correct
47	Correct	150 ms	36252 KB	Output is correct
48	Correct	155 ms	36228 KB	Output is correct
49	Correct	161 ms	36332 KB	Output is correct
50	Correct	133 ms	36248 KB	Output is correct
51	Correct	110 ms	45444 KB	Output is correct
52	Correct	142 ms	36240 KB	Output is correct
53	Correct	172 ms	36204 KB	Output is correct
54	Correct	167 ms	36248 KB	Output is correct
55	Correct	110 ms	36228 KB	Output is correct
56	Correct	120 ms	44984 KB	Output is correct
57	Correct	156 ms	35004 KB	Output is correct
58	Correct	157 ms	36176 KB	Output is correct
59	Correct	149 ms	36252 KB	Output is correct
60	Correct	185 ms	36252 KB	Output is correct
61	Correct	185 ms	36168 KB	Output is correct
62	Correct	167 ms	36216 KB	Output is correct
63	Correct	160 ms	36228 KB	Output is correct
64	Correct	120 ms	45616 KB	Output is correct
65	Correct	108 ms	36184 KB	Output is correct
66	Correct	128 ms	41860 KB	Output is correct
67	Correct	109 ms	36180 KB	Output is correct

Subtask #4
0 / 14.0

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

Subtask #5
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	641 ms	8812 KB	Output is correct
2	Correct	3137 ms	36368 KB	Output is correct
3	Correct	2928 ms	36200 KB	Output is correct
4	Correct	2791 ms	36308 KB	Output is correct
5	Correct	2768 ms	36312 KB	Output is correct
6	Correct	3307 ms	36356 KB	Output is correct
7	Correct	2702 ms	36168 KB	Output is correct
8	Correct	910 ms	45528 KB	Output is correct
9	Correct	812 ms	36144 KB	Output is correct
10	Correct	2073 ms	41824 KB	Output is correct
11	Correct	2093 ms	36236 KB	Output is correct
12	Correct	148 ms	36264 KB	Output is correct
13	Correct	163 ms	36216 KB	Output is correct
14	Correct	163 ms	36152 KB	Output is correct
15	Correct	108 ms	36320 KB	Output is correct
16	Correct	123 ms	44732 KB	Output is correct
17	Correct	144 ms	34960 KB	Output is correct
18	Correct	157 ms	36240 KB	Output is correct
19	Correct	153 ms	36272 KB	Output is correct
20	Correct	163 ms	36188 KB	Output is correct
21	Correct	166 ms	36204 KB	Output is correct
22	Correct	159 ms	36180 KB	Output is correct
23	Correct	168 ms	36216 KB	Output is correct
24	Correct	110 ms	45572 KB	Output is correct
25	Correct	106 ms	36220 KB	Output is correct
26	Correct	124 ms	41880 KB	Output is correct
27	Correct	105 ms	36256 KB	Output is correct
28	Correct	2 ms	848 KB	Output is correct
29	Correct	3 ms	848 KB	Output is correct
30	Correct	3 ms	848 KB	Output is correct
31	Correct	2 ms	848 KB	Output is correct
32	Correct	2 ms	1104 KB	Output is correct
33	Correct	2 ms	464 KB	Output is correct
34	Correct	3 ms	848 KB	Output is correct
35	Correct	2 ms	848 KB	Output is correct
36	Correct	2 ms	848 KB	Output is correct
37	Correct	3 ms	848 KB	Output is correct
38	Correct	2 ms	848 KB	Output is correct
39	Correct	3 ms	848 KB	Output is correct
40	Correct	2 ms	1104 KB	Output is correct
41	Correct	3 ms	848 KB	Output is correct
42	Correct	2 ms	976 KB	Output is correct
43	Correct	2 ms	848 KB	Output is correct

Subtask #6
0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	2 ms	848 KB	Output is correct
3	Correct	3 ms	848 KB	Output is correct
4	Correct	3 ms	848 KB	Output is correct
5	Correct	4 ms	848 KB	Output is correct
6	Correct	3 ms	848 KB	Output is correct
7	Correct	2 ms	848 KB	Output is correct
8	Correct	3 ms	1104 KB	Output is correct
9	Correct	2 ms	872 KB	Output is correct
10	Correct	2 ms	976 KB	Output is correct
11	Correct	2 ms	848 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	2 ms	976 KB	Output is correct
14	Correct	2 ms	848 KB	Output is correct
15	Correct	2 ms	848 KB	Output is correct
16	Correct	3 ms	848 KB	Output is correct
17	Correct	2 ms	848 KB	Output is correct
18	Correct	2 ms	848 KB	Output is correct
19	Correct	2 ms	976 KB	Output is correct
20	Correct	4 ms	848 KB	Output is correct
21	Correct	3 ms	848 KB	Output is correct
22	Correct	2 ms	848 KB	Output is correct
23	Correct	2 ms	848 KB	Output is correct
24	Correct	2 ms	976 KB	Output is correct
25	Correct	1 ms	464 KB	Output is correct
26	Correct	2 ms	848 KB	Output is correct
27	Correct	2 ms	848 KB	Output is correct
28	Correct	2 ms	848 KB	Output is correct
29	Correct	2 ms	848 KB	Output is correct
30	Correct	2 ms	848 KB	Output is correct
31	Correct	2 ms	848 KB	Output is correct
32	Correct	3 ms	1104 KB	Output is correct
33	Correct	2 ms	848 KB	Output is correct
34	Correct	3 ms	976 KB	Output is correct
35	Correct	2 ms	848 KB	Output is correct
36	Correct	91 ms	23308 KB	Output is correct
37	Correct	148 ms	36144 KB	Output is correct
38	Correct	170 ms	36320 KB	Output is correct
39	Correct	186 ms	36256 KB	Output is correct
40	Correct	155 ms	36144 KB	Output is correct
41	Correct	161 ms	36172 KB	Output is correct
42	Correct	159 ms	36236 KB	Output is correct
43	Correct	111 ms	45616 KB	Output is correct
44	Correct	112 ms	36228 KB	Output is correct
45	Correct	123 ms	42968 KB	Output is correct
46	Correct	108 ms	36276 KB	Output is correct
47	Correct	150 ms	36252 KB	Output is correct
48	Correct	155 ms	36228 KB	Output is correct
49	Correct	161 ms	36332 KB	Output is correct
50	Correct	133 ms	36248 KB	Output is correct
51	Correct	110 ms	45444 KB	Output is correct
52	Correct	142 ms	36240 KB	Output is correct
53	Correct	172 ms	36204 KB	Output is correct
54	Correct	167 ms	36248 KB	Output is correct
55	Correct	110 ms	36228 KB	Output is correct
56	Correct	120 ms	44984 KB	Output is correct
57	Correct	156 ms	35004 KB	Output is correct
58	Correct	157 ms	36176 KB	Output is correct
59	Correct	149 ms	36252 KB	Output is correct
60	Correct	185 ms	36252 KB	Output is correct
61	Correct	185 ms	36168 KB	Output is correct
62	Correct	167 ms	36216 KB	Output is correct
63	Correct	160 ms	36228 KB	Output is correct
64	Correct	120 ms	45616 KB	Output is correct
65	Correct	108 ms	36184 KB	Output is correct
66	Correct	128 ms	41860 KB	Output is correct
67	Correct	109 ms	36180 KB	Output is correct
68	Execution timed out	4006 ms	35348 KB	Time limit exceeded
69	Halted	0 ms	0 KB	-

Subtask #7
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1002 ms	26000 KB	Output is correct
2	Correct	1774 ms	45164 KB	Output is correct
3	Correct	1497 ms	45336 KB	Output is correct
4	Correct	1472 ms	45576 KB	Output is correct
5	Correct	878 ms	36244 KB	Output is correct
6	Correct	1824 ms	45552 KB	Output is correct
7	Correct	802 ms	36144 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	2 ms	976 KB	Output is correct
10	Correct	2 ms	848 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	2 ms	848 KB	Output is correct
13	Correct	3 ms	848 KB	Output is correct
14	Correct	3 ms	848 KB	Output is correct
15	Correct	4 ms	848 KB	Output is correct
16	Correct	3 ms	848 KB	Output is correct
17	Correct	2 ms	848 KB	Output is correct
18	Correct	3 ms	1104 KB	Output is correct
19	Correct	2 ms	872 KB	Output is correct
20	Correct	2 ms	976 KB	Output is correct
21	Correct	2 ms	848 KB	Output is correct
22	Correct	0 ms	208 KB	Output is correct
23	Correct	2 ms	976 KB	Output is correct
24	Correct	2 ms	848 KB	Output is correct
25	Correct	2 ms	848 KB	Output is correct
26	Correct	3 ms	848 KB	Output is correct
27	Correct	2 ms	848 KB	Output is correct
28	Correct	2 ms	848 KB	Output is correct
29	Correct	2 ms	976 KB	Output is correct
30	Correct	4 ms	848 KB	Output is correct
31	Correct	3 ms	848 KB	Output is correct
32	Correct	2 ms	848 KB	Output is correct
33	Correct	2 ms	848 KB	Output is correct
34	Correct	2 ms	976 KB	Output is correct
35	Correct	1 ms	464 KB	Output is correct
36	Correct	2 ms	848 KB	Output is correct
37	Correct	2 ms	848 KB	Output is correct
38	Correct	2 ms	848 KB	Output is correct
39	Correct	2 ms	848 KB	Output is correct
40	Correct	2 ms	848 KB	Output is correct
41	Correct	2 ms	848 KB	Output is correct
42	Correct	3 ms	1104 KB	Output is correct
43	Correct	2 ms	848 KB	Output is correct
44	Correct	3 ms	976 KB	Output is correct
45	Correct	2 ms	848 KB	Output is correct
46	Correct	91 ms	23308 KB	Output is correct
47	Correct	148 ms	36144 KB	Output is correct
48	Correct	170 ms	36320 KB	Output is correct
49	Correct	186 ms	36256 KB	Output is correct
50	Correct	155 ms	36144 KB	Output is correct
51	Correct	161 ms	36172 KB	Output is correct
52	Correct	159 ms	36236 KB	Output is correct
53	Correct	111 ms	45616 KB	Output is correct
54	Correct	112 ms	36228 KB	Output is correct
55	Correct	123 ms	42968 KB	Output is correct
56	Correct	108 ms	36276 KB	Output is correct
57	Correct	150 ms	36252 KB	Output is correct
58	Correct	155 ms	36228 KB	Output is correct
59	Correct	161 ms	36332 KB	Output is correct
60	Correct	133 ms	36248 KB	Output is correct
61	Correct	110 ms	45444 KB	Output is correct
62	Correct	142 ms	36240 KB	Output is correct
63	Correct	172 ms	36204 KB	Output is correct
64	Correct	167 ms	36248 KB	Output is correct
65	Correct	110 ms	36228 KB	Output is correct
66	Correct	120 ms	44984 KB	Output is correct
67	Correct	156 ms	35004 KB	Output is correct
68	Correct	157 ms	36176 KB	Output is correct
69	Correct	149 ms	36252 KB	Output is correct
70	Correct	185 ms	36252 KB	Output is correct
71	Correct	185 ms	36168 KB	Output is correct
72	Correct	167 ms	36216 KB	Output is correct
73	Correct	160 ms	36228 KB	Output is correct
74	Correct	120 ms	45616 KB	Output is correct
75	Correct	108 ms	36184 KB	Output is correct
76	Correct	128 ms	41860 KB	Output is correct
77	Correct	109 ms	36180 KB	Output is correct
78	Execution timed out	4006 ms	35348 KB	Time limit exceeded
79	Halted	0 ms	0 KB	-

답안 #626088

Compilation message

Subtask #1 4.0 / 4.0

Subtask #2 11.0 / 11.0

Subtask #3 12.0 / 12.0

Subtask #4 0 / 14.0

Subtask #5 17.0 / 17.0

Subtask #6 0 / 19.0

Subtask #7 0 / 23.0

Subtask #1
4.0 / 4.0

Subtask #2
11.0 / 11.0

Subtask #3
12.0 / 12.0

Subtask #4
0 / 14.0

Subtask #5
17.0 / 17.0

Subtask #6
0 / 19.0

Subtask #7
0 / 23.0