# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
922232 | asdasdqwer | Palembang Bridges (APIO15_bridge) | C++14 | 226 ms | 15520 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 int int64_t
#define pii array<int,2>
struct cmp {
bool operator()(const pii &x, const pii &y) {
return (x[0] + x[1]) < (y[0] + y[1]);
}
};
signed main() {
int k, n;cin>>k>>n;
vector<pii> dif;
int dis = 0;
for (int i=0;i<n;i++) {
char c1,c2;
int p1,p2;
cin>>c1>>p1>>c2>>p2;
if (c1 == c2) {
dis += abs(p1-p2);
}
else {
dif.push_back({p1,p2});
}
}
if (dif.size() == 0) {
cout<<dis<<"\n";
# | 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... |