Submission #879071

#	Time	Username	Problem	Language	Result	Execution time	Memory
879071		8pete8	Team Contest (JOI22_team)	C++14	0 / 100	39 ms	4476 KiB

team

#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include<bitset>
#include <numeric>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<pii,int>
#define vi vector<int>
#define pb push_back
//#define p push
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-lopps")
using namespace std;
const int mod=9901,mxn=3*1e5+5;
bool del[mxn+10];
int cnt[3];
int e[mxn+10][3];
int32_t main(){
	fastio
	int n;cin>>n;
	vector<int>v[3];
	for(int i=0;i<3;i++)v[i].resize(n),iota(all(v[i]),0),cnt[i]=n-1;
	for(int i=0;i<n;i++)for(int j=0;j<3;j++)cin>>e[i][j];
	for(int i=0;i<3;i++)sort(all(v[i]),[&](int a,int b){return e[a][i]<e[b][i];});
	while(1){
		for(int i=0;i<3;i++){
			while(cnt[i]>=0&&del[v[i][cnt[i]]])cnt[i]--;
			if(cnt[i]<0){cout<<-1;return 0;}
		}
		for(int i=0;i<3;i++)for(int j=0;j<3;j++)if(i!=j&&e[v[i][cnt[i]]][i]==e[v[j][cnt[j]]][i])del[v[i][cnt[i]]]=true;
		if(!del[v[0][cnt[0]]]&&!del[v[1][cnt[1]]]&&!del[v[2][cnt[2]]]){
			cout<<e[v[0][cnt[0]]][0]+e[v[1][cnt[1]]][1]+e[v[2][cnt[2]]][2];
			return 0;
		}
	}
}

Compilation message (stderr)

team.cpp:31:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
   31 | #pragma GCC optimize ("03,unroll-lopps")
      |                                        ^
team.cpp:37:14: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   37 | int32_t main(){
      |              ^
team.cpp: In function 'int32_t main()':
team.cpp:43:52: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   43 |  for(int i=0;i<3;i++)sort(all(v[i]),[&](int a,int b){return e[a][i]<e[b][i];});
      |                                                    ^

• 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