# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
219017 | pavement | Cloud Computing (CEOI18_clo) | C++17 | 397 ms | 1528 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 mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
typedef long double ld;
int N, M, f, c, v, idx, idx1, idx2, dp[100005];
tuple<int, int, int> F[100005], S[100005];
pair<int, bool> V[100005];
main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N;
for (int i = 1, c, f, v; i <= N; i++) {
cin >> c >> f >> v;
F[i] = mt(-f, c, v);
}
cin >> M;
for (int i = 1; i <= M; i++) {
cin >> c >> f >> v;
S[i] = mt(-f, c, v);
}
sort(F + 1, F + 1 + N);
sort(S + 1, S + 1 + M);
for (; idx1 < N && idx2 < M; )
Compilation message (stderr)
# | 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... |