답안 #626103

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
626103	2022-08-11T08:28:38 Z	nigus	송신탑 (IOI22_towers)	C++17	44 / 100	4000 ms	46340 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);
            int x = 0;
            int y = 0;
            while(x < sz(l->V) || y < sz(r->V)){
                if(y == sz(r->V) || (x < sz(l->V) && l->V[x] >= r->V[y])){
                    V.push_back(l->V[x]);
                    x++;
                }
                else{
                    V.push_back(r->V[y]);
                    y++;
                }
            }

        }
        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 = l->get_ba(L, R);
        if(res < r->ba){
            res = max(res, r->get_ba(L, R));
        }
        if(res < (l->ma) - (r->mi)){
            int x = r->get_min(L, R);
            int y = l->get_max(L, R);
            res = max(res, y-x);
        }

        return res;
    }
    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);
}

unordered_map<ll,int> M;

int first_ab(ll L, ll R, ll D){

    ll h = 2*(L*big + D);
    if(M.find(h) != M.end())return M[h];

    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;
        }
    }
    M[h] = hi;

    return hi;
}

int last_ba(ll L, ll R, ll D){

    ll h = 2*(R*big + D) + 1;
    if(M.find(h) != M.end())return M[h];

    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;
        }
    }
    M[h] = lo;

    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	898 ms	25432 KB	Output is correct
2	Correct	1642 ms	44816 KB	Output is correct
3	Correct	1578 ms	44952 KB	Output is correct
4	Correct	1615 ms	45428 KB	Output is correct
5	Correct	1146 ms	35972 KB	Output is correct
6	Correct	1579 ms	45332 KB	Output is correct
7	Correct	1012 ms	36068 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	2 ms	848 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	3 ms	848 KB	Output is correct
3	Correct	2 ms	848 KB	Output is correct
4	Correct	2 ms	848 KB	Output is correct
5	Correct	2 ms	848 KB	Output is correct
6	Correct	2 ms	848 KB	Output is correct
7	Correct	3 ms	848 KB	Output is correct
8	Correct	4 ms	1104 KB	Output is correct
9	Correct	2 ms	848 KB	Output is correct
10	Correct	4 ms	988 KB	Output is correct
11	Correct	3 ms	848 KB	Output is correct
12	Correct	1 ms	208 KB	Output is correct
13	Correct	3 ms	848 KB	Output is correct
14	Correct	2 ms	848 KB	Output is correct
15	Correct	3 ms	892 KB	Output is correct
16	Correct	3 ms	848 KB	Output is correct
17	Correct	4 ms	848 KB	Output is correct
18	Correct	2 ms	848 KB	Output is correct
19	Correct	3 ms	976 KB	Output is correct
20	Correct	2 ms	848 KB	Output is correct
21	Correct	2 ms	828 KB	Output is correct
22	Correct	2 ms	848 KB	Output is correct
23	Correct	2 ms	940 KB	Output is correct
24	Correct	3 ms	976 KB	Output is correct
25	Correct	1 ms	464 KB	Output is correct
26	Correct	2 ms	920 KB	Output is correct
27	Correct	3 ms	848 KB	Output is correct
28	Correct	2 ms	848 KB	Output is correct
29	Correct	3 ms	928 KB	Output is correct
30	Correct	2 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	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	3 ms	848 KB	Output is correct
3	Correct	2 ms	848 KB	Output is correct
4	Correct	2 ms	848 KB	Output is correct
5	Correct	2 ms	848 KB	Output is correct
6	Correct	2 ms	848 KB	Output is correct
7	Correct	3 ms	848 KB	Output is correct
8	Correct	4 ms	1104 KB	Output is correct
9	Correct	2 ms	848 KB	Output is correct
10	Correct	4 ms	988 KB	Output is correct
11	Correct	3 ms	848 KB	Output is correct
12	Correct	1 ms	208 KB	Output is correct
13	Correct	3 ms	848 KB	Output is correct
14	Correct	2 ms	848 KB	Output is correct
15	Correct	3 ms	892 KB	Output is correct
16	Correct	3 ms	848 KB	Output is correct
17	Correct	4 ms	848 KB	Output is correct
18	Correct	2 ms	848 KB	Output is correct
19	Correct	3 ms	976 KB	Output is correct
20	Correct	2 ms	848 KB	Output is correct
21	Correct	2 ms	828 KB	Output is correct
22	Correct	2 ms	848 KB	Output is correct
23	Correct	2 ms	940 KB	Output is correct
24	Correct	3 ms	976 KB	Output is correct
25	Correct	1 ms	464 KB	Output is correct
26	Correct	2 ms	920 KB	Output is correct
27	Correct	3 ms	848 KB	Output is correct
28	Correct	2 ms	848 KB	Output is correct
29	Correct	3 ms	928 KB	Output is correct
30	Correct	2 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	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	98 ms	22468 KB	Output is correct
37	Correct	161 ms	35968 KB	Output is correct
38	Correct	150 ms	36052 KB	Output is correct
39	Correct	145 ms	35952 KB	Output is correct
40	Correct	167 ms	35976 KB	Output is correct
41	Correct	152 ms	35972 KB	Output is correct
42	Correct	147 ms	36040 KB	Output is correct
43	Correct	139 ms	45384 KB	Output is correct
44	Correct	117 ms	35976 KB	Output is correct
45	Correct	127 ms	42768 KB	Output is correct
46	Correct	116 ms	35960 KB	Output is correct
47	Correct	168 ms	36056 KB	Output is correct
48	Correct	164 ms	36056 KB	Output is correct
49	Correct	143 ms	36016 KB	Output is correct
50	Correct	110 ms	36056 KB	Output is correct
51	Correct	119 ms	45252 KB	Output is correct
52	Correct	162 ms	36048 KB	Output is correct
53	Correct	151 ms	35976 KB	Output is correct
54	Correct	156 ms	36036 KB	Output is correct
55	Correct	111 ms	35984 KB	Output is correct
56	Correct	134 ms	44588 KB	Output is correct
57	Correct	145 ms	35036 KB	Output is correct
58	Correct	151 ms	36052 KB	Output is correct
59	Correct	173 ms	35980 KB	Output is correct
60	Correct	128 ms	35968 KB	Output is correct
61	Correct	137 ms	35996 KB	Output is correct
62	Correct	141 ms	36052 KB	Output is correct
63	Correct	127 ms	36048 KB	Output is correct
64	Correct	105 ms	45456 KB	Output is correct
65	Correct	99 ms	36052 KB	Output is correct
66	Correct	110 ms	41752 KB	Output is correct
67	Correct	99 ms	36008 KB	Output is correct

