제출 #740411

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
740411		Dan4Life	Team Contest (JOI22_team)	C++17	100 / 100	245 ms	17076 KiB

team

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define int long long
#define all(a) a.begin(),a.end()
const int mxN = (int)1.5e5+10;
using ar = array<int,4>;
vector<ar> coder[3];
bool bad[mxN];
int n;

int32_t main() {
	cin >> n;
	for(int i = 0; i < n; i++){
		int x,y,z; cin >>x>>y>>z;
		for(int j = 0; j < 3; j++) coder[j].pb({x,y,z,i});
	}
	for(int j = 0; j < 3; j++) 
		sort(all(coder[j]),[&](ar a, ar b){ return a[j] < b[j]; });
	int i[] = {n-1,n-1,n-1};
	while(1){
		for(int j = 0; j < 3; j++){
			while(i[j]>=0 and bad[coder[j][i[j]][3]]) i[j]--; 
			if(i[j]<0){cout<<-1;return 0;}
		}
		vector<int> val; val.clear();
		for(int j = 0; j < 3; j++) val.pb(coder[j][i[j]][j]);
		for(int I = 0; I < 3; I++)
			for(int j = 0; j < 3; j++)
				if(I!=j and coder[I][i[I]][j]==val[j])
					bad[coder[I][i[I]][3]]=1;
		bool ok = 1;
		for(int j = 0; j < 3; j++) ok&=!bad[coder[j][i[j]][3]];
		if(ok){ cout << val[0]+val[1]+val[2]; 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