oj.uz

답안 #587904

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
587904 2022-07-02T13:46:49 Z LastRonin Team Contest (JOI22_team) C++14
100 / 100
 687 ms 142248 KB 
#pragma GCC optimize("O3")
 
#include <bits/stdc++.h> 
#define ll long long
#define mp make_pair
#define f first
#define s second
#define pb push_back
#define pill pair<ll, ll>
#define speed ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
using namespace std;
 
const int N = 150002;
const int M = 150002;
const ll hsh[2] = {1555555699, 1222222763};
const ll P = 113;
 
int n;    
int a[N], b[N], c[N];
int sa[N], sb[N], sc[N];
 
 
vector<int> g, g2, g3;
 
struct node {
	node *l = nullptr, *r = nullptr;
	int val = 0;
} *Brt = new node(), *Crt = new node();
 
struct tdnode {
	tdnode *l = nullptr, *r = nullptr;
	node *val = nullptr;
	tdnode() {
		val = new node();
	}
} *tdrt = new tdnode();
 
vector<ll> scan[M];
 
void upd(int p, int z, node *v, int tl = 0, int tr = M + 1) {
	if(tl == tr) {
		v->val = max(v->val, z);
		return;
	}
	ll m = (tl + tr) >> 1ll;
	if(p <= m) {
		if(!v->l)v->l = new node();
		upd(p, z, v->l, tl, m);
	} else {
		if(!v->r)v->r = new node();
		upd(p, z, v->r, m + 1, tr);
	}
	v->val = max(v->val, z);
}
int get(int l, int r, node *v, int tl = 0, int tr = M + 1) {
	if(l > tr || tl > r || !v) 
		return 0;
	if(l <= tl && tr <= r) 
		return v->val;
	ll m = (tl + tr) >> 1ll;
	return max(get(l, r, v->l, tl, m), get(l, r, v->r, m + 1, tr));
}
 
struct seg {
    node *t[4 * N];
    void build(int v = 1, int tl = 0, int tr = g2.size()) {
    	if(tl == tr) {
    		t[v] = new node();
    		return;
    	}
    	int m = (tl + tr) >> 1;
    	build(v * 2, tl, m);
    	build(v * 2 + 1, m + 1, tr);
    	t[v] = new node();
    }
	void upd2(int x, int y, int z, int v = 1, int tl = 0, int tr = g2.size()) {
		if(tl == tr) {
			upd(y, z, t[v]);
			return;
		}
		ll m = (tl + tr) >> 1ll;
		if(x <= m) {
			upd2(x, y, z, v * 2, tl, m);
		} else {
			upd2(x, y, z, v * 2 + 1, m + 1, tr);
		}
		upd(y, z, t[v]);
	} 
	int get2(int lx, int rx, int ly, int ry, int v = 1, int tl = 0, int  tr = g2.size()) {
		if(lx > tr || rx < tl || !t[v])return 0;
		if(lx <= tl && tr <= rx) {
			return get(ly, ry, t[v]);
		}
		ll m = (tl + tr) >> 1ll;
		return max(get2(lx, rx, ly, ry, v * 2, tl , m), get2(lx, rx, ly, ry, v * 2 + 1, m + 1, tr));
	}
} rot; 
 
bool comp2(int i, int j) {
	return b[i] < b[j];
}
 
bool comp1(int i, int j) {
	return c[i] < c[j];
}
 
int main() {
	speed;
	cin >> n;
	for(int i = 1; i <= n; i++) {
		cin >> a[i] >> b[i] >> c[i];
		g.pb(a[i]);
		g2.pb(b[i]);
		g3.pb(c[i]);
	}
	sort(g.begin(), g.end());
	g.erase(unique(g.begin(), g.end()), g.end());
	sort(g2.begin(), g2.end());
	g2.erase(unique(g2.begin(), g2.end()), g2.end());
	sort(g3.begin(), g3.end());
	g3.erase(unique(g3.begin(), g3.end()), g3.end());	
	for(int j = 1; j <= n; j++) {
		sa[j] = lower_bound(g.begin(), g.end(), a[j]) - g.begin() + 1;
		sb[j] = lower_bound(g2.begin(), g2.end(), b[j]) - g2.begin() + 1;
		sc[j] = lower_bound(g3.begin(), g3.end(), c[j]) - g3.begin() + 1;
		scan[sa[j]].pb(j);		
	}
	rot.build();
	int sum = -1;
	for(int i = 1; i <= g.size(); i++) {
		for(auto u : scan[i]) {
			int z = rot.get2(sb[u] + 1, M, sc[u] + 1, M);		
			if(z)sum = max(sum, a[u] + z);
		}
		sort(scan[i].begin(), scan[i].end(), comp1);
		for(auto u : scan[i]) {
			upd(sc[u], sb[u], Crt);	
			int gt2 = get(0, sc[u] - 1, Crt);
			if(gt2 > sb[u] && rot.get2(gt2, M, sc[u], M) < c[u] + g2[gt2 - 1]) {
				rot.upd2(gt2, sc[u], c[u] + g2[gt2 - 1]);			
			}
		}
		sort(scan[i].begin(), scan[i].end(), comp2);
		for(auto u : scan[i]) {
			upd(sb[u], sc[u], Brt);
			int gt = get(0, sb[u] - 1, Brt);
			if(gt > sc[u] && rot.get2(sb[u], M, gt, M) < b[u] + g3[gt - 1]) {
				rot.upd2(sb[u], gt, b[u] + g3[gt - 1]);			
			}
		}
	}
	cout << sum;
}

Compilation message

