#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define INF 1e18
ll m,n,l,r,T,i,j,ii,jj,k,D[200005],ans;
vector<ll> pos;
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cin>>T>>n;
ans=INF;
for(i=0;i<n;i++){
char a,b;
cin>>a>>l>>b>>r;
if(a==b) k+=abs(l-r);
else{
pos.pb(l);
pos.pb(r);
k++;
}
}
sort(pos.begin(),pos.end());
n=pos.size();
if(T==1){
for(ll it : pos) k+=abs(pos[n/2]-it);
cout<<k;
}
else{
for(i=0;i<n;i++) D[0]+=abs(pos[0]-pos[i]);
for(i=1;i<n;i++) D[i]=D[i-1]+(pos[i]-pos[i-1])*i-(pos[i]-pos[i-1])*(n-i);
for(i=0;i<n;i++)
for(j=i+1;j<n;j++) ans=min(ans,D[i]+D[j]+k);
cout<<ans;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
280 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
21 ms |
2512 KB |
Output is correct |
13 |
Correct |
40 ms |
2452 KB |
Output is correct |
14 |
Correct |
28 ms |
2512 KB |
Output is correct |
15 |
Correct |
21 ms |
1492 KB |
Output is correct |
16 |
Correct |
27 ms |
2512 KB |
Output is correct |
17 |
Correct |
27 ms |
2448 KB |
Output is correct |
18 |
Correct |
31 ms |
2512 KB |
Output is correct |
19 |
Correct |
42 ms |
2464 KB |
Output is correct |
20 |
Correct |
26 ms |
2512 KB |
Output is correct |
21 |
Correct |
41 ms |
2448 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |