oj.uz

답안 #670939

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
670939 2022-12-11T12:33:49 Z Dan4Life Palembang Bridges (APIO15_bridge) C++17
0 / 100
 1 ms 340 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)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].se);
			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;
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 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 Incorrect 1 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 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 Incorrect 1 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 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 -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 1 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -