oj.uz

답안 #587800

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
587800 2022-07-02T11:35:25 Z LastRonin Team Contest (JOI22_team) C++14
73 / 100
 2000 ms 522076 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 = 2e5 + 1;
const int M = 5E5 + 1;
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];


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

void upd2(int x, int y, int z, tdnode *v, int tl = 0, int tr = M + 1) {
	if(tl == tr) {
		upd(y, z, v->val);
		return;
	}
	ll m = (tl + tr) >> 1ll;
	if(x <= m) {
		if(!v->l)v->l = new tdnode();
		upd2(x, y, z, v->l, tl, m);
	} else {
		if(!v->r)v->r = new tdnode();
		upd2(x, y, z, v->r, m + 1, tr);
	}
	upd(y, z, v->val);
}

int get2(int lx, int rx, int ly, int ry, tdnode *v, int tl = 0, int  tr = M + 1) {
	if(lx > tr || rx < tl || !v)return 0;
	if(lx <= tl && tr <= rx) {
		return get(ly, ry, v->val);
	}
	ll m = (tl + tr) >> 1ll;
	return max(get2(lx, rx, ly, ry, v->l, tl , m), get2(lx, rx, ly, ry, v->r, m + 1, tr));
}


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;
	vector<int> g;
	for(int i = 1; i <= n; i++) {
		cin >> a[i] >> b[i] >> c[i];
		g.pb(a[i]);
		g.pb(b[i]);
		g.pb(c[i]);
	}
	sort(g.begin(), g.end());
	g.erase(unique(g.begin(), g.end()), g.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(g.begin(), g.end(), b[j]) - g.begin() + 1;
		sc[j] = lower_bound(g.begin(), g.end(), c[j]) - g.begin() + 1;
		scan[sa[j]].pb(j);		
	}
	int sum = -1;
	for(int i = 1; i <= g.size(); i++) {
		for(auto u : scan[i]) {
			int z = get2(sb[u] + 1, M, sc[u] + 1, M, tdrt);		
			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]) {
				upd2(gt2, sc[u], c[u] + g[gt2 - 1], tdrt);			
			}
		}
		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]) {
				upd2(sb[u], gt, b[u] + g[gt - 1], tdrt);			
			}
		}
	}
	cout << sum;
}

Compilation message

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

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 12116 KB Output is correct
2 Correct 9 ms 12084 KB Output is correct
3 Correct 7 ms 11988 KB Output is correct
4 Correct 7 ms 12076 KB Output is correct
5 Correct 7 ms 12032 KB Output is correct
6 Correct 7 ms 12076 KB Output is correct
7 Correct 9 ms 12080 KB Output is correct
8 Correct 9 ms 11988 KB Output is correct
9 Correct 8 ms 11988 KB Output is correct
10 Correct 8 ms 11992 KB Output is correct
11 Correct 8 ms 11988 KB Output is correct
12 Correct 7 ms 11988 KB Output is correct
13 Correct 8 ms 12032 KB Output is correct
14 Correct 10 ms 13396 KB Output is correct
15 Correct 8 ms 12460 KB Output is correct
16 Correct 9 ms 12708 KB Output is correct
17 Correct 8 ms 12500 KB Output is correct
18 Correct 11 ms 12604 KB Output is correct
19 Correct 9 ms 12244 KB Output is correct
20 Correct 10 ms 12164 KB Output is correct
21 Correct 8 ms 12116 KB Output is correct
22 Correct 10 ms 12080 KB Output is correct
23 Correct 8 ms 12080 KB Output is correct
24 Correct 10 ms 12116 KB Output is correct
25 Correct 9 ms 12048 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 12116 KB Output is correct
2 Correct 9 ms 12084 KB Output is correct
3 Correct 7 ms 11988 KB Output is correct
4 Correct 7 ms 12076 KB Output is correct
5 Correct 7 ms 12032 KB Output is correct
6 Correct 7 ms 12076 KB Output is correct
7 Correct 9 ms 12080 KB Output is correct
8 Correct 9 ms 11988 KB Output is correct
9 Correct 8 ms 11988 KB Output is correct
10 Correct 8 ms 11992 KB Output is correct
11 Correct 8 ms 11988 KB Output is correct
12 Correct 7 ms 11988 KB Output is correct
13 Correct 8 ms 12032 KB Output is correct
14 Correct 10 ms 13396 KB Output is correct
15 Correct 8 ms 12460 KB Output is correct
16 Correct 9 ms 12708 KB Output is correct
17 Correct 8 ms 12500 KB Output is correct
18 Correct 11 ms 12604 KB Output is correct
19 Correct 9 ms 12244 KB Output is correct
20 Correct 10 ms 12164 KB Output is correct
21 Correct 8 ms 12116 KB Output is correct
22 Correct 10 ms 12080 KB Output is correct
23 Correct 8 ms 12080 KB Output is correct
24 Correct 10 ms 12116 KB Output is correct
25 Correct 9 ms 12048 KB Output is correct
26 Correct 56 ms 31564 KB Output is correct
27 Correct 40 ms 23288 KB Output is correct
28 Correct 39 ms 22700 KB Output is correct
29 Correct 23 ms 18004 KB Output is correct
30 Correct 22 ms 16844 KB Output is correct
31 Correct 37 ms 15948 KB Output is correct
32 Correct 26 ms 13820 KB Output is correct
33 Correct 13 ms 12600 KB Output is correct
34 Correct 17 ms 13140 KB Output is correct
35 Correct 10 ms 12212 KB Output is correct
36 Correct 10 ms 12116 KB Output is correct
37 Correct 11 ms 12420 KB Output is correct
38 Correct 15 ms 12500 KB Output is correct
39 Correct 14 ms 12244 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 12036 KB Output is correct
2 Correct 7 ms 12116 KB Output is correct
3 Correct 9 ms 11988 KB Output is correct
4 Correct 8 ms 12076 KB Output is correct
5 Correct 7 ms 12036 KB Output is correct
6 Correct 7 ms 12072 KB Output is correct
7 Correct 9 ms 12052 KB Output is correct
8 Correct 7 ms 11988 KB Output is correct
9 Correct 7 ms 11988 KB Output is correct
10 Correct 7 ms 11988 KB Output is correct
11 Correct 422 ms 19440 KB Output is correct
12 Correct 157 ms 17420 KB Output is correct
13 Correct 109 ms 18308 KB Output is correct
14 Correct 314 ms 20016 KB Output is correct
15 Correct 181 ms 19580 KB Output is correct
16 Correct 80 ms 20528 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 12036 KB Output is correct
2 Correct 7 ms 12116 KB Output is correct
3 Correct 9 ms 11988 KB Output is correct
4 Correct 8 ms 12076 KB Output is correct
5 Correct 7 ms 12036 KB Output is correct
6 Correct 7 ms 12072 KB Output is correct
7 Correct 9 ms 12052 KB Output is correct
8 Correct 7 ms 11988 KB Output is correct
9 Correct 7 ms 11988 KB Output is correct
10 Correct 7 ms 11988 KB Output is correct
11 Correct 422 ms 19440 KB Output is correct
12 Correct 157 ms 17420 KB Output is correct
13 Correct 109 ms 18308 KB Output is correct
14 Correct 314 ms 20016 KB Output is correct
15 Correct 181 ms 19580 KB Output is correct
16 Correct 80 ms 20528 KB Output is correct
17 Correct 7 ms 12076 KB Output is correct
18 Correct 7 ms 12092 KB Output is correct
19 Correct 7 ms 11988 KB Output is correct
20 Correct 9 ms 12076 KB Output is correct
21 Correct 17 ms 12244 KB Output is correct
22 Correct 513 ms 19080 KB Output is correct
23 Correct 394 ms 18976 KB Output is correct
24 Correct 269 ms 17372 KB Output is correct
25 Correct 277 ms 19392 KB Output is correct
26 Correct 178 ms 19540 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 12036 KB Output is correct
2 Correct 7 ms 12116 KB Output is correct
3 Correct 9 ms 11988 KB Output is correct
4 Correct 8 ms 12076 KB Output is correct
5 Correct 7 ms 12036 KB Output is correct
6 Correct 7 ms 12072 KB Output is correct
7 Correct 9 ms 12052 KB Output is correct
8 Correct 7 ms 11988 KB Output is correct
9 Correct 7 ms 11988 KB Output is correct
10 Correct 7 ms 11988 KB Output is correct
11 Correct 422 ms 19440 KB Output is correct
12 Correct 157 ms 17420 KB Output is correct
13 Correct 109 ms 18308 KB Output is correct
14 Correct 314 ms 20016 KB Output is correct
15 Correct 181 ms 19580 KB Output is correct
16 Correct 80 ms 20528 KB Output is correct
17 Correct 7 ms 12076 KB Output is correct
18 Correct 7 ms 12092 KB Output is correct
19 Correct 7 ms 11988 KB Output is correct
20 Correct 9 ms 12076 KB Output is correct
21 Correct 17 ms 12244 KB Output is correct
22 Correct 513 ms 19080 KB Output is correct
23 Correct 394 ms 18976 KB Output is correct
24 Correct 269 ms 17372 KB Output is correct
25 Correct 277 ms 19392 KB Output is correct
26 Correct 178 ms 19540 KB Output is correct
27 Correct 9 ms 12584 KB Output is correct
28 Correct 8 ms 12332 KB Output is correct
29 Correct 7 ms 12116 KB Output is correct
30 Correct 9 ms 12116 KB Output is correct
31 Correct 22 ms 13696 KB Output is correct
32 Correct 10 ms 12116 KB Output is correct
33 Correct 11 ms 12116 KB Output is correct
34 Correct 570 ms 19688 KB Output is correct
35 Correct 483 ms 22948 KB Output is correct
36 Correct 571 ms 23968 KB Output is correct
37 Correct 376 ms 24692 KB Output is correct
38 Correct 191 ms 19424 KB Output is correct
39 Correct 295 ms 17300 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 12036 KB Output is correct
2 Correct 7 ms 12116 KB Output is correct
3 Correct 9 ms 11988 KB Output is correct
4 Correct 8 ms 12076 KB Output is correct
5 Correct 7 ms 12036 KB Output is correct
6 Correct 7 ms 12072 KB Output is correct
7 Correct 9 ms 12052 KB Output is correct
8 Correct 7 ms 11988 KB Output is correct
9 Correct 7 ms 11988 KB Output is correct
10 Correct 7 ms 11988 KB Output is correct
11 Correct 422 ms 19440 KB Output is correct
12 Correct 157 ms 17420 KB Output is correct
13 Correct 109 ms 18308 KB Output is correct
14 Correct 314 ms 20016 KB Output is correct
15 Correct 181 ms 19580 KB Output is correct
16 Correct 80 ms 20528 KB Output is correct
17 Correct 7 ms 12076 KB Output is correct
18 Correct 7 ms 12092 KB Output is correct
19 Correct 7 ms 11988 KB Output is correct
20 Correct 9 ms 12076 KB Output is correct
21 Correct 17 ms 12244 KB Output is correct
22 Correct 513 ms 19080 KB Output is correct
23 Correct 394 ms 18976 KB Output is correct
24 Correct 269 ms 17372 KB Output is correct
25 Correct 277 ms 19392 KB Output is correct
26 Correct 178 ms 19540 KB Output is correct
27 Correct 9 ms 12584 KB Output is correct
28 Correct 8 ms 12332 KB Output is correct
29 Correct 7 ms 12116 KB Output is correct
30 Correct 9 ms 12116 KB Output is correct
31 Correct 22 ms 13696 KB Output is correct
32 Correct 10 ms 12116 KB Output is correct
33 Correct 11 ms 12116 KB Output is correct
34 Correct 570 ms 19688 KB Output is correct
35 Correct 483 ms 22948 KB Output is correct
36 Correct 571 ms 23968 KB Output is correct
37 Correct 376 ms 24692 KB Output is correct
38 Correct 191 ms 19424 KB Output is correct
39 Correct 295 ms 17300 KB Output is correct
40 Correct 29 ms 16836 KB Output is correct
41 Correct 32 ms 15908 KB Output is correct
42 Correct 11 ms 12536 KB Output is correct
43 Correct 12 ms 12448 KB Output is correct
44 Correct 1155 ms 34396 KB Output is correct
45 Correct 738 ms 88996 KB Output is correct
46 Correct 795 ms 80412 KB Output is correct
47 Correct 593 ms 94628 KB Output is correct
48 Correct 212 ms 20028 KB Output is correct

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 12116 KB Output is correct
2 Correct 9 ms 12084 KB Output is correct
3 Correct 7 ms 11988 KB Output is correct
4 Correct 7 ms 12076 KB Output is correct
5 Correct 7 ms 12032 KB Output is correct
6 Correct 7 ms 12076 KB Output is correct
7 Correct 9 ms 12080 KB Output is correct
8 Correct 9 ms 11988 KB Output is correct
9 Correct 8 ms 11988 KB Output is correct
10 Correct 8 ms 11992 KB Output is correct
11 Correct 8 ms 11988 KB Output is correct
12 Correct 7 ms 11988 KB Output is correct
13 Correct 8 ms 12032 KB Output is correct
14 Correct 10 ms 13396 KB Output is correct
15 Correct 8 ms 12460 KB Output is correct
16 Correct 9 ms 12708 KB Output is correct
17 Correct 8 ms 12500 KB Output is correct
18 Correct 11 ms 12604 KB Output is correct
19 Correct 9 ms 12244 KB Output is correct
20 Correct 10 ms 12164 KB Output is correct
21 Correct 8 ms 12116 KB Output is correct
22 Correct 10 ms 12080 KB Output is correct
23 Correct 8 ms 12080 KB Output is correct
24 Correct 10 ms 12116 KB Output is correct
25 Correct 9 ms 12048 KB Output is correct
26 Correct 56 ms 31564 KB Output is correct
27 Correct 40 ms 23288 KB Output is correct
28 Correct 39 ms 22700 KB Output is correct
29 Correct 23 ms 18004 KB Output is correct
30 Correct 22 ms 16844 KB Output is correct
31 Correct 37 ms 15948 KB Output is correct
32 Correct 26 ms 13820 KB Output is correct
33 Correct 13 ms 12600 KB Output is correct
34 Correct 17 ms 13140 KB Output is correct
35 Correct 10 ms 12212 KB Output is correct
36 Correct 10 ms 12116 KB Output is correct
37 Correct 11 ms 12420 KB Output is correct
38 Correct 15 ms 12500 KB Output is correct
39 Correct 14 ms 12244 KB Output is correct
40 Correct 8 ms 12036 KB Output is correct
41 Correct 7 ms 12116 KB Output is correct
42 Correct 9 ms 11988 KB Output is correct
43 Correct 8 ms 12076 KB Output is correct
44 Correct 7 ms 12036 KB Output is correct
45 Correct 7 ms 12072 KB Output is correct
46 Correct 9 ms 12052 KB Output is correct
47 Correct 7 ms 11988 KB Output is correct
48 Correct 7 ms 11988 KB Output is correct
49 Correct 7 ms 11988 KB Output is correct
50 Correct 422 ms 19440 KB Output is correct
51 Correct 157 ms 17420 KB Output is correct
52 Correct 109 ms 18308 KB Output is correct
53 Correct 314 ms 20016 KB Output is correct
54 Correct 181 ms 19580 KB Output is correct
55 Correct 80 ms 20528 KB Output is correct
56 Correct 7 ms 12076 KB Output is correct
57 Correct 7 ms 12092 KB Output is correct
58 Correct 7 ms 11988 KB Output is correct
59 Correct 9 ms 12076 KB Output is correct
60 Correct 17 ms 12244 KB Output is correct
61 Correct 513 ms 19080 KB Output is correct
62 Correct 394 ms 18976 KB Output is correct
63 Correct 269 ms 17372 KB Output is correct
64 Correct 277 ms 19392 KB Output is correct
65 Correct 178 ms 19540 KB Output is correct
66 Correct 9 ms 12584 KB Output is correct
67 Correct 8 ms 12332 KB Output is correct
68 Correct 7 ms 12116 KB Output is correct
69 Correct 9 ms 12116 KB Output is correct
70 Correct 22 ms 13696 KB Output is correct
71 Correct 10 ms 12116 KB Output is correct
72 Correct 11 ms 12116 KB Output is correct
73 Correct 570 ms 19688 KB Output is correct
74 Correct 483 ms 22948 KB Output is correct
75 Correct 571 ms 23968 KB Output is correct
76 Correct 376 ms 24692 KB Output is correct
77 Correct 191 ms 19424 KB Output is correct
78 Correct 295 ms 17300 KB Output is correct
79 Correct 29 ms 16836 KB Output is correct
80 Correct 32 ms 15908 KB Output is correct
81 Correct 11 ms 12536 KB Output is correct
82 Correct 12 ms 12448 KB Output is correct
83 Correct 1155 ms 34396 KB Output is correct
84 Correct 738 ms 88996 KB Output is correct
85 Correct 795 ms 80412 KB Output is correct
86 Correct 593 ms 94628 KB Output is correct
87 Correct 212 ms 20028 KB Output is correct
88 Execution timed out 2061 ms 522076 KB Time limit exceeded
89 Halted 0 ms 0 KB -