# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
77314 | tmwilliamlin168 | Cloud Computing (CEOI18_clo) | C++14 | 1289 ms | 3636 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
const int mxN=2e3, mxC=50;
int n, m, ci, fi, vi;
ll dp[mxN+1][mxC*2+1], ans;
vector<array<int, 3>> v1, v2;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for(int i=0; i<n; ++i) {
cin >> ci >> fi >> vi;
v1.push_back({fi, ci, vi});
}
sort(v1.begin(), v1.end(), greater<array<int, 3>>());
cin >> m;
for(int i=0; i<m; ++i) {
cin >> ci >> fi >> vi;
v2.push_back({fi, ci, vi});
}
sort(v2.begin(), v2.end(), greater<array<int, 3>>());
memset(dp, 0x96, sizeof(dp));
dp[0][50]=0;
for(int i=0; i<=n; ++i) {
for(int j=0; j<=m; ++j) {
# | 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... |