# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
810834 | abczz | Palembang Bridges (APIO15_bridge) | C++14 | 286 ms | 16712 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 <vector>
#include <array>
#include <cstdlib>
#include <algorithm>
#include <map>
#define ll long long
using namespace std;
char C, D;
multimap <ll, ll> mp, mp2;
vector <ll> X;
vector <array<ll, 2> > V;
ll k, n, l, r, f, mn = 1e18, t, sl, sr, tl, tr;
int main() {
cin >> k >> n;
if (k == 1) {
for (int i=0; i<n; ++i) {
cin >> C >> l >> D >> r;
if (l > r) swap(l, r);
if (C == D) f += r-l;
else {
X.push_back(l);
X.push_back(r);
}
}
sort(X.begin(), X.end());
for (auto u : X) {
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... |