/*
example test starts
1
1 5
B 0 A 4
B 1 B 3
A 5 B 7
B 2 A 6
B 1 A 7
example test ends
*/
#include <bits/stdc++.h>
using namespace std;
const int N = 1<<17;
int n,k,sz,arr[N];
long long ans;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tests,current_case;
int i,x1,x2,x;
char side1,side2;
tests=1;
//cin>>tests;
for(current_case=1;current_case<=tests;current_case++) {
cin>>k>>n;
ans=0;
sz=0;
for(i=1;i<=n;i++) {
cin>>side1>>x1>>side2>>x2;
if(side1==side2) ans+=abs(x2-x1);
else ++ans,arr[++sz]=x1,arr[++sz]=x2;
}
sort(arr+1,arr+1+sz);
x=arr[(sz+1)>>1];
for(i=1;i<=sz;i++) ans+=abs(x-arr[i]);
cout<<ans<<endl;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2692 KB |
Output is correct |
2 |
Correct |
0 ms |
2692 KB |
Output is correct |
3 |
Correct |
0 ms |
2692 KB |
Output is correct |
4 |
Correct |
0 ms |
2692 KB |
Output is correct |
5 |
Correct |
0 ms |
2692 KB |
Output is correct |
6 |
Correct |
0 ms |
2692 KB |
Output is correct |
7 |
Correct |
0 ms |
2692 KB |
Output is correct |
8 |
Correct |
0 ms |
2692 KB |
Output is correct |
9 |
Correct |
0 ms |
2692 KB |
Output is correct |
10 |
Correct |
0 ms |
2692 KB |
Output is correct |
11 |
Correct |
0 ms |
2692 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2692 KB |
Output is correct |
2 |
Correct |
0 ms |
2692 KB |
Output is correct |
3 |
Correct |
0 ms |
2692 KB |
Output is correct |
4 |
Correct |
0 ms |
2692 KB |
Output is correct |
5 |
Correct |
0 ms |
2692 KB |
Output is correct |
6 |
Correct |
0 ms |
2692 KB |
Output is correct |
7 |
Correct |
0 ms |
2692 KB |
Output is correct |
8 |
Correct |
0 ms |
2692 KB |
Output is correct |
9 |
Correct |
0 ms |
2692 KB |
Output is correct |
10 |
Correct |
0 ms |
2692 KB |
Output is correct |
11 |
Correct |
0 ms |
2692 KB |
Output is correct |
12 |
Incorrect |
19 ms |
2692 KB |
Output isn't correct |
13 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2692 KB |
Output is correct |
2 |
Correct |
0 ms |
2692 KB |
Output is correct |
3 |
Incorrect |
0 ms |
2692 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2692 KB |
Output is correct |
2 |
Correct |
0 ms |
2692 KB |
Output is correct |
3 |
Incorrect |
0 ms |
2692 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2692 KB |
Output is correct |
2 |
Correct |
0 ms |
2692 KB |
Output is correct |
3 |
Incorrect |
0 ms |
2692 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |