oj.uz

답안 #587810

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
587810 2022-07-02T11:44:11 Z LastRonin Team Contest (JOI22_team) C++14
73 / 100
 2000 ms 409300 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, g2, g3;
	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);		
	}
	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] + g2[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] + g3[gt - 1], tdrt);			
			}
		}
	}
	cout << sum;
}

Compilation message

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

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 7 ms 12116 KB Output is correct
3 Correct 7 ms 12076 KB Output is correct
4 Correct 7 ms 12076 KB Output is correct
5 Correct 7 ms 12116 KB Output is correct
6 Correct 6 ms 12012 KB Output is correct
7 Correct 6 ms 12116 KB Output is correct
8 Correct 7 ms 11988 KB Output is correct
9 Correct 7 ms 12080 KB Output is correct
10 Correct 7 ms 11988 KB Output is correct
11 Correct 7 ms 11988 KB Output is correct
12 Correct 7 ms 11988 KB Output is correct
13 Correct 7 ms 11988 KB Output is correct
14 Correct 9 ms 12980 KB Output is correct
15 Correct 9 ms 12372 KB Output is correct
16 Correct 9 ms 12500 KB Output is correct
17 Correct 8 ms 12372 KB Output is correct
18 Correct 9 ms 12500 KB Output is correct
19 Correct 9 ms 12244 KB Output is correct
20 Correct 7 ms 12152 KB Output is correct
21 Correct 7 ms 12116 KB Output is correct
22 Correct 7 ms 12120 KB Output is correct
23 Correct 7 ms 12096 KB Output is correct
24 Correct 8 ms 12116 KB Output is correct
25 Correct 9 ms 12116 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 7 ms 12116 KB Output is correct
3 Correct 7 ms 12076 KB Output is correct
4 Correct 7 ms 12076 KB Output is correct
5 Correct 7 ms 12116 KB Output is correct
6 Correct 6 ms 12012 KB Output is correct
7 Correct 6 ms 12116 KB Output is correct
8 Correct 7 ms 11988 KB Output is correct
9 Correct 7 ms 12080 KB Output is correct
10 Correct 7 ms 11988 KB Output is correct
11 Correct 7 ms 11988 KB Output is correct
12 Correct 7 ms 11988 KB Output is correct
13 Correct 7 ms 11988 KB Output is correct
14 Correct 9 ms 12980 KB Output is correct
15 Correct 9 ms 12372 KB Output is correct
16 Correct 9 ms 12500 KB Output is correct
17 Correct 8 ms 12372 KB Output is correct
18 Correct 9 ms 12500 KB Output is correct
19 Correct 9 ms 12244 KB Output is correct
20 Correct 7 ms 12152 KB Output is correct
21 Correct 7 ms 12116 KB Output is correct
22 Correct 7 ms 12120 KB Output is correct
23 Correct 7 ms 12096 KB Output is correct
24 Correct 8 ms 12116 KB Output is correct
25 Correct 9 ms 12116 KB Output is correct
26 Correct 45 ms 24608 KB Output is correct
27 Correct 33 ms 19408 KB Output is correct
28 Correct 32 ms 19028 KB Output is correct
29 Correct 22 ms 16212 KB Output is correct
30 Correct 19 ms 16264 KB Output is correct
31 Correct 29 ms 15692 KB Output is correct
32 Correct 18 ms 13732 KB Output is correct
33 Correct 12 ms 12472 KB Output is correct
34 Correct 11 ms 12860 KB Output is correct
35 Correct 8 ms 12116 KB Output is correct
36 Correct 7 ms 12116 KB Output is correct
37 Correct 10 ms 12500 KB Output is correct
38 Correct 12 ms 12500 KB Output is correct
39 Correct 13 ms 12220 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12120 KB Output is correct
2 Correct 7 ms 12120 KB Output is correct
3 Correct 7 ms 12000 KB Output is correct
4 Correct 7 ms 12116 KB Output is correct
5 Correct 7 ms 12116 KB Output is correct
6 Correct 7 ms 12008 KB Output is correct
7 Correct 7 ms 12016 KB Output is correct
8 Correct 7 ms 12116 KB Output is correct
9 Correct 7 ms 11988 KB Output is correct
10 Correct 7 ms 11988 KB Output is correct
11 Correct 329 ms 19704 KB Output is correct
12 Correct 148 ms 17432 KB Output is correct
13 Correct 81 ms 18624 KB Output is correct
14 Correct 245 ms 20408 KB Output is correct
15 Correct 163 ms 20032 KB Output is correct
16 Correct 76 ms 20044 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12120 KB Output is correct
2 Correct 7 ms 12120 KB Output is correct
3 Correct 7 ms 12000 KB Output is correct
4 Correct 7 ms 12116 KB Output is correct
5 Correct 7 ms 12116 KB Output is correct
6 Correct 7 ms 12008 KB Output is correct
7 Correct 7 ms 12016 KB Output is correct
8 Correct 7 ms 12116 KB Output is correct
9 Correct 7 ms 11988 KB Output is correct
10 Correct 7 ms 11988 KB Output is correct
11 Correct 329 ms 19704 KB Output is correct
12 Correct 148 ms 17432 KB Output is correct
13 Correct 81 ms 18624 KB Output is correct
14 Correct 245 ms 20408 KB Output is correct
15 Correct 163 ms 20032 KB Output is correct
16 Correct 76 ms 20044 KB Output is correct
17 Correct 7 ms 12076 KB Output is correct
18 Correct 7 ms 11988 KB Output is correct
19 Correct 7 ms 12076 KB Output is correct
20 Correct 10 ms 12116 KB Output is correct
21 Correct 14 ms 12244 KB Output is correct
22 Correct 450 ms 18708 KB Output is correct
23 Correct 362 ms 18528 KB Output is correct
24 Correct 215 ms 17080 KB Output is correct
25 Correct 265 ms 18992 KB Output is correct
26 Correct 165 ms 19220 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12120 KB Output is correct
2 Correct 7 ms 12120 KB Output is correct
3 Correct 7 ms 12000 KB Output is correct
4 Correct 7 ms 12116 KB Output is correct
5 Correct 7 ms 12116 KB Output is correct
6 Correct 7 ms 12008 KB Output is correct
7 Correct 7 ms 12016 KB Output is correct
8 Correct 7 ms 12116 KB Output is correct
9 Correct 7 ms 11988 KB Output is correct
10 Correct 7 ms 11988 KB Output is correct
11 Correct 329 ms 19704 KB Output is correct
12 Correct 148 ms 17432 KB Output is correct
13 Correct 81 ms 18624 KB Output is correct
14 Correct 245 ms 20408 KB Output is correct
15 Correct 163 ms 20032 KB Output is correct
16 Correct 76 ms 20044 KB Output is correct
17 Correct 7 ms 12076 KB Output is correct
18 Correct 7 ms 11988 KB Output is correct
19 Correct 7 ms 12076 KB Output is correct
20 Correct 10 ms 12116 KB Output is correct
21 Correct 14 ms 12244 KB Output is correct
22 Correct 450 ms 18708 KB Output is correct
23 Correct 362 ms 18528 KB Output is correct
24 Correct 215 ms 17080 KB Output is correct
25 Correct 265 ms 18992 KB Output is correct
26 Correct 165 ms 19220 KB Output is correct
27 Correct 8 ms 12500 KB Output is correct
28 Correct 8 ms 12260 KB Output is correct
29 Correct 17 ms 12124 KB Output is correct
30 Correct 7 ms 12116 KB Output is correct
31 Correct 18 ms 13768 KB Output is correct
32 Correct 8 ms 12116 KB Output is correct
33 Correct 8 ms 12200 KB Output is correct
34 Correct 574 ms 19260 KB Output is correct
35 Correct 447 ms 22756 KB Output is correct
36 Correct 469 ms 23568 KB Output is correct
37 Correct 348 ms 24424 KB Output is correct
38 Correct 169 ms 19064 KB Output is correct
39 Correct 246 ms 16704 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12120 KB Output is correct
2 Correct 7 ms 12120 KB Output is correct
3 Correct 7 ms 12000 KB Output is correct
4 Correct 7 ms 12116 KB Output is correct
5 Correct 7 ms 12116 KB Output is correct
6 Correct 7 ms 12008 KB Output is correct
7 Correct 7 ms 12016 KB Output is correct
8 Correct 7 ms 12116 KB Output is correct
9 Correct 7 ms 11988 KB Output is correct
10 Correct 7 ms 11988 KB Output is correct
11 Correct 329 ms 19704 KB Output is correct
12 Correct 148 ms 17432 KB Output is correct
13 Correct 81 ms 18624 KB Output is correct
14 Correct 245 ms 20408 KB Output is correct
15 Correct 163 ms 20032 KB Output is correct
16 Correct 76 ms 20044 KB Output is correct
17 Correct 7 ms 12076 KB Output is correct
18 Correct 7 ms 11988 KB Output is correct
19 Correct 7 ms 12076 KB Output is correct
20 Correct 10 ms 12116 KB Output is correct
21 Correct 14 ms 12244 KB Output is correct
22 Correct 450 ms 18708 KB Output is correct
23 Correct 362 ms 18528 KB Output is correct
24 Correct 215 ms 17080 KB Output is correct
25 Correct 265 ms 18992 KB Output is correct
26 Correct 165 ms 19220 KB Output is correct
27 Correct 8 ms 12500 KB Output is correct
28 Correct 8 ms 12260 KB Output is correct
29 Correct 17 ms 12124 KB Output is correct
30 Correct 7 ms 12116 KB Output is correct
31 Correct 18 ms 13768 KB Output is correct
32 Correct 8 ms 12116 KB Output is correct
33 Correct 8 ms 12200 KB Output is correct
34 Correct 574 ms 19260 KB Output is correct
35 Correct 447 ms 22756 KB Output is correct
36 Correct 469 ms 23568 KB Output is correct
37 Correct 348 ms 24424 KB Output is correct
38 Correct 169 ms 19064 KB Output is correct
39 Correct 246 ms 16704 KB Output is correct
40 Correct 20 ms 16212 KB Output is correct
41 Correct 28 ms 15752 KB Output is correct
42 Correct 10 ms 12376 KB Output is correct
43 Correct 13 ms 12372 KB Output is correct
44 Correct 1098 ms 33732 KB Output is correct
45 Correct 627 ms 88236 KB Output is correct
46 Correct 721 ms 79540 KB Output is correct
47 Correct 569 ms 93836 KB Output is correct
48 Correct 180 ms 19200 KB Output is correct

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 7 ms 12116 KB Output is correct
3 Correct 7 ms 12076 KB Output is correct
4 Correct 7 ms 12076 KB Output is correct
5 Correct 7 ms 12116 KB Output is correct
6 Correct 6 ms 12012 KB Output is correct
7 Correct 6 ms 12116 KB Output is correct
8 Correct 7 ms 11988 KB Output is correct
9 Correct 7 ms 12080 KB Output is correct
10 Correct 7 ms 11988 KB Output is correct
11 Correct 7 ms 11988 KB Output is correct
12 Correct 7 ms 11988 KB Output is correct
13 Correct 7 ms 11988 KB Output is correct
14 Correct 9 ms 12980 KB Output is correct
15 Correct 9 ms 12372 KB Output is correct
16 Correct 9 ms 12500 KB Output is correct
17 Correct 8 ms 12372 KB Output is correct
18 Correct 9 ms 12500 KB Output is correct
19 Correct 9 ms 12244 KB Output is correct
20 Correct 7 ms 12152 KB Output is correct
21 Correct 7 ms 12116 KB Output is correct
22 Correct 7 ms 12120 KB Output is correct
23 Correct 7 ms 12096 KB Output is correct
24 Correct 8 ms 12116 KB Output is correct
25 Correct 9 ms 12116 KB Output is correct
26 Correct 45 ms 24608 KB Output is correct
27 Correct 33 ms 19408 KB Output is correct
28 Correct 32 ms 19028 KB Output is correct
29 Correct 22 ms 16212 KB Output is correct
30 Correct 19 ms 16264 KB Output is correct
31 Correct 29 ms 15692 KB Output is correct
32 Correct 18 ms 13732 KB Output is correct
33 Correct 12 ms 12472 KB Output is correct
34 Correct 11 ms 12860 KB Output is correct
35 Correct 8 ms 12116 KB Output is correct
36 Correct 7 ms 12116 KB Output is correct
37 Correct 10 ms 12500 KB Output is correct
38 Correct 12 ms 12500 KB Output is correct
39 Correct 13 ms 12220 KB Output is correct
40 Correct 7 ms 12120 KB Output is correct
41 Correct 7 ms 12120 KB Output is correct
42 Correct 7 ms 12000 KB Output is correct
43 Correct 7 ms 12116 KB Output is correct
44 Correct 7 ms 12116 KB Output is correct
45 Correct 7 ms 12008 KB Output is correct
46 Correct 7 ms 12016 KB Output is correct
47 Correct 7 ms 12116 KB Output is correct
48 Correct 7 ms 11988 KB Output is correct
49 Correct 7 ms 11988 KB Output is correct
50 Correct 329 ms 19704 KB Output is correct
51 Correct 148 ms 17432 KB Output is correct
52 Correct 81 ms 18624 KB Output is correct
53 Correct 245 ms 20408 KB Output is correct
54 Correct 163 ms 20032 KB Output is correct
55 Correct 76 ms 20044 KB Output is correct
56 Correct 7 ms 12076 KB Output is correct
57 Correct 7 ms 11988 KB Output is correct
58 Correct 7 ms 12076 KB Output is correct
59 Correct 10 ms 12116 KB Output is correct
60 Correct 14 ms 12244 KB Output is correct
61 Correct 450 ms 18708 KB Output is correct
62 Correct 362 ms 18528 KB Output is correct
63 Correct 215 ms 17080 KB Output is correct
64 Correct 265 ms 18992 KB Output is correct
65 Correct 165 ms 19220 KB Output is correct
66 Correct 8 ms 12500 KB Output is correct
67 Correct 8 ms 12260 KB Output is correct
68 Correct 17 ms 12124 KB Output is correct
69 Correct 7 ms 12116 KB Output is correct
70 Correct 18 ms 13768 KB Output is correct
71 Correct 8 ms 12116 KB Output is correct
72 Correct 8 ms 12200 KB Output is correct
73 Correct 574 ms 19260 KB Output is correct
74 Correct 447 ms 22756 KB Output is correct
75 Correct 469 ms 23568 KB Output is correct
76 Correct 348 ms 24424 KB Output is correct
77 Correct 169 ms 19064 KB Output is correct
78 Correct 246 ms 16704 KB Output is correct
79 Correct 20 ms 16212 KB Output is correct
80 Correct 28 ms 15752 KB Output is correct
81 Correct 10 ms 12376 KB Output is correct
82 Correct 13 ms 12372 KB Output is correct
83 Correct 1098 ms 33732 KB Output is correct
84 Correct 627 ms 88236 KB Output is correct
85 Correct 721 ms 79540 KB Output is correct
86 Correct 569 ms 93836 KB Output is correct
87 Correct 180 ms 19200 KB Output is correct
88 Execution timed out 2102 ms 409300 KB Time limit exceeded
89 Halted 0 ms 0 KB -