team.cpp: In function 'int main()':
team.cpp:130:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  130 |  for(int i = 1; i <= g.size(); i++) {
      |                 ~~^~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3796 KB Output is correct
2 Correct 3 ms 3796 KB Output is correct
3 Correct 2 ms 3796 KB Output is correct
4 Correct 3 ms 3796 KB Output is correct
5 Correct 2 ms 3796 KB Output is correct
6 Correct 3 ms 3796 KB Output is correct
7 Correct 2 ms 3796 KB Output is correct
8 Correct 2 ms 3796 KB Output is correct
9 Correct 2 ms 3808 KB Output is correct
10 Correct 2 ms 3796 KB Output is correct
11 Correct 3 ms 3796 KB Output is correct
12 Correct 3 ms 3796 KB Output is correct
13 Correct 2 ms 3796 KB Output is correct
14 Correct 3 ms 3924 KB Output is correct
15 Correct 3 ms 3924 KB Output is correct
16 Correct 4 ms 3944 KB Output is correct
17 Correct 4 ms 4052 KB Output is correct
18 Correct 3 ms 3924 KB Output is correct
19 Correct 3 ms 3924 KB Output is correct
20 Correct 3 ms 3796 KB Output is correct
21 Correct 3 ms 3844 KB Output is correct
22 Correct 3 ms 3924 KB Output is correct
23 Correct 3 ms 3796 KB Output is correct
24 Correct 3 ms 3924 KB Output is correct
25 Correct 3 ms 3924 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3796 KB Output is correct
2 Correct 3 ms 3796 KB Output is correct
3 Correct 2 ms 3796 KB Output is correct
4 Correct 3 ms 3796 KB Output is correct
5 Correct 2 ms 3796 KB Output is correct
6 Correct 3 ms 3796 KB Output is correct
7 Correct 2 ms 3796 KB Output is correct
8 Correct 2 ms 3796 KB Output is correct
9 Correct 2 ms 3808 KB Output is correct
10 Correct 2 ms 3796 KB Output is correct
11 Correct 3 ms 3796 KB Output is correct
12 Correct 3 ms 3796 KB Output is correct
13 Correct 2 ms 3796 KB Output is correct
14 Correct 3 ms 3924 KB Output is correct
15 Correct 3 ms 3924 KB Output is correct
16 Correct 4 ms 3944 KB Output is correct
17 Correct 4 ms 4052 KB Output is correct
18 Correct 3 ms 3924 KB Output is correct
19 Correct 3 ms 3924 KB Output is correct
20 Correct 3 ms 3796 KB Output is correct
21 Correct 3 ms 3844 KB Output is correct
22 Correct 3 ms 3924 KB Output is correct
23 Correct 3 ms 3796 KB Output is correct
24 Correct 3 ms 3924 KB Output is correct
25 Correct 3 ms 3924 KB Output is correct
26 Correct 11 ms 4984 KB Output is correct
27 Correct 11 ms 5096 KB Output is correct
28 Correct 11 ms 5636 KB Output is correct
29 Correct 12 ms 6740 KB Output is correct
30 Correct 9 ms 5460 KB Output is correct
31 Correct 10 ms 4692 KB Output is correct
32 Correct 9 ms 4688 KB Output is correct
33 Correct 6 ms 4180 KB Output is correct
34 Correct 8 ms 4948 KB Output is correct
35 Correct 3 ms 3960 KB Output is correct
36 Correct 3 ms 3924 KB Output is correct
37 Correct 6 ms 4308 KB Output is correct
38 Correct 6 ms 4352 KB Output is correct
39 Correct 4 ms 3924 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3796 KB Output is correct
2 Correct 3 ms 3796 KB Output is correct
3 Correct 3 ms 3868 KB Output is correct
4 Correct 2 ms 3796 KB Output is correct
5 Correct 4 ms 3796 KB Output is correct
6 Correct 2 ms 3796 KB Output is correct
7 Correct 3 ms 3796 KB Output is correct
8 Correct 2 ms 3796 KB Output is correct
9 Correct 3 ms 3796 KB Output is correct
10 Correct 2 ms 3796 KB Output is correct
11 Correct 110 ms 10768 KB Output is correct
12 Correct 72 ms 8824 KB Output is correct
13 Correct 64 ms 9652 KB Output is correct
14 Correct 104 ms 11444 KB Output is correct
15 Correct 85 ms 11044 KB Output is correct
16 Correct 70 ms 11108 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3796 KB Output is correct
2 Correct 3 ms 3796 KB Output is correct
3 Correct 3 ms 3868 KB Output is correct
4 Correct 2 ms 3796 KB Output is correct
5 Correct 4 ms 3796 KB Output is correct
6 Correct 2 ms 3796 KB Output is correct
7 Correct 3 ms 3796 KB Output is correct
8 Correct 2 ms 3796 KB Output is correct
9 Correct 3 ms 3796 KB Output is correct
10 Correct 2 ms 3796 KB Output is correct
11 Correct 110 ms 10768 KB Output is correct
12 Correct 72 ms 8824 KB Output is correct
13 Correct 64 ms 9652 KB Output is correct
14 Correct 104 ms 11444 KB Output is correct
15 Correct 85 ms 11044 KB Output is correct
16 Correct 70 ms 11108 KB Output is correct
17 Correct 2 ms 3796 KB Output is correct
18 Correct 2 ms 3796 KB Output is correct
19 Correct 3 ms 3808 KB Output is correct
20 Correct 3 ms 3848 KB Output is correct
21 Correct 4 ms 3924 KB Output is correct
22 Correct 150 ms 10468 KB Output is correct
23 Correct 132 ms 10288 KB Output is correct
24 Correct 93 ms 9016 KB Output is correct
25 Correct 130 ms 10884 KB Output is correct
26 Correct 91 ms 11032 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3796 KB Output is correct
2 Correct 3 ms 3796 KB Output is correct
3 Correct 3 ms 3868 KB Output is correct
4 Correct 2 ms 3796 KB Output is correct
5 Correct 4 ms 3796 KB Output is correct
6 Correct 2 ms 3796 KB Output is correct
7 Correct 3 ms 3796 KB Output is correct
8 Correct 2 ms 3796 KB Output is correct
9 Correct 3 ms 3796 KB Output is correct
10 Correct 2 ms 3796 KB Output is correct
11 Correct 110 ms 10768 KB Output is correct
12 Correct 72 ms 8824 KB Output is correct
13 Correct 64 ms 9652 KB Output is correct
14 Correct 104 ms 11444 KB Output is correct
15 Correct 85 ms 11044 KB Output is correct
16 Correct 70 ms 11108 KB Output is correct
17 Correct 2 ms 3796 KB Output is correct
18 Correct 2 ms 3796 KB Output is correct
19 Correct 3 ms 3808 KB Output is correct
20 Correct 3 ms 3848 KB Output is correct
21 Correct 4 ms 3924 KB Output is correct
22 Correct 150 ms 10468 KB Output is correct
23 Correct 132 ms 10288 KB Output is correct
24 Correct 93 ms 9016 KB Output is correct
25 Correct 130 ms 10884 KB Output is correct
26 Correct 91 ms 11032 KB Output is correct
27 Correct 3 ms 3924 KB Output is correct
28 Correct 4 ms 3924 KB Output is correct
29 Correct 2 ms 3796 KB Output is correct
30 Correct 3 ms 3796 KB Output is correct
31 Correct 8 ms 4624 KB Output is correct
32 Correct 3 ms 3924 KB Output is correct
33 Correct 4 ms 3924 KB Output is correct
34 Correct 200 ms 10480 KB Output is correct
35 Correct 199 ms 12052 KB Output is correct
36 Correct 212 ms 12844 KB Output is correct
37 Correct 174 ms 13136 KB Output is correct
38 Correct 111 ms 11020 KB Output is correct
39 Correct 86 ms 7972 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3796 KB Output is correct
2 Correct 3 ms 3796 KB Output is correct
3 Correct 3 ms 3868 KB Output is correct
4 Correct 2 ms 3796 KB Output is correct
5 Correct 4 ms 3796 KB Output is correct
6 Correct 2 ms 3796 KB Output is correct
7 Correct 3 ms 3796 KB Output is correct
8 Correct 2 ms 3796 KB Output is correct
9 Correct 3 ms 3796 KB Output is correct
10 Correct 2 ms 3796 KB Output is correct
11 Correct 110 ms 10768 KB Output is correct
12 Correct 72 ms 8824 KB Output is correct
13 Correct 64 ms 9652 KB Output is correct
14 Correct 104 ms 11444 KB Output is correct
15 Correct 85 ms 11044 KB Output is correct
16 Correct 70 ms 11108 KB Output is correct
17 Correct 2 ms 3796 KB Output is correct
18 Correct 2 ms 3796 KB Output is correct
19 Correct 3 ms 3808 KB Output is correct
20 Correct 3 ms 3848 KB Output is correct
21 Correct 4 ms 3924 KB Output is correct
22 Correct 150 ms 10468 KB Output is correct
23 Correct 132 ms 10288 KB Output is correct
24 Correct 93 ms 9016 KB Output is correct
25 Correct 130 ms 10884 KB Output is correct
26 Correct 91 ms 11032 KB Output is correct
27 Correct 3 ms 3924 KB Output is correct
28 Correct 4 ms 3924 KB Output is correct
29 Correct 2 ms 3796 KB Output is correct
30 Correct 3 ms 3796 KB Output is correct
31 Correct 8 ms 4624 KB Output is correct
32 Correct 3 ms 3924 KB Output is correct
33 Correct 4 ms 3924 KB Output is correct
34 Correct 200 ms 10480 KB Output is correct
35 Correct 199 ms 12052 KB Output is correct
36 Correct 212 ms 12844 KB Output is correct
37 Correct 174 ms 13136 KB Output is correct
38 Correct 111 ms 11020 KB Output is correct
39 Correct 86 ms 7972 KB Output is correct
40 Correct 10 ms 5460 KB Output is correct
41 Correct 10 ms 4736 KB Output is correct
42 Correct 6 ms 4364 KB Output is correct
43 Correct 6 ms 4308 KB Output is correct
44 Correct 282 ms 12060 KB Output is correct
45 Correct 308 ms 43156 KB Output is correct
46 Correct 317 ms 39700 KB Output is correct
47 Correct 316 ms 47748 KB Output is correct
48 Correct 137 ms 11108 KB Output is correct

Subtask #7
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3796 KB Output is correct
2 Correct 3 ms 3796 KB Output is correct
3 Correct 2 ms 3796 KB Output is correct
4 Correct 3 ms 3796 KB Output is correct
5 Correct 2 ms 3796 KB Output is correct
6 Correct 3 ms 3796 KB Output is correct
7 Correct 2 ms 3796 KB Output is correct
8 Correct 2 ms 3796 KB Output is correct
9 Correct 2 ms 3808 KB Output is correct
10 Correct 2 ms 3796 KB Output is correct
11 Correct 3 ms 3796 KB Output is correct
12 Correct 3 ms 3796 KB Output is correct
13 Correct 2 ms 3796 KB Output is correct
14 Correct 3 ms 3924 KB Output is correct
15 Correct 3 ms 3924 KB Output is correct
16 Correct 4 ms 3944 KB Output is correct
17 Correct 4 ms 4052 KB Output is correct
18 Correct 3 ms 3924 KB Output is correct
19 Correct 3 ms 3924 KB Output is correct
20 Correct 3 ms 3796 KB Output is correct
21 Correct 3 ms 3844 KB Output is correct
22 Correct 3 ms 3924 KB Output is correct
23 Correct 3 ms 3796 KB Output is correct
24 Correct 3 ms 3924 KB Output is correct
25 Correct 3 ms 3924 KB Output is correct
26 Correct 11 ms 4984 KB Output is correct
27 Correct 11 ms 5096 KB Output is correct
28 Correct 11 ms 5636 KB Output is correct
29 Correct 12 ms 6740 KB Output is correct
30 Correct 9 ms 5460 KB Output is correct
31 Correct 10 ms 4692 KB Output is correct
32 Correct 9 ms 4688 KB Output is correct
33 Correct 6 ms 4180 KB Output is correct
34 Correct 8 ms 4948 KB Output is correct
35 Correct 3 ms 3960 KB Output is correct
36 Correct 3 ms 3924 KB Output is correct
37 Correct 6 ms 4308 KB Output is correct
38 Correct 6 ms 4352 KB Output is correct
39 Correct 4 ms 3924 KB Output is correct
40 Correct 2 ms 3796 KB Output is correct
41 Correct 3 ms 3796 KB Output is correct
42 Correct 3 ms 3868 KB Output is correct
43 Correct 2 ms 3796 KB Output is correct
44 Correct 4 ms 3796 KB Output is correct
45 Correct 2 ms 3796 KB Output is correct
46 Correct 3 ms 3796 KB Output is correct
47 Correct 2 ms 3796 KB Output is correct
48 Correct 3 ms 3796 KB Output is correct
49 Correct 2 ms 3796 KB Output is correct
50 Correct 110 ms 10768 KB Output is correct
51 Correct 72 ms 8824 KB Output is correct
52 Correct 64 ms 9652 KB Output is correct
53 Correct 104 ms 11444 KB Output is correct
54 Correct 85 ms 11044 KB Output is correct
55 Correct 70 ms 11108 KB Output is correct
56 Correct 2 ms 3796 KB Output is correct
57 Correct 2 ms 3796 KB Output is correct
58 Correct 3 ms 3808 KB Output is correct
59 Correct 3 ms 3848 KB Output is correct
60 Correct 4 ms 3924 KB Output is correct
61 Correct 150 ms 10468 KB Output is correct
62 Correct 132 ms 10288 KB Output is correct
63 Correct 93 ms 9016 KB Output is correct
64 Correct 130 ms 10884 KB Output is correct
65 Correct 91 ms 11032 KB Output is correct
66 Correct 3 ms 3924 KB Output is correct
67 Correct 4 ms 3924 KB Output is correct
68 Correct 2 ms 3796 KB Output is correct
69 Correct 3 ms 3796 KB Output is correct
70 Correct 8 ms 4624 KB Output is correct
71 Correct 3 ms 3924 KB Output is correct
72 Correct 4 ms 3924 KB Output is correct
73 Correct 200 ms 10480 KB Output is correct
74 Correct 199 ms 12052 KB Output is correct
75 Correct 212 ms 12844 KB Output is correct
76 Correct 174 ms 13136 KB Output is correct
77 Correct 111 ms 11020 KB Output is correct
78 Correct 86 ms 7972 KB Output is correct
79 Correct 10 ms 5460 KB Output is correct
80 Correct 10 ms 4736 KB Output is correct
81 Correct 6 ms 4364 KB Output is correct
82 Correct 6 ms 4308 KB Output is correct
83 Correct 282 ms 12060 KB Output is correct
84 Correct 308 ms 43156 KB Output is correct
85 Correct 317 ms 39700 KB Output is correct
86 Correct 316 ms 47748 KB Output is correct
87 Correct 137 ms 11108 KB Output is correct
88 Correct 610 ms 46088 KB Output is correct
89 Correct 575 ms 100936 KB Output is correct
90 Correct 554 ms 43828 KB Output is correct
91 Correct 622 ms 142248 KB Output is correct
92 Correct 445 ms 47568 KB Output is correct
93 Correct 687 ms 134016 KB Output is correct
94 Correct 565 ms 124984 KB Output is correct
95 Correct 163 ms 20964 KB Output is correct
96 Correct 296 ms 47868 KB Output is correct
97 Correct 99 ms 12808 KB Output is correct
98 Correct 151 ms 23680 KB Output is correct
99 Correct 173 ms 23632 KB Output is correct