제출 #1125187

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1125187		pan	Team Contest (JOI22_team)	C++20	0 / 100	1 ms	328 KiB

team

#include <bits/stdc++.h>
//#include "includeall.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i) 
#define RFOR(i, x, n) for (ll i =x; i>=n; --i) 
using namespace std;
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
//typedef __int128 ull;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<pi, ll> pii;
typedef pair<pi, pi> piii;


int main()
{
	ll n, x, y, z;
	cin >> n;
	vector<pi> xx, yy, zz;
	vector<ll> kill(n, 0);
	for (ll i=0; i<n; ++i)
	{
		cin >> x >> y >> z;
		xx.pb(mp(x, i)); yy.pb(mp(y, i)); zz.pb(mp(z, i));
	}
	sort(all(xx), greater<pi> ()); sort(all(yy), greater<pi> ()); sort(all(zz), greater<pi> ()); 
	ll ptr1 =0, ptr2 = 0, ptr3 = 0;
	while (ptr1 < n && ptr2 < n && ptr3 < n)
	{
		ll x1 = xx[ptr1].s, y1 = yy[ptr2].s, z1 = zz[ptr3].s;
		ll die = 0;
		if (x1==y1 || x1==z1) kill[x1] = die = 1;
		if (y1==z1) kill[y1] = die = 1;
		if (!die)
		{
			cout << xx[ptr1].f +  yy[ptr2].f  + zz[ptr3].f << endl;
			exit(0);
		}
		while (ptr1 < n && kill[xx[ptr1].s]) ptr1++;
		while (ptr2 < n && kill[yy[ptr2].s]) ptr2++;
		while (ptr3 < n && kill[yy[ptr3].s]) ptr3++;
	}
	cout << -1 << endl;
	return 0;
}

• 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