#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
using pii = pair<int,int>;
#define all(a) a.begin(),a.end()
#define sz(a) (int)a.size()
const int maxn = (int)1e5+10;
const int LINF = (int)4e18;
vector<int> v;
vector<pii> seg;
set<pii> bef,dur,aft;
int t, n, sum_bef, sum_dur, sum_aft;
int32_t main() {
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> t >> n; int tot = 0, ans=LINF;
for(int i = 0; i < n; i++){
char a, c; int b, d;
cin >> a >> b >> c >> d;
if(a==c) tot+=abs(b-d);
else seg.pb({b,d}), v.pb(b-1), v.pb(b), v.pb(d), v.pb(d+1), tot++;
}
sort(all(v)); sort(all(seg));
v.erase(unique(all(v)), v.end());
for(int i = 0; i < sz(seg); i++)
aft.insert({min(seg[i].fi, seg[i].se),i}), sum_aft+=seg[i].fi+seg[i].se;
for(auto u : v){
while(!aft.empty() and aft.begin()->fi<=u){
int i = aft.begin()->se;
dur.insert({max(seg[i].fi, seg[i].se), i});
sum_dur+=abs(seg[i].se-seg[i].fi);
sum_aft-=seg[i].fi+seg[i].se;
aft.erase(aft.begin());
}
while(!dur.empty() and dur.begin()->fi<u){
int i = dur.begin()->se;
bef.insert({max(seg[i].fi, seg[i].se), i});
sum_bef+=seg[i].se+seg[i].fi;
sum_dur-=abs(seg[i].se-seg[i].fi);
dur.erase(dur.begin());
}
ans = min(ans, (sz(bef)-sz(aft))*2*u-sum_bef+sum_dur+sum_aft);
}
if(seg.empty()) ans=0;
cout << ans+tot;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
340 KB |
Output is correct |
| 5 |
Correct |
2 ms |
340 KB |
Output is correct |
| 6 |
Correct |
1 ms |
328 KB |
Output is correct |
| 7 |
Correct |
1 ms |
340 KB |
Output is correct |
| 8 |
Correct |
1 ms |
384 KB |
Output is correct |
| 9 |
Correct |
2 ms |
380 KB |
Output is correct |
| 10 |
Correct |
1 ms |
332 KB |
Output is correct |
| 11 |
Correct |
1 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Correct |
2 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 |
456 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 |
92 ms |
12036 KB |
Output is correct |
| 13 |
Correct |
142 ms |
13568 KB |
Output is correct |
| 14 |
Correct |
126 ms |
11348 KB |
Output is correct |
| 15 |
Correct |
76 ms |
8116 KB |
Output is correct |
| 16 |
Correct |
95 ms |
12952 KB |
Output is correct |
| 17 |
Correct |
83 ms |
13560 KB |
Output is correct |
| 18 |
Correct |
91 ms |
13220 KB |
Output is correct |
| 19 |
Correct |
110 ms |
13596 KB |
Output is correct |
| 20 |
Correct |
92 ms |
13076 KB |
Output is correct |
| 21 |
Correct |
98 ms |
13340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
