#include<bits/stdc++.h>
using namespace std;
#define int long long
int k, n;
namespace sub12{
void solve(){
vector<int> v;
int ans=0;
for (int i=1; i<=n; ++i){
char c1, c2; int p1, p2;
cin >> c1 >> p1 >> c2 >> p2;
if (c1==c2) ans+=abs(p1-p2);
else v.push_back(p1), v.push_back(p2);
}
sort(v.begin(), v.end());
if (v.size()){
int pos=v[(int)v.size()/2];
for (int i:v) ans+=abs(pos-i);
}
cout << ans+(int)v.size()/2 << '\n';
}
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> k >> n;
if (k==1) sub12::solve();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
468 KB |
Output is correct |
5 |
Correct |
1 ms |
344 KB |
Output is correct |
6 |
Correct |
1 ms |
500 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
452 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
468 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
344 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
16 ms |
3288 KB |
Output is correct |
13 |
Correct |
34 ms |
4312 KB |
Output is correct |
14 |
Correct |
25 ms |
3540 KB |
Output is correct |
15 |
Correct |
20 ms |
2776 KB |
Output is correct |
16 |
Correct |
21 ms |
3800 KB |
Output is correct |
17 |
Correct |
31 ms |
4308 KB |
Output is correct |
18 |
Correct |
33 ms |
4056 KB |
Output is correct |
19 |
Correct |
33 ms |
4312 KB |
Output is correct |
20 |
Correct |
23 ms |
3820 KB |
Output is correct |
21 |
Correct |
31 ms |
4048 KB |
Output is correct |
# |
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 |
1 ms |
348 KB |
Output isn't correct |
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 |
- |