oj.uz

답안 #671684

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
671684 2022-12-13T14:16:44 Z Dan4Life Palembang Bridges (APIO15_bridge) C++17
41 / 100
 2000 ms 8048 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 chk(int x, int t){
	vector<int> v; v.clear(); int ans = 0;
	if(t==0){
		for(int i = 0; i <= x; i++) 
			v.pb(seg[i].se), v.pb(seg[i].fi-seg[i].se);
	}
	else{
		for(int i = x+1; i < sz(seg); i++) 
			v.pb(seg[i].se), v.pb(seg[i].fi-seg[i].se);
	}
	sort(all(v)); int med = v[sz(v)/2];
	for(auto u : v) ans+=abs(med-u); 
	return ans;
}
int32_t main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> t >> n; int 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, min(b,d)}), tot++, v.pb(b), v.pb(d);
	}
	sort(all(v)); sort(all(seg));
	if(!seg.empty()) ans = chk(sz(seg)-1, 0);
	for(int i = 0; i < sz(seg); i++){
		ans = min(ans, chk(i,0)+chk(i,1));
	}
	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 Incorrect 20 ms 340 KB Output isn't correct
4 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 Incorrect 19 ms 392 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.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 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 212 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 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 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 216 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 25 ms 324 KB Output is correct
14 Correct 70 ms 400 KB Output is correct
15 Correct 81 ms 396 KB Output is correct
16 Correct 3 ms 316 KB Output is correct
17 Correct 21 ms 324 KB Output is correct
18 Correct 11 ms 340 KB Output is correct
19 Correct 24 ms 340 KB Output is correct
20 Correct 27 ms 364 KB Output is correct
21 Correct 49 ms 388 KB Output is correct
22 Correct 27 ms 340 KB Output is correct
23 Correct 20 ms 412 KB Output is correct
24 Correct 27 ms 340 KB Output is correct

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 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 20 ms 340 KB Output is correct
14 Correct 68 ms 340 KB Output is correct
15 Correct 80 ms 340 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 21 ms 388 KB Output is correct
18 Correct 11 ms 360 KB Output is correct
19 Correct 22 ms 340 KB Output is correct
20 Correct 28 ms 336 KB Output is correct
21 Correct 49 ms 388 KB Output is correct
22 Correct 28 ms 340 KB Output is correct
23 Correct 21 ms 328 KB Output is correct
24 Correct 28 ms 332 KB Output is correct
25 Execution timed out 2080 ms 8048 KB Time limit exceeded
26 Halted 0 ms 0 KB -