Subtask #4

0 / 14.0

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

Subtask #5

17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	743 ms	11160 KB	Output is correct
2	Correct	2990 ms	44740 KB	Output is correct
3	Correct	2722 ms	44784 KB	Output is correct
4	Correct	2885 ms	44592 KB	Output is correct
5	Correct	2883 ms	44608 KB	Output is correct
6	Correct	3003 ms	44880 KB	Output is correct
7	Correct	2888 ms	44600 KB	Output is correct
8	Correct	861 ms	45428 KB	Output is correct
9	Correct	930 ms	35992 KB	Output is correct
10	Correct	1934 ms	46340 KB	Output is correct
11	Correct	1623 ms	41616 KB	Output is correct
12	Correct	131 ms	36016 KB	Output is correct
13	Correct	133 ms	36060 KB	Output is correct
14	Correct	132 ms	36076 KB	Output is correct
15	Correct	99 ms	35972 KB	Output is correct
16	Correct	140 ms	44552 KB	Output is correct
17	Correct	129 ms	35040 KB	Output is correct
18	Correct	143 ms	35976 KB	Output is correct
19	Correct	143 ms	35960 KB	Output is correct
20	Correct	155 ms	36096 KB	Output is correct
21	Correct	125 ms	36016 KB	Output is correct
22	Correct	136 ms	35972 KB	Output is correct
23	Correct	128 ms	36016 KB	Output is correct
24	Correct	108 ms	45360 KB	Output is correct
25	Correct	107 ms	35996 KB	Output is correct
26	Correct	115 ms	41776 KB	Output is correct
27	Correct	99 ms	35992 KB	Output is correct
28	Correct	2 ms	848 KB	Output is correct
29	Correct	2 ms	888 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	976 KB	Output is correct
33	Correct	1 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	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	1104 KB	Output is correct
41	Correct	2 ms	848 KB	Output is correct
42	Correct	2 ms	976 KB	Output is correct
43	Correct	2 ms	844 KB	Output is correct

Subtask #6

0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	3 ms	848 KB	Output is correct
3	Correct	2 ms	848 KB	Output is correct
4	Correct	2 ms	848 KB	Output is correct
5	Correct	2 ms	848 KB	Output is correct
6	Correct	2 ms	848 KB	Output is correct
7	Correct	3 ms	848 KB	Output is correct
8	Correct	4 ms	1104 KB	Output is correct
9	Correct	2 ms	848 KB	Output is correct
10	Correct	4 ms	988 KB	Output is correct
11	Correct	3 ms	848 KB	Output is correct
12	Correct	1 ms	208 KB	Output is correct
13	Correct	3 ms	848 KB	Output is correct
14	Correct	2 ms	848 KB	Output is correct
15	Correct	3 ms	892 KB	Output is correct
16	Correct	3 ms	848 KB	Output is correct
17	Correct	4 ms	848 KB	Output is correct
18	Correct	2 ms	848 KB	Output is correct
19	Correct	3 ms	976 KB	Output is correct
20	Correct	2 ms	848 KB	Output is correct
21	Correct	2 ms	828 KB	Output is correct
22	Correct	2 ms	848 KB	Output is correct
23	Correct	2 ms	940 KB	Output is correct
24	Correct	3 ms	976 KB	Output is correct
25	Correct	1 ms	464 KB	Output is correct
26	Correct	2 ms	920 KB	Output is correct
27	Correct	3 ms	848 KB	Output is correct
28	Correct	2 ms	848 KB	Output is correct
29	Correct	3 ms	928 KB	Output is correct
30	Correct	2 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	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	98 ms	22468 KB	Output is correct
37	Correct	161 ms	35968 KB	Output is correct
38	Correct	150 ms	36052 KB	Output is correct
39	Correct	145 ms	35952 KB	Output is correct
40	Correct	167 ms	35976 KB	Output is correct
41	Correct	152 ms	35972 KB	Output is correct
42	Correct	147 ms	36040 KB	Output is correct
43	Correct	139 ms	45384 KB	Output is correct
44	Correct	117 ms	35976 KB	Output is correct
45	Correct	127 ms	42768 KB	Output is correct
46	Correct	116 ms	35960 KB	Output is correct
47	Correct	168 ms	36056 KB	Output is correct
48	Correct	164 ms	36056 KB	Output is correct
49	Correct	143 ms	36016 KB	Output is correct
50	Correct	110 ms	36056 KB	Output is correct
51	Correct	119 ms	45252 KB	Output is correct
52	Correct	162 ms	36048 KB	Output is correct
53	Correct	151 ms	35976 KB	Output is correct
54	Correct	156 ms	36036 KB	Output is correct
55	Correct	111 ms	35984 KB	Output is correct
56	Correct	134 ms	44588 KB	Output is correct
57	Correct	145 ms	35036 KB	Output is correct
58	Correct	151 ms	36052 KB	Output is correct
59	Correct	173 ms	35980 KB	Output is correct
60	Correct	128 ms	35968 KB	Output is correct
61	Correct	137 ms	35996 KB	Output is correct
62	Correct	141 ms	36052 KB	Output is correct
63	Correct	127 ms	36048 KB	Output is correct
64	Correct	105 ms	45456 KB	Output is correct
65	Correct	99 ms	36052 KB	Output is correct
66	Correct	110 ms	41752 KB	Output is correct
67	Correct	99 ms	36008 KB	Output is correct
68	Execution timed out	4067 ms	39576 KB	Time limit exceeded
69	Halted	0 ms	0 KB	-

Subtask #7

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	898 ms	25432 KB	Output is correct
2	Correct	1642 ms	44816 KB	Output is correct
3	Correct	1578 ms	44952 KB	Output is correct
4	Correct	1615 ms	45428 KB	Output is correct
5	Correct	1146 ms	35972 KB	Output is correct
6	Correct	1579 ms	45332 KB	Output is correct
7	Correct	1012 ms	36068 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	2 ms	848 KB	Output is correct
10	Correct	2 ms	848 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	3 ms	848 KB	Output is correct
13	Correct	2 ms	848 KB	Output is correct
14	Correct	2 ms	848 KB	Output is correct
15	Correct	2 ms	848 KB	Output is correct
16	Correct	2 ms	848 KB	Output is correct
17	Correct	3 ms	848 KB	Output is correct
18	Correct	4 ms	1104 KB	Output is correct
19	Correct	2 ms	848 KB	Output is correct
20	Correct	4 ms	988 KB	Output is correct
21	Correct	3 ms	848 KB	Output is correct
22	Correct	1 ms	208 KB	Output is correct
23	Correct	3 ms	848 KB	Output is correct
24	Correct	2 ms	848 KB	Output is correct
25	Correct	3 ms	892 KB	Output is correct
26	Correct	3 ms	848 KB	Output is correct
27	Correct	4 ms	848 KB	Output is correct
28	Correct	2 ms	848 KB	Output is correct
29	Correct	3 ms	976 KB	Output is correct
30	Correct	2 ms	848 KB	Output is correct
31	Correct	2 ms	828 KB	Output is correct
32	Correct	2 ms	848 KB	Output is correct
33	Correct	2 ms	940 KB	Output is correct
34	Correct	3 ms	976 KB	Output is correct
35	Correct	1 ms	464 KB	Output is correct
36	Correct	2 ms	920 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	928 KB	Output is correct
40	Correct	2 ms	848 KB	Output is correct
41	Correct	2 ms	848 KB	Output is correct
42	Correct	2 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	98 ms	22468 KB	Output is correct
47	Correct	161 ms	35968 KB	Output is correct
48	Correct	150 ms	36052 KB	Output is correct
49	Correct	145 ms	35952 KB	Output is correct
50	Correct	167 ms	35976 KB	Output is correct
51	Correct	152 ms	35972 KB	Output is correct
52	Correct	147 ms	36040 KB	Output is correct
53	Correct	139 ms	45384 KB	Output is correct
54	Correct	117 ms	35976 KB	Output is correct
55	Correct	127 ms	42768 KB	Output is correct
56	Correct	116 ms	35960 KB	Output is correct
57	Correct	168 ms	36056 KB	Output is correct
58	Correct	164 ms	36056 KB	Output is correct
59	Correct	143 ms	36016 KB	Output is correct
60	Correct	110 ms	36056 KB	Output is correct
61	Correct	119 ms	45252 KB	Output is correct
62	Correct	162 ms	36048 KB	Output is correct
63	Correct	151 ms	35976 KB	Output is correct
64	Correct	156 ms	36036 KB	Output is correct
65	Correct	111 ms	35984 KB	Output is correct
66	Correct	134 ms	44588 KB	Output is correct
67	Correct	145 ms	35036 KB	Output is correct
68	Correct	151 ms	36052 KB	Output is correct
69	Correct	173 ms	35980 KB	Output is correct
70	Correct	128 ms	35968 KB	Output is correct
71	Correct	137 ms	35996 KB	Output is correct
72	Correct	141 ms	36052 KB	Output is correct
73	Correct	127 ms	36048 KB	Output is correct
74	Correct	105 ms	45456 KB	Output is correct
75	Correct	99 ms	36052 KB	Output is correct
76	Correct	110 ms	41752 KB	Output is correct
77	Correct	99 ms	36008 KB	Output is correct
78	Execution timed out	4067 ms	39576 KB	Time limit exceeded
79	Halted	0 ms	0 KB	-