Submission #892163

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
892163	2023-12-25T02:39:06 Z	vjudge1	Team Contest (JOI22_team)	C++17	8 / 100	2000 ms	4616 KB

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

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.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	460 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	67 ms	600 KB	Output is correct
15	Correct	25 ms	348 KB	Output is correct
16	Correct	40 ms	348 KB	Output is correct
17	Correct	48 ms	348 KB	Output is correct
18	Correct	51 ms	344 KB	Output is correct
19	Correct	62 ms	348 KB	Output is correct
20	Correct	45 ms	344 KB	Output is correct
21	Correct	34 ms	344 KB	Output is correct
22	Correct	40 ms	604 KB	Output is correct
23	Correct	27 ms	348 KB	Output is correct
24	Correct	33 ms	348 KB	Output is correct
25	Correct	32 ms	348 KB	Output is correct

Subtask #2

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	460 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	67 ms	600 KB	Output is correct
15	Correct	25 ms	348 KB	Output is correct
16	Correct	40 ms	348 KB	Output is correct
17	Correct	48 ms	348 KB	Output is correct
18	Correct	51 ms	344 KB	Output is correct
19	Correct	62 ms	348 KB	Output is correct
20	Correct	45 ms	344 KB	Output is correct
21	Correct	34 ms	344 KB	Output is correct
22	Correct	40 ms	604 KB	Output is correct
23	Correct	27 ms	348 KB	Output is correct
24	Correct	33 ms	348 KB	Output is correct
25	Correct	32 ms	348 KB	Output is correct
26	Execution timed out	2065 ms	604 KB	Time limit exceeded
27	Halted	0 ms	0 KB	-

Subtask #3

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	452 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Execution timed out	2090 ms	4616 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #4

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	452 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Execution timed out	2090 ms	4616 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	452 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Execution timed out	2090 ms	4616 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #6

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	452 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Execution timed out	2090 ms	4616 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #7

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	460 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	67 ms	600 KB	Output is correct
15	Correct	25 ms	348 KB	Output is correct
16	Correct	40 ms	348 KB	Output is correct
17	Correct	48 ms	348 KB	Output is correct
18	Correct	51 ms	344 KB	Output is correct
19	Correct	62 ms	348 KB	Output is correct
20	Correct	45 ms	344 KB	Output is correct
21	Correct	34 ms	344 KB	Output is correct
22	Correct	40 ms	604 KB	Output is correct
23	Correct	27 ms	348 KB	Output is correct
24	Correct	33 ms	348 KB	Output is correct
25	Correct	32 ms	348 KB	Output is correct
26	Execution timed out	2065 ms	604 KB	Time limit exceeded
27	Halted	0 ms	0 KB	-