oj.uz

답안 #978487

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
978487 2024-05-09T09:02:18 Z vjudge1 Team Contest (JOI22_team) C++17
37 / 100
 2000 ms 12564 KB 
#include <time.h>
#include <cstdlib>
#include <stack>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <map>
#include <set>
#include <iterator>
#include <deque>
#include <queue>
#include <sstream>
#include <array>
#include <string>
#include <tuple>
#include <chrono>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <list>
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <bitset>
#define ll long long
using namespace std;

int tt = 1, n;
ll x[200005], y[200005], z[200005];
pair<pair<ll, ll>, pair<ll, int>> p[200005];
ll mx;
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> n;
	for(int i = 1; i <= n; i++){
		cin >> x[i] >> y[i] >> z[i];
		p[i] = {{x[i], y[i]}, {z[i], i}};
	}
	sort(p + 1, p + n + 1);
	for(int i = 3; i <= n; i++){
		set<ll> st;
		vector<pair<ll, ll>> v;
		for(int j = i - 1; j >= 1; j--){
			if(p[i].first.first != p[j].first.first)
				v.push_back({p[j].first.second, j});
		}
		sort(v.begin(), v.end());
		// for(int j = 0; j < v.size(); j++){
		// 	if(j == 0) mx[j] = p[v[j].second].second.first;
		// 	else mx[j] = max(mx[j - 1], p[v[j].second].second.first);
		// }
		int last = 0;
		for(int j = 1; j < v.size(); j++){
			while(last < j && v[last].first != v[j].first){
				st.insert(p[v[last].second].second.first);
				last++;
			}
			if(!st.empty() && p[v[j].second].second.first < *st.rbegin() && v[j].first > p[i].first.second && p[i].second.first < *st.rbegin()){
                mx = max(mx, p[i].first.first + v[j].first + *st.rbegin());
			    // cout << p[i].first.first << " " << v[j].first << " " << *st.rbegin() << "\n";
            }
		}
	}
	if(mx == 0) cout << -1;
	else cout << mx;
}

Compilation message

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

Subtask #1
8.0 / 8.0

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

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6488 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 7 ms 6488 KB Output is correct
15 Correct 4 ms 6744 KB Output is correct
16 Correct 5 ms 6492 KB Output is correct
17 Correct 5 ms 6492 KB Output is correct
18 Correct 5 ms 6492 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 3 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 5 ms 6492 KB Output is correct
23 Correct 1 ms 6748 KB Output is correct
24 Correct 3 ms 6488 KB Output is correct
25 Correct 3 ms 6492 KB Output is correct
26 Correct 1383 ms 7416 KB Output is correct
27 Correct 1272 ms 7188 KB Output is correct
28 Correct 1273 ms 6988 KB Output is correct
29 Correct 1115 ms 7040 KB Output is correct
30 Correct 523 ms 6832 KB Output is correct
31 Correct 1082 ms 7252 KB Output is correct
32 Correct 776 ms 6944 KB Output is correct
33 Correct 68 ms 6748 KB Output is correct
34 Correct 774 ms 7260 KB Output is correct
35 Correct 24 ms 6492 KB Output is correct
36 Correct 26 ms 6700 KB Output is correct
37 Correct 599 ms 6748 KB Output is correct
38 Correct 587 ms 7120 KB Output is correct
39 Correct 109 ms 6736 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Execution timed out 2090 ms 12564 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Execution timed out 2090 ms 12564 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Execution timed out 2090 ms 12564 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Execution timed out 2090 ms 12564 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6488 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 7 ms 6488 KB Output is correct
15 Correct 4 ms 6744 KB Output is correct
16 Correct 5 ms 6492 KB Output is correct
17 Correct 5 ms 6492 KB Output is correct
18 Correct 5 ms 6492 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 3 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 5 ms 6492 KB Output is correct
23 Correct 1 ms 6748 KB Output is correct
24 Correct 3 ms 6488 KB Output is correct
25 Correct 3 ms 6492 KB Output is correct
26 Correct 1383 ms 7416 KB Output is correct
27 Correct 1272 ms 7188 KB Output is correct
28 Correct 1273 ms 6988 KB Output is correct
29 Correct 1115 ms 7040 KB Output is correct
30 Correct 523 ms 6832 KB Output is correct
31 Correct 1082 ms 7252 KB Output is correct
32 Correct 776 ms 6944 KB Output is correct
33 Correct 68 ms 6748 KB Output is correct
34 Correct 774 ms 7260 KB Output is correct
35 Correct 24 ms 6492 KB Output is correct
36 Correct 26 ms 6700 KB Output is correct
37 Correct 599 ms 6748 KB Output is correct
38 Correct 587 ms 7120 KB Output is correct
39 Correct 109 ms 6736 KB Output is correct
40 Correct 1 ms 6492 KB Output is correct
41 Correct 1 ms 6492 KB Output is correct
42 Correct 1 ms 6488 KB Output is correct
43 Correct 1 ms 6488 KB Output is correct
44 Correct 1 ms 6492 KB Output is correct
45 Correct 1 ms 6492 KB Output is correct
46 Correct 1 ms 6492 KB Output is correct
47 Correct 1 ms 6492 KB Output is correct
48 Correct 1 ms 6492 KB Output is correct
49 Correct 1 ms 6492 KB Output is correct
50 Execution timed out 2090 ms 12564 KB Time limit exceeded
51 Halted 0 ms 0 KB -