oj.uz

Submission #670952

# Submission time Handle Problem Language Result Execution time Memory
670952 2022-12-11T13:29:02 Z Dan4Life Palembang Bridges (APIO15_bridge) C++17
22 / 100
 123 ms 9700 KB 
#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)1e18;
vector<int> v;
vector<pii> seg;
set<pii> bef,dur,aft;
int t, n, sum_bef, sum_dur, sum_aft, tot, ans=LINF;

int tryy(set<pii> &S, int bri, int t){
	if(S.empty()) return 0;
	set<pii> bef,dur,aft; bef.clear(), dur.clear(), aft.clear();
	vector<int> v; v.clear();
	int sum_bef=0, sum_dur=0, sum_aft=0;

	for(auto u : S){
		v.pb(seg[u.se].fi), v.pb(seg[u.se].se);
		aft.insert({min(seg[u.se].fi,seg[u.se].se),u.se});
		sum_aft+=seg[u.se].fi+seg[u.se].se+1;
	}
	sort(all(v));
	v.erase(unique(all(v)), v.end());
	int ans = LINF;
	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)+1;

			if(t==1) sum_aft-=seg[i].fi+seg[i].se+1;
			//else sum_aft-= either go to bri, or go to u;
			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}); 
			if(t==1) sum_bef+=min(2*u-seg[i].fi-seg[i].se+1, seg[i].fi+seg[i].se+1-2*bri);
			else sum_bef+=seg[i].se+seg[i].fi+1;
			sum_dur-=abs(seg[i].se-seg[i].fi)-1;
			dur.erase(dur.begin());
		}
		if(t==0) ans = min(ans, sz(bef)*2*u-sum_bef+sum_dur+sum_aft);
		else  ans = min(ans, -sz(aft)*2*u+sum_dur+sum_aft+sum_bef);
	}
	return ans;
}

int32_t main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> t >> n;
	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), v.pb(d);
	}
	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+1;
	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)+1;
			sum_aft-=seg[i].fi+seg[i].se+1;
			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+1;
			sum_dur-=abs(seg[i].se-seg[i].fi)-1;
			dur.erase(dur.begin());
		}
		
		if(t==1) ans = min(ans, (sz(bef)-sz(aft))*2*u-sum_bef+sum_dur+sum_aft);
		else{
			ans = min(ans, tryy(bef,u,0)+sum_dur+sum_aft-sz(aft)*2*u);
			ans = min(ans, sz(bef)*2*u-sum_bef+sum_dur+tryy(aft,u,1));
		}
	}
	if(seg.empty()) ans=0;
	cout << ans+tot;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 384 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 468 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

Subtask #2
14.0 / 14.0

# 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 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 66 ms 9676 KB Output is correct
13 Correct 123 ms 9700 KB Output is correct
14 Correct 100 ms 8732 KB Output is correct
15 Correct 63 ms 5812 KB Output is correct
16 Correct 68 ms 9680 KB Output is correct
17 Correct 75 ms 9684 KB Output is correct
18 Correct 87 ms 9660 KB Output is correct
19 Correct 91 ms 9696 KB Output is correct
20 Correct 79 ms 9640 KB Output is correct
21 Correct 87 ms 9680 KB Output is correct

Subtask #3
0 / 9.0

# 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 0 ms 212 KB Output is correct
4 Incorrect 4 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 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 212 KB Output is correct
4 Incorrect 4 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 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 0 ms 212 KB Output is correct
4 Incorrect 4 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -