답안 #626145

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
626145	2022-08-11T09:02:37 Z	nigus	송신탑 (IOI22_towers)	C++17	44 / 100	4000 ms	31988 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{
            if(v[lo] > 0){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 x = l->get_min(L,R);
        int y = r->get_max(L,R);
        int res = y-x;

        if(res < r->ab){
            res = max(res, r->get_ab(L, R));
        }
        if(res < l->ab){
            res = max(res, l->get_ab(L, R));
        }

        return res;
    }
    int get_ba(int L, int R){
        if (R <= lo || hi <= L) return 0;
		if (L <= lo && hi <= R) return ba;

        int x = r->get_min(L,R);
        int y = l->get_max(L,R);
        int res = y-x;

        if(res < r->ba){
            res = max(res, r->get_ba(L, R));
        }
        if(res < l->ba){
            res = max(res, l->get_ba(L, R));
        }

        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(sz(V) == 0)return 0;
            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;

const int lim = 10;

int AB(int L, int R){
    if(R-L > lim)return ST->get_ab(L,R);
    int mi = big;
    int res = 0;
    rep(c1,L,R){
        mi = min(mi, H2[c1]);
        res = max(H2[c1]-mi, res);
    }
    return res;
}

int BA(int L, int R){
    if(R-L > lim)return ST->get_ba(L, R);
    int ma = -big;
    int res = 0;
    rep(c1,L,R){
        ma = max(ma, H2[c1]);
        res = max(ma-H2[c1], res);
    }
    return res;
}

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(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(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, 6, 1) << "\n";
    cout << max_towers(0, 6, 2) << "\n";
    cout << max_towers(0, 6, 3) << "\n";
    cout << max_towers(0, 6, 10) << "\n";


    return 0;
}
*/

Subtask #1
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	563 ms	18072 KB	Output is correct
2	Correct	1231 ms	31372 KB	Output is correct
3	Correct	1264 ms	31492 KB	Output is correct
4	Correct	1277 ms	31988 KB	Output is correct
5	Correct	1194 ms	22552 KB	Output is correct
6	Correct	1406 ms	31820 KB	Output is correct
7	Correct	1080 ms	22692 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	2 ms	720 KB	Output is correct
10	Correct	3 ms	720 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	720 KB	Output is correct
3	Correct	2 ms	720 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	2 ms	848 KB	Output is correct
8	Correct	2 ms	848 KB	Output is correct
9	Correct	2 ms	720 KB	Output is correct
10	Correct	2 ms	720 KB	Output is correct
11	Correct	2 ms	720 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	2 ms	720 KB	Output is correct
14	Correct	1 ms	720 KB	Output is correct
15	Correct	2 ms	848 KB	Output is correct
16	Correct	2 ms	848 KB	Output is correct
17	Correct	2 ms	848 KB	Output is correct
18	Correct	3 ms	720 KB	Output is correct
19	Correct	2 ms	848 KB	Output is correct
20	Correct	2 ms	720 KB	Output is correct
21	Correct	2 ms	848 KB	Output is correct
22	Correct	2 ms	848 KB	Output is correct
23	Correct	2 ms	720 KB	Output is correct
24	Correct	2 ms	848 KB	Output is correct
25	Correct	1 ms	464 KB	Output is correct
26	Correct	2 ms	720 KB	Output is correct
27	Correct	2 ms	716 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	1 ms	848 KB	Output is correct
33	Correct	1 ms	720 KB	Output is correct
34	Correct	2 ms	848 KB	Output is correct
35	Correct	2 ms	720 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	720 KB	Output is correct
3	Correct	2 ms	720 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	2 ms	848 KB	Output is correct
8	Correct	2 ms	848 KB	Output is correct
9	Correct	2 ms	720 KB	Output is correct
10	Correct	2 ms	720 KB	Output is correct
11	Correct	2 ms	720 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	2 ms	720 KB	Output is correct
14	Correct	1 ms	720 KB	Output is correct
15	Correct	2 ms	848 KB	Output is correct
16	Correct	2 ms	848 KB	Output is correct
17	Correct	2 ms	848 KB	Output is correct
18	Correct	3 ms	720 KB	Output is correct
19	Correct	2 ms	848 KB	Output is correct
20	Correct	2 ms	720 KB	Output is correct
21	Correct	2 ms	848 KB	Output is correct
22	Correct	2 ms	848 KB	Output is correct
23	Correct	2 ms	720 KB	Output is correct
24	Correct	2 ms	848 KB	Output is correct
25	Correct	1 ms	464 KB	Output is correct
26	Correct	2 ms	720 KB	Output is correct
27	Correct	2 ms	716 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	1 ms	848 KB	Output is correct
33	Correct	1 ms	720 KB	Output is correct
34	Correct	2 ms	848 KB	Output is correct
35	Correct	2 ms	720 KB	Output is correct
36	Correct	83 ms	18620 KB	Output is correct
37	Correct	141 ms	28884 KB	Output is correct
38	Correct	128 ms	28756 KB	Output is correct
39	Correct	115 ms	30676 KB	Output is correct
40	Correct	133 ms	30592 KB	Output is correct
41	Correct	123 ms	30680 KB	Output is correct
42	Correct	121 ms	30680 KB	Output is correct
43	Correct	94 ms	31972 KB	Output is correct
44	Correct	80 ms	22608 KB	Output is correct
45	Correct	95 ms	29360 KB	Output is correct
46	Correct	94 ms	22616 KB	Output is correct
47	Correct	127 ms	28752 KB	Output is correct
48	Correct	128 ms	30660 KB	Output is correct
49	Correct	113 ms	30600 KB	Output is correct
50	Correct	80 ms	22576 KB	Output is correct
51	Correct	84 ms	31724 KB	Output is correct
52	Correct	116 ms	28932 KB	Output is correct
53	Correct	133 ms	30680 KB	Output is correct
54	Correct	125 ms	30672 KB	Output is correct
55	Correct	79 ms	22604 KB	Output is correct
56	Correct	111 ms	31096 KB	Output is correct
57	Correct	135 ms	27336 KB	Output is correct
58	Correct	120 ms	28808 KB	Output is correct
59	Correct	119 ms	28804 KB	Output is correct
60	Correct	124 ms	30672 KB	Output is correct
61	Correct	126 ms	30616 KB	Output is correct
62	Correct	127 ms	30620 KB	Output is correct
63	Correct	121 ms	30812 KB	Output is correct
64	Correct	86 ms	31880 KB	Output is correct
65	Correct	79 ms	22580 KB	Output is correct
66	Correct	93 ms	28332 KB	Output is correct
67	Correct	75 ms	22532 KB	Output is correct

Subtask #4
0 / 14.0

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

Subtask #5
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	600 ms	6916 KB	Output is correct
2	Correct	2063 ms	28800 KB	Output is correct
3	Correct	2407 ms	28900 KB	Output is correct
4	Correct	2672 ms	30720 KB	Output is correct
5	Correct	2518 ms	30664 KB	Output is correct
6	Correct	2441 ms	30644 KB	Output is correct
7	Correct	2553 ms	30752 KB	Output is correct
8	Correct	647 ms	31980 KB	Output is correct
9	Correct	1020 ms	22536 KB	Output is correct
10	Correct	2267 ms	28248 KB	Output is correct
11	Correct	2304 ms	22612 KB	Output is correct
12	Correct	136 ms	28848 KB	Output is correct
13	Correct	126 ms	30780 KB	Output is correct
14	Correct	142 ms	30608 KB	Output is correct
15	Correct	92 ms	22528 KB	Output is correct
16	Correct	90 ms	31112 KB	Output is correct
17	Correct	119 ms	27268 KB	Output is correct
18	Correct	146 ms	29016 KB	Output is correct
19	Correct	127 ms	28848 KB	Output is correct
20	Correct	127 ms	30592 KB	Output is correct
21	Correct	133 ms	30680 KB	Output is correct
22	Correct	127 ms	30676 KB	Output is correct
23	Correct	113 ms	30676 KB	Output is correct
24	Correct	83 ms	31876 KB	Output is correct
25	Correct	80 ms	22612 KB	Output is correct
26	Correct	101 ms	28208 KB	Output is correct
27	Correct	84 ms	22532 KB	Output is correct
28	Correct	2 ms	720 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	720 KB	Output is correct
32	Correct	2 ms	848 KB	Output is correct
33	Correct	2 ms	464 KB	Output is correct
34	Correct	2 ms	720 KB	Output is correct
35	Correct	2 ms	720 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	1 ms	720 KB	Output is correct
42	Correct	2 ms	848 KB	Output is correct
43	Correct	1 ms	720 KB	Output is correct

Subtask #6
0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	2 ms	720 KB	Output is correct
3	Correct	2 ms	720 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	2 ms	848 KB	Output is correct
8	Correct	2 ms	848 KB	Output is correct
9	Correct	2 ms	720 KB	Output is correct
10	Correct	2 ms	720 KB	Output is correct
11	Correct	2 ms	720 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	2 ms	720 KB	Output is correct
14	Correct	1 ms	720 KB	Output is correct
15	Correct	2 ms	848 KB	Output is correct
16	Correct	2 ms	848 KB	Output is correct
17	Correct	2 ms	848 KB	Output is correct
18	Correct	3 ms	720 KB	Output is correct
19	Correct	2 ms	848 KB	Output is correct
20	Correct	2 ms	720 KB	Output is correct
21	Correct	2 ms	848 KB	Output is correct
22	Correct	2 ms	848 KB	Output is correct
23	Correct	2 ms	720 KB	Output is correct
24	Correct	2 ms	848 KB	Output is correct
25	Correct	1 ms	464 KB	Output is correct
26	Correct	2 ms	720 KB	Output is correct
27	Correct	2 ms	716 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	1 ms	848 KB	Output is correct
33	Correct	1 ms	720 KB	Output is correct
34	Correct	2 ms	848 KB	Output is correct
35	Correct	2 ms	720 KB	Output is correct
36	Correct	83 ms	18620 KB	Output is correct
37	Correct	141 ms	28884 KB	Output is correct
38	Correct	128 ms	28756 KB	Output is correct
39	Correct	115 ms	30676 KB	Output is correct
40	Correct	133 ms	30592 KB	Output is correct
41	Correct	123 ms	30680 KB	Output is correct
42	Correct	121 ms	30680 KB	Output is correct
43	Correct	94 ms	31972 KB	Output is correct
44	Correct	80 ms	22608 KB	Output is correct
45	Correct	95 ms	29360 KB	Output is correct
46	Correct	94 ms	22616 KB	Output is correct
47	Correct	127 ms	28752 KB	Output is correct
48	Correct	128 ms	30660 KB	Output is correct
49	Correct	113 ms	30600 KB	Output is correct
50	Correct	80 ms	22576 KB	Output is correct
51	Correct	84 ms	31724 KB	Output is correct
52	Correct	116 ms	28932 KB	Output is correct
53	Correct	133 ms	30680 KB	Output is correct
54	Correct	125 ms	30672 KB	Output is correct
55	Correct	79 ms	22604 KB	Output is correct
56	Correct	111 ms	31096 KB	Output is correct
57	Correct	135 ms	27336 KB	Output is correct
58	Correct	120 ms	28808 KB	Output is correct
59	Correct	119 ms	28804 KB	Output is correct
60	Correct	124 ms	30672 KB	Output is correct
61	Correct	126 ms	30616 KB	Output is correct
62	Correct	127 ms	30620 KB	Output is correct
63	Correct	121 ms	30812 KB	Output is correct
64	Correct	86 ms	31880 KB	Output is correct
65	Correct	79 ms	22580 KB	Output is correct
66	Correct	93 ms	28332 KB	Output is correct
67	Correct	75 ms	22532 KB	Output is correct
68	Execution timed out	4003 ms	28524 KB	Time limit exceeded
69	Halted	0 ms	0 KB	-

Subtask #7
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	563 ms	18072 KB	Output is correct
2	Correct	1231 ms	31372 KB	Output is correct
3	Correct	1264 ms	31492 KB	Output is correct
4	Correct	1277 ms	31988 KB	Output is correct
5	Correct	1194 ms	22552 KB	Output is correct
6	Correct	1406 ms	31820 KB	Output is correct
7	Correct	1080 ms	22692 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	2 ms	720 KB	Output is correct
10	Correct	3 ms	720 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	2 ms	720 KB	Output is correct
13	Correct	2 ms	720 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	2 ms	848 KB	Output is correct
18	Correct	2 ms	848 KB	Output is correct
19	Correct	2 ms	720 KB	Output is correct
20	Correct	2 ms	720 KB	Output is correct
21	Correct	2 ms	720 KB	Output is correct
22	Correct	0 ms	208 KB	Output is correct
23	Correct	2 ms	720 KB	Output is correct
24	Correct	1 ms	720 KB	Output is correct
25	Correct	2 ms	848 KB	Output is correct
26	Correct	2 ms	848 KB	Output is correct
27	Correct	2 ms	848 KB	Output is correct
28	Correct	3 ms	720 KB	Output is correct
29	Correct	2 ms	848 KB	Output is correct
30	Correct	2 ms	720 KB	Output is correct
31	Correct	2 ms	848 KB	Output is correct
32	Correct	2 ms	848 KB	Output is correct
33	Correct	2 ms	720 KB	Output is correct
34	Correct	2 ms	848 KB	Output is correct
35	Correct	1 ms	464 KB	Output is correct
36	Correct	2 ms	720 KB	Output is correct
37	Correct	2 ms	716 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	1 ms	848 KB	Output is correct
43	Correct	1 ms	720 KB	Output is correct
44	Correct	2 ms	848 KB	Output is correct
45	Correct	2 ms	720 KB	Output is correct
46	Correct	83 ms	18620 KB	Output is correct
47	Correct	141 ms	28884 KB	Output is correct
48	Correct	128 ms	28756 KB	Output is correct
49	Correct	115 ms	30676 KB	Output is correct
50	Correct	133 ms	30592 KB	Output is correct
51	Correct	123 ms	30680 KB	Output is correct
52	Correct	121 ms	30680 KB	Output is correct
53	Correct	94 ms	31972 KB	Output is correct
54	Correct	80 ms	22608 KB	Output is correct
55	Correct	95 ms	29360 KB	Output is correct
56	Correct	94 ms	22616 KB	Output is correct
57	Correct	127 ms	28752 KB	Output is correct
58	Correct	128 ms	30660 KB	Output is correct
59	Correct	113 ms	30600 KB	Output is correct
60	Correct	80 ms	22576 KB	Output is correct
61	Correct	84 ms	31724 KB	Output is correct
62	Correct	116 ms	28932 KB	Output is correct
63	Correct	133 ms	30680 KB	Output is correct
64	Correct	125 ms	30672 KB	Output is correct
65	Correct	79 ms	22604 KB	Output is correct
66	Correct	111 ms	31096 KB	Output is correct
67	Correct	135 ms	27336 KB	Output is correct
68	Correct	120 ms	28808 KB	Output is correct
69	Correct	119 ms	28804 KB	Output is correct
70	Correct	124 ms	30672 KB	Output is correct
71	Correct	126 ms	30616 KB	Output is correct
72	Correct	127 ms	30620 KB	Output is correct
73	Correct	121 ms	30812 KB	Output is correct
74	Correct	86 ms	31880 KB	Output is correct
75	Correct	79 ms	22580 KB	Output is correct
76	Correct	93 ms	28332 KB	Output is correct
77	Correct	75 ms	22532 KB	Output is correct
78	Execution timed out	4003 ms	28524 KB	Time limit exceeded
79	Halted	0 ms	0 KB	-

답안 #626145

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