# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
48200 | E869120 | Palembang Bridges (APIO15_bridge) | C++14 | 1881 ms | 20308 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 <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
long long N, K, Q, A[100009], B[100009], sum;
vector<long long>Z; vector<long long>S;
long long calculate() {
long long rem = 0;
for (int i = 1; i <= Q; i++) {
long long F = (1LL << 60);
for (int j = 0; j < S.size(); j++) {
if (A[i] <= S[j] && S[j] <= B[i]) F = 0;
F = min(F, 2LL * min(abs(A[i] - S[j]), abs(B[i] - S[j])));
}
rem += F;
}
return sum + rem;
}
long long solve(long long pos) {
long long rev = (1LL << 60); int i = pos;
vector<pair<long long, long long>>vec; long long R = 0;
for (int j = 1; j <= Q; j++) {
if (A[j] > Z[i]) { R += 2; vec.push_back(make_pair(A[j], 2)); vec.push_back(make_pair(B[j], 2)); vec.push_back(make_pair(B[j] + A[j] - Z[i], -2)); }
}
sort(vec.begin(), vec.end());
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... |