oj.uz

Submission #670949

# Submission time Handle Problem Language Result Execution time Memory
670949 2022-12-11T13:08:09 Z Dan4Life Palembang Bridges (APIO15_bridge) C++17
22 / 100
 127 ms 9720 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 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;
			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());
		}
		ans = min(ans, (sz(bef)-sz(aft))*2*u-sum_bef+sum_dur+sum_aft);
	}
	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());
		}
		ans = min(ans, (sz(bef)-sz(aft))*2*u-sum_bef+sum_dur+sum_aft);
		if(t==2){
			ans = min(ans, tryy(bef,0)+sum_dur+sum_aft-sz(aft)*2*u);
			ans = min(ans, (sz(bef)-sz(aft))*2*u-sum_bef+tryy(dur,1)+sum_aft);
			ans = min(ans, sz(bef)*2*u-sum_bef+sum_dur+tryy(aft,2));
		}
	}
	if(seg.empty()) ans=0;
	cout << ans+tot;
}

Subtask #1
8.0 / 8.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

Subtask #2
14.0 / 14.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 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 2 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 67 ms 9656 KB Output is correct
13 Correct 127 ms 9688 KB Output is correct
14 Correct 101 ms 8684 KB Output is correct
15 Correct 63 ms 5816 KB Output is correct
16 Correct 70 ms 9700 KB Output is correct
17 Correct 76 ms 9628 KB Output is correct
18 Correct 79 ms 9720 KB Output is correct
19 Correct 88 ms 9652 KB Output is correct
20 Correct 79 ms 9592 KB Output is correct
21 Correct 87 ms 9608 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 1 ms 212 KB Output is correct
4 Incorrect 6 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 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Incorrect 5 ms 336 KB Output isn't correct
5 Halted 0 ms 0 KB -

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