Submission #892163

#	Time	Username	Problem	Language	Result	Execution time	Memory
892163		vjudge1	Team Contest (JOI22_team)	C++17	8 / 100	2090 ms	4616 KiB

team

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")
#define pii pair<int,int>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define f first
#define s second
#define pii pair<int,int>
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
	tree_order_statistics_node_update> ordered_set;
const int mod= 1e9 +7;
const int N=1e5*4;

int binpow (int a, int n) {
	if (n == 0)
		return 1;
	if (n % 2 == 1)
		return binpow (a, n-1) * a;
	else {
		int b = binpow (a, n/2);
		return b * b;
	}
}


void solve(){
	int n,m,k;
	cin>>n;
	vector<int>a(n+1),b(n+1),c(n+1);
	int sum = 0;
	for(int i = 0;i<n;i++){
		cin>>a[i]>>b[i]>>c[i];
	}

	int mx = -1;
	
	for(int i = 0;i<n;i++){
		for(int j = 0;j<n;j++){
			if(i==j)continue;
			for(int k = 0;k<n;k++){
				if(k==i||k==j)continue;
				sum = 0;
				sum = a[i] + b[j] + c[k];
				if(a[i]>a[j]&&a[i]>a[k]&&b[j]>b[i]&&b[j]>b[k]&&c[k]>c[j]&&c[k]>c[i])umax(mx,sum);
			}
		}
	}

	cout<<mx<<endl;	

}

 signed main()
{
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int tt=1;//cin>>tt;
	while(tt--)solve();

}

Compilation message (stderr)

team.cpp: In function 'void solve()':
team.cpp:36:8: warning: unused variable 'm' [-Wunused-variable]
   36 |  int n,m,k;
      |        ^
team.cpp:36:10: warning: unused variable 'k' [-Wunused-variable]
   36 |  int n,m,k;
      |          ^

• Subtask 1: 8 / 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