# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
167841 | pavel_guskov | Cloud Computing (CEOI18_clo) | C++14 | 2295 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>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("fast-math")
using namespace std;
const int MAXN = 2005;
const int MAXCOL = 101;
const long long INF = 1e18;
typedef long long ll;
int n, m;
vector<pair<int, pair<int, int>>> comp;
vector<pair<int, pair<int, int>>> cust;
ll dp[MAXCOL][MAXN];
int ind = 0;
void get_index(int f) {
while(ind < n && comp[ind].first >= f) ++ind;
}
void fill() {
for (int i = 0; i < MAXCOL; ++i) for (int j = 0; j < MAXN; j++) dp[i][j] = -INF;
}
# | 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... |