#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define mp make_pair
using namespace std;
const int inf = 1e9 * 2;
const int mod = 1e9 + 7;
const int N = 3e4 + 5;
int dis(pair<int, int> i, int p){
if(i.first <= p && i.second >= p) return 0;
else return min(abs(p - i.first), abs(p - i.second));
}
int32_t main(){
ios_base::sync_with_stdio(false), cin.tie();
int k, n;
cin>>k>>n;
int ans = 0;
vector<pair<int, int> > a;
for(int i = 0; i < n; i++){
char h, o;
int hx, ox;
cin>>h>>hx>>o>>ox;
if(h != o){
a.pb(mp(hx, ox));
}
ans += abs(hx - ox);
}
if(k == 1){
vector<int> points;
for(auto itr: a){
points.pb(itr.first);
points.pb(itr.second);
}
sort(points.begin(), points.end());
int med = points[points.size()/2];
int add = a.size(); // bridge
for(auto itr: a){
add += dis(itr, med) * 2;
}
cout<<ans + add<<endl;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
348 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
348 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |