# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
107160 | oolimry | Palembang Bridges (APIO15_bridge) | C++14 | 115 ms | 8860 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;
typedef pair<long long, long long> ii;
bool comp(ii a, ii b){
return a.first + a.second < b.first + b.second;
}
int main()
{
//freopen("i.txt","r",stdin);
int k, n;
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> k >> n;
vector<ii> pairs;
long long forcedDist = 0ll;
for(int i = 0;i < n;i++){
char a, c;
long long b, d;
cin >> a >> b >> c >> d;
if(a == c){
forcedDist += abs(d-b);
}
# | 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... |