Submission #1243871

#TimeUsernameProblemLanguageResultExecution timeMemory
1243871sula2Team Contest (JOI22_team)C++20
17 / 100
2095 ms584 KiB
#include <bits/stdc++.h> #define all(a) (a).begin(), (a).end() #define Z string::npos using namespace std; using namespace chrono; signed main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; set<tuple<int,int,int>> s; for (int i = 0; i < n; i++) { int x,y,z; cin >> x >> y >> z; s.emplace(x, y, z); } int ans = -1; for (auto [xi, yi, zi] : s) { for (auto [xj, yj, zj] : s) { for (auto [xk, yk, zk] : s) { if (xi > max(xj, xk) && yj > max(yi, yk) && zk > max(zi, zj)) { ans = max(ans, xi + yj + zk); } } } } cout << ans; }
#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...