# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
70963 | MatheusLealV | Cloud Computing (CEOI18_clo) | C++17 | 988 ms | 2332 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>
#define N 2010
using namespace std;
typedef long long ll;
struct S
{
int val, c, f, t;
} v[2*N];
inline bool cmp(S a, S b)
{
if(a.f != b.f) return a.f > b.f;
return a.t < b.t;
}
int n, m, soma;
ll dp[2][50*N];
ll solve()
{
ll A = (n + m + 1)%2, B = (n + m)%2;
for(int i = n + m + 1; i >= 1; i--)
{
for(int C = 0; C <= soma; C++)
{
# | 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... |