# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
242960 | Lawliet | Cloud Computing (CEOI18_clo) | C++17 | 648 ms | 2168 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 int lli;
const int MAXS = 2000*50 + 10;
struct event
{
int type, cmp;
int qtd, price;
event(int t, int q, int p, int c)
: type(t), qtd(q), price(p), cmp(c) {}
bool operator < (event a)
{
if( cmp != a.cmp ) return cmp < a.cmp;
return type > a.type;
}
};
int n, m;
lli dp[2][MAXS];
vector<event> v;
int main()
{
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... |