| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 892173 | vjudge1 | Team Contest (JOI22_team) | C++17 | 64 ms | 3932 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
const long long INF = 1e18;
const int N = 1e5 + 1;
signed main(){
int n;
cin >> n;
int x[n],y[n],z[n];
for(int i = 0;i < n;i++){
cin >> x[i] >> y[i] >> z[i];
}
if(n <= 300){
int ans = -1;
for(int i = 0;i < n;i++){
for(int j = 0;j < n;j++){
for(int k = 0;k < n;k++){
if(i != j && i != k && j != k){
if(x[i] > x[j] && x[i] > x[k] && y[j] > y[i] && y[j] > y[k] && z[k] > z[i] && z[k] > z[j]){
ans = max(ans,x[i] + y[j] + z[k]);
}
}
}
}
}
cout << ans;
}
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
