# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
784757 | chanhchuong123 | Toll (BOI17_toll) | C++14 | 83 ms | 15084 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 INF = 1e9 + 7;
const int MAX = 50000;
int k, n, m, q;
int A[MAX], B[MAX];
vector<int> blk[MAX];
int ans[MAX], ID[MAX];
int L[MAX][5], R[MAX][5];
vector<pair<int, int>> go[MAX], back[MAX];
bool minimize(int &x, const int &y) {
if (x > y) {
x = y;
return true;
}
return false;
}
void divi(int l, int r, vector<int> &v) {
if (v.empty()) return;
if (l == r) {
for (int &id: v) {
if (A[id] == B[id]) ans[id] = 0;
else ans[id] = INF;
}
return;
}
int mid = l + r >> 1;
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... |