Submission #770253

#TimeUsernameProblemLanguageResultExecution timeMemory
770253PlurmTeam Contest (JOI22_team)C++11
8 / 100
2076 ms4300 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<tuple<int, int, int>> pts; for (int i = 0; i < n; i++) { int x, y, z; cin >> x >> y >> z; pts.push_back({x, y, z}); } int mx = -1; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { for (int k = 0; k < n; k++) { if (get<0>(pts[i]) > get<0>(pts[j]) && get<0>(pts[i]) > get<0>(pts[k]) && get<1>(pts[j]) > get<1>(pts[i]) && get<1>(pts[j]) > get<1>(pts[k]) && get<2>(pts[k]) > get<2>(pts[i]) && get<2>(pts[k]) > get<2>(pts[j])) { mx = max(mx, get<0>(pts[i]) + get<1>(pts[j]) + get<2>(pts[k])); } } } } cout << mx << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...