oj.uz

답안 #1082259

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1082259 2024-08-31T01:44:30 Z s_tree 송신탑 (IOI22_towers) C++17
23 / 100
 4000 ms 28984 KB 
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+10;
int root = 0;
int par[N];
int L[N], R[N], mn[N];

struct ST {
	vector<pair<int,int>> t;
	int n;
	ST(){}
	ST(vector<int>&h) {
		n  = h.size();
		t.resize(2*n);
		for(int i = 0;i<n;i++)t[i+n] = {h[i], i};
		for(int i = n-1;i>0;i--)t[i] = max(t[2*i], t[2*i+1]);
	}
	int query(int l, int r) {
		l+=n,r+=n+1;
		pair<int,int> ans = {-1, -1};	
		for(;l<r;l>>=1,r>>=1) {
			if(l&1)ans = max(ans, t[l++]);
			if(r&1)ans = max(ans, t[--r]);
		}
		return ans.second;
	}
};
struct ST2 {
	vector<int> t;
	int n;
	ST2(){}
	ST2(vector<int>&h) {
		n  = h.size();
		t.resize(2*n);
		for(int i = 0;i<n;i++)t[i+n] = h[i];
		for(int i = n-1;i>0;i--)t[i] = min(t[2*i], t[2*i+1]);
	}
	int query(int l, int r) {
		l+=n,r+=n+1;
		int ans = 2e9;
		for(;l<r;l>>=1,r>>=1) {
			if(l&1)ans = min(ans, t[l++]);
			if(r&1)ans = min(ans, t[--r]);
		}
		return ans;
	}
};
struct ST3 {
	vector<vector<int>> t;
	int n;
	ST3(){}
	ST3(vector<int>&h) {
		n  = h.size();
		t.resize(2*n);
		for(int i = 0;i<n;i++)t[i+n].push_back(h[i]);
		for(int i = n-1;i>0;i--){
				merge(t[2*i].begin(), t[2*i].end(), t[2*i+1].begin(), t[2*i+1].end(), back_inserter(t[i]));
		}
	}
	int query(int l, int r) {
		int key = r;
		l+=n,r+=n+1;
		int ans=0;
		for(;l<r;l>>=1,r>>=1) {
			if(l&1) {
				ans+=upper_bound(t[l].begin(), t[l].end(), key) - t[l].begin();
				l++;
			}
			if(r&1) {
				--r;
				ans+=upper_bound(t[r].begin(), t[r].end(), key) - t[r].begin();
			}
		}
		return ans;
	}
};
vector<int> H;
ST st;
ST2 st2;
ST3 st3;
int pref[N+1];
int build(int l, int r) {
	if(r < l)return -1;
	int p = st.query(l, r);
	L[p] = build(l, p-1);
	R[p] = build(p+1, r);
	mn[p] = H[p];
	if(L[p]!=-1)mn[p] = min(mn[p], mn[L[p]]);
	if(R[p]!=-1)mn[p] = min(mn[p], mn[R[p]]);
	return p;
}
void init(int n, std::vector<int> h) {
	st = ST(h);
	st2 = ST2(h);
	H = h;
	root = build(0, n-1);
	vector<int> tt(n, n+10);
	for(int i = 0;i<n;i++) {
		if(L[i] != -1 and R[i] != -1) {
			tt[L[i]] = R[i];
		}
	}
	st3 = ST3(tt);
}


int query(int v, int l, int r, int MX, int D) {
	if(l > r)return 0;
	if(v == -1)return 0;
	if(v > r) {
		return query(L[v], l, r, MX, D);
	}
	if(v < l)
		return query(R[v], l, r, MX, D);
	int ans = 0;	
	if(st2.query(l, r) <= MX)ans=1;
	ans = max(ans, query(L[v], l, v-1, H[v]-D, D)+query(R[v], v+1, r, H[v]-D, D));
	return ans;
}
int query2(int v, int l, int r) {
	if(l > r)return 0;
	if(v == -1)return 0;
	if(v>r)return query2(L[v], l, r);
	if(v<l)return query2(R[v], l, r);
	int ans=0;
	if(L[v] < l and (R[v] == -1 or R[v] > r))return 1;
	ans+=query2(L[v], l, r);
	ans+=query2(R[v], l, r);
	return ans;
}
int max_towers(int l, int r, int D) {
	if(D == 1) {
		int ans=0;
		for(int i = l;i<=r;i++) {
			if((i==0 or (i-1 < l or H[i-1] > H[i])) and (i+1>=(int)H.size() or (i+1>r or H[i+1] > H[i])))ans++;
		}
		return ans;
			
	}

  return query(root, l, r, 2e9, D);
}

Subtask #1
0 / 4.0

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

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 1 ms 856 KB Output is correct
10 Correct 1 ms 856 KB Output is correct
11 Correct 1 ms 856 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 856 KB Output is correct
14 Correct 1 ms 856 KB Output is correct
15 Correct 1 ms 684 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 844 KB Output is correct
19 Correct 1 ms 856 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 856 KB Output is correct
24 Correct 1 ms 856 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 2 ms 600 KB Output is correct
30 Correct 2 ms 600 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 856 KB Output is correct
33 Correct 1 ms 856 KB Output is correct
34 Correct 1 ms 856 KB Output is correct
35 Correct 1 ms 856 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 1 ms 856 KB Output is correct
10 Correct 1 ms 856 KB Output is correct
11 Correct 1 ms 856 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 856 KB Output is correct
14 Correct 1 ms 856 KB Output is correct
15 Correct 1 ms 684 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 844 KB Output is correct
19 Correct 1 ms 856 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 856 KB Output is correct
24 Correct 1 ms 856 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 2 ms 600 KB Output is correct
30 Correct 2 ms 600 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 856 KB Output is correct
33 Correct 1 ms 856 KB Output is correct
34 Correct 1 ms 856 KB Output is correct
35 Correct 1 ms 856 KB Output is correct
36 Correct 22 ms 14284 KB Output is correct
37 Correct 32 ms 22100 KB Output is correct
38 Correct 33 ms 22092 KB Output is correct
39 Correct 31 ms 22092 KB Output is correct
40 Correct 29 ms 22100 KB Output is correct
41 Correct 38 ms 22084 KB Output is correct
42 Correct 31 ms 22092 KB Output is correct
43 Correct 40 ms 28236 KB Output is correct
44 Correct 46 ms 28236 KB Output is correct
45 Correct 43 ms 26708 KB Output is correct
46 Correct 36 ms 25932 KB Output is correct
47 Correct 40 ms 22072 KB Output is correct
48 Correct 29 ms 22100 KB Output is correct
49 Correct 29 ms 22144 KB Output is correct
50 Correct 35 ms 28336 KB Output is correct
51 Correct 42 ms 28164 KB Output is correct
52 Correct 32 ms 22100 KB Output is correct
53 Correct 28 ms 22100 KB Output is correct
54 Correct 31 ms 22084 KB Output is correct
55 Correct 38 ms 28236 KB Output is correct
56 Correct 51 ms 27656 KB Output is correct
57 Correct 34 ms 21388 KB Output is correct
58 Correct 32 ms 22100 KB Output is correct
59 Correct 33 ms 22092 KB Output is correct
60 Correct 37 ms 22092 KB Output is correct
61 Correct 31 ms 22100 KB Output is correct
62 Correct 35 ms 22084 KB Output is correct
63 Correct 30 ms 22092 KB Output is correct
64 Correct 51 ms 28984 KB Output is correct
65 Correct 45 ms 28984 KB Output is correct
66 Correct 43 ms 25932 KB Output is correct
67 Correct 47 ms 28476 KB Output is correct

Subtask #4
0 / 14.0

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

Subtask #5
0 / 17.0

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

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 1 ms 856 KB Output is correct
10 Correct 1 ms 856 KB Output is correct
11 Correct 1 ms 856 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 856 KB Output is correct
14 Correct 1 ms 856 KB Output is correct
15 Correct 1 ms 684 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 844 KB Output is correct
19 Correct 1 ms 856 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 856 KB Output is correct
24 Correct 1 ms 856 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 2 ms 600 KB Output is correct
30 Correct 2 ms 600 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 856 KB Output is correct
33 Correct 1 ms 856 KB Output is correct
34 Correct 1 ms 856 KB Output is correct
35 Correct 1 ms 856 KB Output is correct
36 Correct 22 ms 14284 KB Output is correct
37 Correct 32 ms 22100 KB Output is correct
38 Correct 33 ms 22092 KB Output is correct
39 Correct 31 ms 22092 KB Output is correct
40 Correct 29 ms 22100 KB Output is correct
41 Correct 38 ms 22084 KB Output is correct
42 Correct 31 ms 22092 KB Output is correct
43 Correct 40 ms 28236 KB Output is correct
44 Correct 46 ms 28236 KB Output is correct
45 Correct 43 ms 26708 KB Output is correct
46 Correct 36 ms 25932 KB Output is correct
47 Correct 40 ms 22072 KB Output is correct
48 Correct 29 ms 22100 KB Output is correct
49 Correct 29 ms 22144 KB Output is correct
50 Correct 35 ms 28336 KB Output is correct
51 Correct 42 ms 28164 KB Output is correct
52 Correct 32 ms 22100 KB Output is correct
53 Correct 28 ms 22100 KB Output is correct
54 Correct 31 ms 22084 KB Output is correct
55 Correct 38 ms 28236 KB Output is correct
56 Correct 51 ms 27656 KB Output is correct
57 Correct 34 ms 21388 KB Output is correct
58 Correct 32 ms 22100 KB Output is correct
59 Correct 33 ms 22092 KB Output is correct
60 Correct 37 ms 22092 KB Output is correct
61 Correct 31 ms 22100 KB Output is correct
62 Correct 35 ms 22084 KB Output is correct
63 Correct 30 ms 22092 KB Output is correct
64 Correct 51 ms 28984 KB Output is correct
65 Correct 45 ms 28984 KB Output is correct
66 Correct 43 ms 25932 KB Output is correct
67 Correct 47 ms 28476 KB Output is correct
68 Execution timed out 4032 ms 21844 KB Time limit exceeded
69 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

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