Submission #923102

#	Time	Username	Problem	Language	Result	Execution time	Memory
923102		tvladm2009	Team Contest (JOI22_team)	C++17	100 / 100	388 ms	27396 KiB

team

#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
 
using namespace std;
template<typename T1, typename T2> inline void chkmin(T1 &a, T2 b) {if (a > b) a = b;}
template<typename T1, typename T2> inline void chkmax(T1 &a, T2 b) {if (a < b) a = b;}
#define files(FILENAME) read(FILENAME); write(FILENAME)
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define left left228
#define right right228
#define y1 y1228
#define mp make_pair
#define pb push_back
#define y2 y2228
#define rank rank228
using ll = long long;
using ld = long double; 
const string FILENAME = "input";

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//read(FILENAME);
	int n;
	cin >> n;
	vector<vector<int>> a(3, vector<int>(n + 1, 0));
	set<pair<int, int>> s[3];
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j < 3; j++) {
			cin >> a[j][i];
			s[j].insert(mp(a[j][i], i));
		}
	}
	auto del = [&](int x) {
		for (int i = 0; i < 3; i++) {
			s[i].erase(mp(a[i][x], x));
		}
	};
	while (!s[0].empty()) {
		vector<int> kek;
		kek.pb((*prev(s[0].end())).second);
		kek.pb((*prev(s[1].end())).second);
		kek.pb((*prev(s[2].end())).second);
		if (a[0][kek[0]] == a[0][kek[1]]) {
			del(kek[1]);
		} else if (a[0][kek[0]] == a[0][kek[2]]) {
			del(kek[2]);
		} else if (a[1][kek[1]] == a[1][kek[0]]) {
			del(kek[0]);
		} else if (a[1][kek[1]] == a[1][kek[2]]) {
			del(kek[2]);
		} else if (a[2][kek[2]] == a[2][kek[0]]) {
			del(kek[0]);
		} else if (a[2][kek[2]] == a[2][kek[1]]) {
			del(kek[1]);
		} else {
			cout << a[0][kek[0]] + a[1][kek[1]] + a[2][kek[2]] << '\n';
			return 0;
		}
	}
	cout << -1 << '\n';
	return 0;
}
 
 

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