oj.uz

답안 #626062

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
626062 2022-08-11T07:40:18 Z nigus 송신탑 (IOI22_towers) C++17
17 / 100
 1222 ms 45584 KB 
#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 = max(l->get_ab(L, R), r->get_ab(L, R));
        int x = l->get_min(L,R);
        int y = r->get_max(L,R);
        return max(res,y-x);
    }
    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 max_towers(int L, int R, int D){
    return (ST->geq(L,R,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
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 530 ms 25964 KB 2nd lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '13', found: '14'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '13', found: '14'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1083 ms 35248 KB 1st lines differ - on the 1st token, expected: '11903', found: '11904'
2 Halted 0 ms 0 KB -

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 334 ms 8824 KB Output is correct
2 Correct 1102 ms 36172 KB Output is correct
3 Correct 1222 ms 36188 KB Output is correct
4 Correct 1155 ms 36212 KB Output is correct
5 Correct 1084 ms 36192 KB Output is correct
6 Correct 974 ms 36216 KB Output is correct
7 Correct 1143 ms 36228 KB Output is correct
8 Correct 975 ms 45568 KB Output is correct
9 Correct 1064 ms 36180 KB Output is correct
10 Correct 1020 ms 41904 KB Output is correct
11 Correct 734 ms 36180 KB Output is correct
12 Correct 172 ms 36208 KB Output is correct
13 Correct 167 ms 36236 KB Output is correct
14 Correct 173 ms 36184 KB Output is correct
15 Correct 116 ms 36188 KB Output is correct
16 Correct 126 ms 44804 KB Output is correct
17 Correct 139 ms 34952 KB Output is correct
18 Correct 185 ms 36188 KB Output is correct
19 Correct 165 ms 36180 KB Output is correct
20 Correct 160 ms 36232 KB Output is correct
21 Correct 164 ms 36216 KB Output is correct
22 Correct 154 ms 36272 KB Output is correct
23 Correct 161 ms 36264 KB Output is correct
24 Correct 120 ms 45584 KB Output is correct
25 Correct 107 ms 36180 KB Output is correct
26 Correct 124 ms 41884 KB Output is correct
27 Correct 103 ms 36176 KB Output is correct
28 Correct 2 ms 848 KB Output is correct
29 Correct 3 ms 848 KB Output is correct
30 Correct 2 ms 876 KB Output is correct
31 Correct 2 ms 848 KB Output is correct
32 Correct 2 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 3 ms 848 KB Output is correct
37 Correct 2 ms 848 KB Output is correct
38 Correct 3 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 1008 KB Output is correct
43 Correct 2 ms 848 KB Output is correct

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '13', found: '14'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 530 ms 25964 KB 2nd lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -