Submission #978455

#	Time	Username	Problem	Language	Result	Execution time	Memory
978455		vjudge1	Team Contest (JOI22_team)	C++17	0 / 100	2092 ms	13208 KiB

team

#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;
		// cout << v.size() << "\n";
		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()) mx = max(mx, p[i].first.first + v[j].first + *st.rbegin());
			// if(!st.empty()) cout << p[i].first.first << " " << v[j].first << " " << *st.rbegin() << "\n";
		}
	}
	if(mx == 0) cout << -1;
	else cout << mx;
}

Compilation message (stderr)

team.cpp: In function 'int main()':
team.cpp:57: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]
   57 |   for(int j = 1; j < v.size(); j++){
      |                  ~~^~~~~~~~~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 29
• Subtask 3: 0 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 27