제출 #879079

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
879079		8pete8	Team Contest (JOI22_team)	C++14	100 / 100	90 ms	8528 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=2e5+5;
bool del[mxn+10];
int x[mxn+10],y[mxn+10],z[mxn+10];
int32_t main(){
	fastio
	int n;cin>>n;
	vector<int>a(n),b(n),c(n);
	iota(all(a),0);
	iota(all(b),0);
	iota(all(c),0);
	for(int i=0;i<n;i++)cin>>x[i]>>y[i]>>z[i];
	sort(all(a),[&](int i,int j){return x[i]>x[j];});
	sort(all(b),[&](int i,int j){return y[i]>y[j];});
	sort(all(c),[&](int i,int j){return z[i]>z[j];});
	int i=0,j=0,k=0;
	while(i<n&&j<n&&k<n){
		if(del[a[i]])i++;
		else if(del[b[j]])j++;
		else if(del[c[k]])k++;
		else if(z[a[i]]==z[c[k]]||y[a[i]]==y[b[j]])del[a[i]]=1;
		else if(x[a[i]]==x[b[j]]||z[c[k]]==z[b[j]])del[b[j]]=1;
		else if(x[a[i]]==x[c[k]]||y[c[k]]==y[b[j]])del[c[k]]=1;
		else {cout<<x[a[i]]+y[b[j]]+z[c[k]];return 0;}
	}
	cout<<-1;
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

team.cpp:31:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
   31 | #pragma GCC optimize ("03,unroll-lopps")
      |                                        ^
team.cpp:36:14: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   36 | int32_t main(){
      |              ^
team.cpp: In function 'int32_t main()':
team.cpp:44:29: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   44 |  sort(all(a),[&](int i,int j){return x[i]>x[j];});
      |                             ^
team.cpp:45:29: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   45 |  sort(all(b),[&](int i,int j){return y[i]>y[j];});
      |                             ^
team.cpp:46:29: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   46 |  sort(all(c),[&](int i,int j){return z[i]>z[j];});
      |                             ^

• 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