Submission #1058706

#TimeUsernameProblemLanguageResultExecution timeMemory
1058706BoasTeam Contest (JOI22_team)C++17
8 / 100
2097 ms4744 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> using namespace std; using namespace __gnu_pbds; template <typename T1, typename T2> using indexed_map = tree<T1, T2, less<T1>, rb_tree_tag, tree_order_statistics_node_update>; template <typename T> using indexed_set = indexed_map<T, null_type>; #define loop(x, i) for (int i = 0; i < (x); i++) #define loop1(x, i) for (int i = 1; i <= (x); i++) #define rev(x, i) for (int i = (int)(x) - 1; i >= 0; i--) #define itloop(x) for (auto it = begin(x); x != end(x); it++) #define itrev(x) for (auto it = rbegin(x); x != rend(x); it++) #define int long long #define INF ((int64_t)(4e18 + 1)) #define INF32 ((int32_t)(2e9 + 1)) #define ALL(x) begin(x), end(x) #define RALL(x) rbegin(x), rend(x) #define existsIn(x, l) (count(ALL(l), x) > 0) #define removeIn(x, l) l.erase(find(ALL(l), x)) #define pb push_back #define sz(x) (int)(x).size() #define F first #define S second #define var const auto & #define foreach(l) for (var e : l) typedef int8_t in8; typedef int16_t in16; typedef int32_t in32; typedef int64_t in64; typedef pair<int, int> ii; typedef tuple<int, int, int> iii; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<ii> vii; typedef vector<iii> viii; typedef vector<vii> vvii; typedef vector<viii> vviii; typedef set<int> si; typedef set<ii> sii; typedef set<iii> siii; typedef vector<si> vsi; typedef vector<sii> vsii; typedef vector<vsi> vvsi; typedef vector<string> vstr; typedef vector<vector<string>> vvstr; typedef vector<bool> vb; typedef vector<vb> vvb; typedef vi::iterator viit; typedef si::iterator siit; void solve() { int n; cin >> n; viii beavers(n); for (auto &[x, y, z] : beavers) cin >> x >> y >> z; sort(ALL(beavers)); int res = -1; loop(n, i) { var[x1, y1, z1] = beavers[i]; loop(n, j) { var[x2, y2, z2] = beavers[j]; loop(n, k) { var[x3, y3, z3] = beavers[k]; if (x1 <= x2 || x1 <= x3) continue; if (y2 <= y1 || y2 <= y3) continue; if (z3 <= z1 || z3 <= z2) continue; res = max(res, x1 + y2 + z3); } } } cout << res << endl; } signed main() { cin.tie(0)->sync_with_stdio(0); int t = 1; // cin >> t; while (t--) solve(); }
#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...