# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
44703 | cheater2k | Swap (BOI16_swap) | C++14 | 1092 ms | 217852 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;
const int N = 200005;
const int MAX = 1500005;
const int INF = 1e9;
typedef pair<int, int> ii;
int n, a[N], id;
vector <ii> vec[MAX];
int best[MAX];
map <int, int> mp[N];
void merge(vector <ii> &C, const vector <ii> &A, const vector <ii> &B) {
for (int ia = 0, ib = 0; ia < A.size() || ib < B.size(); ) {
if (ib == B.size() || (ia < A.size() && A[ia].first < B[ib].first)) {
C.push_back(A[ia++]);
} else {
C.push_back(B[ib++]);
}
}
}
int dp(int v, int val) {
if (val == INF) return 0; // empty vector
if (mp[v].find(val) != mp[v].end()) {
return mp[v][val];
}
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... |