# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
831801 | serifefedartar | Palembang Bridges (APIO15_bridge) | C++17 | 250 ms | 12704 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;
#define fast ios::sync_with_stdio(0);cin.tie(0);
typedef long long ll;
#define f first
#define s second
#define MOD 1000000007
#define LOGN 18
#define MAXN 200005
vector<pair<ll,ll>> seq;
int main() {
fast
ll K, N;
cin >> K >> N;
ll sum = 0;
for (int i = 0; i < N; i++) {
char ch1, ch2;
ll posR1, posR2;
cin >> ch1 >> posR1 >> ch2 >> posR2;
if (ch1 == ch2)
sum += abs(posR1 - posR2);
else
seq.push_back({min(posR1, posR2), max(posR1, posR2)});
}
sort(seq.begin(), seq.end(), [&](pair<ll,ll> &a, pair<ll,ll> &b) {
return a.f + a.s < b.f + b.s;
# | 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... |