답안 #587534

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
587534	2022-07-02T05:02:24 Z	Tekor	Team Contest (JOI22_team)	C++17	46 / 100	2000 ms	5256 KB

team

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(v) v.begin(),v.end()
void boos() {
	ios_base :: sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
}
const int N = 3e5 + 100;
const ll LLINF = (ll)1e18;
ll a[N],b[N],c[N];
int n;
bool cmp(int x,int y) {
	return a[x] < a[y];
}
bool cmp1(int x,int y) {
	return b[x] < b[y];
}
ll check(ll x,ll y,ll t) {
	bool ch = 0,ch1 = 0,ch2 = 0;
	for(int i = 1;i <= n;i++) {
		if(a[i] == x && b[i] < y && c[i] < t)ch = 1;
		if(a[i] < x && b[i] == y && c[i] < t)ch1 = 1;
		if(a[i] < x && b[i] < y && c[i] == t)ch2 = 1;
	}
	if(ch && ch1 && ch2)return x + y + t;
	else return -1;
}
void solve() {
	cin >> n;
	vector <int> g,q;
	ll mx = 0;
	for(int i = 1;i <= n;i++) {
		cin >> a[i] >> b[i] >> c[i];
		mx = max(mx,a[i]);
		mx = max(mx,b[i]);
		mx = max(mx,c[i]);
		g.pb(i);
		q.pb(i);
	}
	ll ans = -1;
	if(mx <= 30) {
		for(int i = 1;i <= mx;i++) {
			for(int j = 1;j <= mx;j++) {
				for(int h = 1;h <= mx;h++) {
					ans = max(ans,check(i,j,h));
				}
			}
		}
		cout << ans;
		return;
	}
	sort(all(g),cmp);
	sort(all(q),cmp1);
	for(auto v : g) {
		ll mxa = a[v];
		set <ll> tt;
		//cout << v << " -- " << a[v] << endl;
		for(int j = 0;j < q.size();j++) {
			int to = q[j];
			ll mxb = b[to];
			//cout << to << " :: " << b[to] << " == ";
			if(j > 0 && b[q[j - 1]] != b[to]) {
				int pos = j - 1;
				while(pos >= 0 && b[q[pos]] == b[q[j - 1]]) {
					int p = q[pos];
					if(a[p] < mxa)tt.insert(c[p]);
					pos--;
				}	
			}
			if(a[to] >= mxa || b[v] >= mxb) {
				//cout << "fail" << endl;
				continue;
			}
			if(!tt.empty()) {
				ll val = *(tt.rbegin());
				if(val > max(c[v],c[to]))ans = max(ans,mxa + mxb + val);
				//cout << val << " ";
			}
			//cout << ans << endl;
		}
		//cout << ans << endl;
	} 
	cout << ans;
}
int main() {
	boos();
	solve();
}

Compilation message

team.cpp: In function 'void solve()':
team.cpp:61:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |   for(int j = 0;j < q.size();j++) {
      |                 ~~^~~~~~~~~~

Subtask #1

8.0 / 8.0

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

Subtask #2

29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	5 ms	340 KB	Output is correct
15	Correct	3 ms	340 KB	Output is correct
16	Correct	3 ms	340 KB	Output is correct
17	Correct	3 ms	340 KB	Output is correct
18	Correct	4 ms	364 KB	Output is correct
19	Correct	3 ms	340 KB	Output is correct
20	Correct	5 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	4 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	4 ms	340 KB	Output is correct
25	Correct	3 ms	340 KB	Output is correct
26	Correct	1012 ms	764 KB	Output is correct
27	Correct	1066 ms	500 KB	Output is correct
28	Correct	895 ms	468 KB	Output is correct
29	Correct	742 ms	536 KB	Output is correct
30	Correct	371 ms	468 KB	Output is correct
31	Correct	720 ms	512 KB	Output is correct
32	Correct	390 ms	468 KB	Output is correct
33	Correct	67 ms	516 KB	Output is correct
34	Correct	766 ms	744 KB	Output is correct
35	Correct	21 ms	340 KB	Output is correct
36	Correct	20 ms	400 KB	Output is correct
37	Correct	545 ms	476 KB	Output is correct
38	Correct	557 ms	608 KB	Output is correct
39	Correct	47 ms	340 KB	Output is correct

Subtask #3

9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	125 ms	5200 KB	Output is correct
12	Correct	87 ms	3684 KB	Output is correct
13	Correct	71 ms	4420 KB	Output is correct
14	Correct	125 ms	5216 KB	Output is correct
15	Correct	85 ms	5256 KB	Output is correct
16	Correct	26 ms	5192 KB	Output is correct

Subtask #4

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	125 ms	5200 KB	Output is correct
12	Correct	87 ms	3684 KB	Output is correct
13	Correct	71 ms	4420 KB	Output is correct
14	Correct	125 ms	5216 KB	Output is correct
15	Correct	85 ms	5256 KB	Output is correct
16	Correct	26 ms	5192 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	5 ms	340 KB	Output is correct
21	Correct	47 ms	396 KB	Output is correct
22	Execution timed out	2084 ms	5192 KB	Time limit exceeded
23	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	125 ms	5200 KB	Output is correct
12	Correct	87 ms	3684 KB	Output is correct
13	Correct	71 ms	4420 KB	Output is correct
14	Correct	125 ms	5216 KB	Output is correct
15	Correct	85 ms	5256 KB	Output is correct
16	Correct	26 ms	5192 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	5 ms	340 KB	Output is correct
21	Correct	47 ms	396 KB	Output is correct
22	Execution timed out	2084 ms	5192 KB	Time limit exceeded
23	Halted	0 ms	0 KB	-

Subtask #6

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	125 ms	5200 KB	Output is correct
12	Correct	87 ms	3684 KB	Output is correct
13	Correct	71 ms	4420 KB	Output is correct
14	Correct	125 ms	5216 KB	Output is correct
15	Correct	85 ms	5256 KB	Output is correct
16	Correct	26 ms	5192 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	5 ms	340 KB	Output is correct
21	Correct	47 ms	396 KB	Output is correct
22	Execution timed out	2084 ms	5192 KB	Time limit exceeded
23	Halted	0 ms	0 KB	-

Subtask #7

0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	5 ms	340 KB	Output is correct
15	Correct	3 ms	340 KB	Output is correct
16	Correct	3 ms	340 KB	Output is correct
17	Correct	3 ms	340 KB	Output is correct
18	Correct	4 ms	364 KB	Output is correct
19	Correct	3 ms	340 KB	Output is correct
20	Correct	5 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	4 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	4 ms	340 KB	Output is correct
25	Correct	3 ms	340 KB	Output is correct
26	Correct	1012 ms	764 KB	Output is correct
27	Correct	1066 ms	500 KB	Output is correct
28	Correct	895 ms	468 KB	Output is correct
29	Correct	742 ms	536 KB	Output is correct
30	Correct	371 ms	468 KB	Output is correct
31	Correct	720 ms	512 KB	Output is correct
32	Correct	390 ms	468 KB	Output is correct
33	Correct	67 ms	516 KB	Output is correct
34	Correct	766 ms	744 KB	Output is correct
35	Correct	21 ms	340 KB	Output is correct
36	Correct	20 ms	400 KB	Output is correct
37	Correct	545 ms	476 KB	Output is correct
38	Correct	557 ms	608 KB	Output is correct
39	Correct	47 ms	340 KB	Output is correct
40	Correct	0 ms	340 KB	Output is correct
41	Correct	0 ms	340 KB	Output is correct
42	Correct	0 ms	340 KB	Output is correct
43	Correct	0 ms	340 KB	Output is correct
44	Correct	0 ms	340 KB	Output is correct
45	Correct	1 ms	340 KB	Output is correct
46	Correct	1 ms	340 KB	Output is correct
47	Correct	1 ms	340 KB	Output is correct
48	Correct	0 ms	340 KB	Output is correct
49	Correct	0 ms	340 KB	Output is correct
50	Correct	125 ms	5200 KB	Output is correct
51	Correct	87 ms	3684 KB	Output is correct
52	Correct	71 ms	4420 KB	Output is correct
53	Correct	125 ms	5216 KB	Output is correct
54	Correct	85 ms	5256 KB	Output is correct
55	Correct	26 ms	5192 KB	Output is correct
56	Correct	0 ms	340 KB	Output is correct
57	Correct	0 ms	340 KB	Output is correct
58	Correct	0 ms	340 KB	Output is correct
59	Correct	5 ms	340 KB	Output is correct
60	Correct	47 ms	396 KB	Output is correct
61	Execution timed out	2084 ms	5192 KB	Time limit exceeded
62	Halted	0 ms	0 KB	-