oj.uz

Submission #882626

# Submission time Handle Problem Language Result Execution time Memory
882626 2023-12-03T12:21:56 Z vjudge1 Palembang Bridges (APIO15_bridge) C++17
41 / 100
 2000 ms 9832 KB 
#include <bits/stdc++.h>
#define fast cin.tie(0)->sync_with_stdio(0);
#define int long long
#define inf ((int)1e18)
using namespace std;

int solve(vector<pair<int,int> > v, int st, int nd) {
	if(st == nd) return 0;
	vector <int> p;
	int ans = 0;
	for(int i = st; i < nd; i++) {
		int a = v[i].first, b = v[i].second;
		// cout << a << " " << b << "\n";
		ans++;
		p.push_back(a);
		p.push_back(b);
	}
	sort(p.begin(), p.end());
	int bridge = p[p.size() / 2];
	for(auto it:p) {
		ans += abs(bridge-it);
	}
	// cout << "\n";
	return ans;
}

int32_t main(){
	fast
	int k,n;
	cin >> k >> n;
	vector <pair<int, int> > p;
	int add_ans = 0;
	for(int i = 0; i < n; i++) {
		char fuck1, fuck2;
		int a, b;
		cin >> fuck1 >> a >> fuck2 >> b;
		if(fuck1 == fuck2) {
			add_ans += abs(a - b);
		}
		else {
			p.push_back({min(a, b), max(a, b)});
		}
	}
	sort(p.begin(), p.end(), [&](const pair<int,int>&a, const pair<int,int>&b) {
		return ((double)a.first + a.second) / 2 < ((double)b.first + b.second) / 2;
	});
	int m = p.size();
	if(m == 0) {
		cout << add_ans << "\n";
		return 0;
	}
	int ans = inf;
	for(int i = 0; i < m; i++) {
		int tans = solve(p, 0, i) + solve(p, i, m);
		ans = min(ans, tans);
		// cout << tans << "\n\n";
	}
	cout << ans + add_ans << "\n";
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 19 ms 544 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 19 ms 544 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 19 ms 348 KB Output is correct
14 Correct 65 ms 540 KB Output is correct
15 Correct 75 ms 540 KB Output is correct
16 Correct 2 ms 456 KB Output is correct
17 Correct 19 ms 524 KB Output is correct
18 Correct 10 ms 344 KB Output is correct
19 Correct 24 ms 552 KB Output is correct
20 Correct 21 ms 348 KB Output is correct
21 Correct 53 ms 348 KB Output is correct
22 Correct 25 ms 600 KB Output is correct
23 Correct 20 ms 348 KB Output is correct
24 Correct 22 ms 348 KB Output is correct

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 19 ms 348 KB Output is correct
14 Correct 65 ms 348 KB Output is correct
15 Correct 75 ms 348 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 19 ms 348 KB Output is correct
18 Correct 11 ms 348 KB Output is correct
19 Correct 21 ms 348 KB Output is correct
20 Correct 21 ms 348 KB Output is correct
21 Correct 53 ms 536 KB Output is correct
22 Correct 22 ms 348 KB Output is correct
23 Correct 20 ms 348 KB Output is correct
24 Correct 21 ms 348 KB Output is correct
25 Execution timed out 2073 ms 9832 KB Time limit exceeded
26 Halted 0 ms 0 KB -