# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
679163 | hello_there_123 | Palembang Bridges (APIO15_bridge) | C++17 | 98 ms | 4332 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 long long
/*
1 5
B 0 A 4
B 1 B 3
A 5 B 7
B 2 A 6
B 1 A 7
*/
main(){
int k,n;
cin>>k>>n;
if(k==1){
int ans = 0;
vector<int>v;
for(int i=0;i<n;i++){
char a,b;
int c,d;
cin>>a>>c>>b>>d;
if(a == b){
ans+=abs(c-d);
}
else{
v.push_back(c);
v.push_back(d);
ans++;
}
}
int s = v.size();
if(s==0){
cout<<ans;
return 0;
}
sort(v.begin(),v.end());
int x = v[s/2];
for(int i=0;i<s;i++){
ans+=abs(v[i]-x);
}
cout<<ans;
}
}
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... |