# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
77966 | aminra | Cloud Computing (CEOI18_clo) | C++14 | 893 ms | 8332 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;
typedef long long ll;
typedef long double ld;
const int MOD = (int)1e9 + 7;
const int MAXN = (int)2e5 + 7;
const int MAXS = (int)100006;
const int infint = (int)1e9;
const ll inf = (ll)1e18;
ll n, dp[MAXS], tmp[MAXS], sz;
struct machine{
ll c, f, v;
} m[MAXN];
struct person{
ll C, F, V;
} p[MAXN];
vector<ll> which[MAXN];
bool cmp(person a, person b)
{
return a.F < b.F;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++)
cin >> m[i].c >> m[i].f >> m[i].v;
cin >> sz;
for (int i = 0; i < sz; i++)
# | 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... |