# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
761548 | penguinhacker | Cloud Computing (CEOI18_clo) | C++17 | 219 ms | 1308 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 ll long long
#define ar array
const int mxN=2000;
int n, m;
ll dp[50*mxN+1];
vector<ar<int, 4>> v;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i=0; i<n; ++i) {
int c, f, p;
cin >> c >> f >> p;
v.push_back({-f, 1, c, p});
}
cin >> m;
for (int i=0; i<m; ++i) {
int c, f, p;
cin >> c >> f >> p;
v.push_back({-f, 2, c, p});
}
sort(v.begin(), v.end());
memset(dp, 0xbf, sizeof(dp));
dp[0]=0;
int tot=0;
# | 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... |