# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
586122 | 2022-06-30T01:04:01 Z | tamthegod | Team Contest (JOI22_team) | C++14 | 0 ms | 340 KB |
#include<bits/stdc++.h> #define int long long #define pb push_back #define fi first #define se second using namespace std; using ll = long long; using ld = long double; using ull = unsigned long long; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int maxN = 1e6 + 5; const int mod = 1e9 + 7; const ll oo = 1e18; int n; int f[maxN]; struct Tpart { int x, y, z; } a[maxN]; void ReadInput() { cin >> n; for(int i=1; i<=n; i++) cin >> a[i].x >> a[i].y >> a[i].z; } void Solve() { int res = -1; for(int i=1; i<=n; i++) { vector<Tpart> vc; for(int j=1; j<=n; j++) if(a[j].x < a[i].x) vc.emplace_back(a[j]); sort(vc.begin(), vc.end(), [](Tpart p, Tpart q) { return p.y > q.y; }); f[vc.size()] = 0; for(int j=(int)vc.size()-1; j>=0; j--) f[j] = max(f[j - 1], a[j].z); int t = 0; for(int j=0; j<vc.size(); j++) { while(t < vc.size() && vc[t].y >= vc[j].y) t++; if(t < vc.size()) res = max(res, a[i].x + vc[j].y + f[t]); } } cout << res; } int32_t main() { // freopen("x.inp", "r", stdin); ios_base::sync_with_stdio(false); cin.tie(nullptr); ReadInput(); Solve(); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |