oj.uz

Submission #951082

# Submission time Handle Problem Language Result Execution time Memory
951082 2024-03-21T06:11:41 Z Amaarsaa Palembang Bridges (APIO15_bridge) C++14
22 / 100
 40 ms 4180 KB 
#include<bits/stdc++.h>

using namespace std;
using ll = long long ;
ll Pre[100005], Suf[100005];

void DBack(multiset<ll>& A) {
	auto P = A.end();
	P --;
	A.erase(P);
	return ;
}
ll Ed(multiset<ll>&A) {
	auto P = A.end();
	P --;
	return *P;
}
bool cmp(auto& A, auto& B) {
	return A.first + A.second < B.first + B.second;
}
multiset < ll > deer, door;
ll	deer_sum =0, door_sum =0;
void Insert(ll x) {
	if ( door.size() == deer.size()) {
		if (deer.empty() || *deer.begin() >= x) door.insert(x), door_sum += x;
		else {
			door_sum += *deer.begin();
			deer_sum -= *deer.begin();
			deer_sum += x;
			door.insert(*deer.begin());
			deer.erase(deer.begin());
			deer.insert(x);
		}
	}
	else {
		if ( Ed(door) <= x) {
			deer.insert(x);
			deer_sum += x;
		}
		else {
			deer_sum += Ed(door);
			door_sum -= Ed(door);
			door_sum += x;
			deer.insert(Ed(door));
			DBack(door);
			door.insert(x);
		}
	}
} 
int main() {
//	freopen("hayfeast.in", "r", stdin);
//	freopen("hayfeast.out", "w", stdout);
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	ll t, n, m, ans, s,sum, x, y, r, p, i, j, cnt = 0;

	cin >> n >> m;
	
	ans = 0;
	
	sum = 0;
	char ch1, ch2;
	vector < ll > v;
	vector < pair < ll, ll > > q;
	for (i = 1; i <= m; i ++) {
		cin >> ch1 >> x >> ch2 >> y;
		if ( ch1 == ch2) {
			ans += abs(x - y);
			sum += abs(x - y);
		}
		else {
			v.push_back(x);
			v.push_back(y);
			q.push_back({x, y});
		}
	}
	sort(v.begin(), v.end());
	s = v.size();
	s = (s + 1)/2 - 1;
	if ( n == 2) {
		ans = 1e18;
		sort(q.begin(), q.end());
		
		for (i = 0; i < q.size(); i ++) {
			Insert(q[i].first);
			Insert(q[i].second);
			
			if ( i % 2 == 0) s = Ed(door) + (deer_sum - door_sum);
			else s = deer_sum - door_sum;
			Pre[i] = s;
 		}
 		door.clear();
 		deer.clear();
 		deer_sum = door_sum =0;
		for (i = q.size() - 1; i >= 0; i --) {
			Insert(q[i].first);
			Insert(q[i].second);
			if ( i % 2 != 0) s = Ed(door) + (deer_sum - door_sum);
			else s = deer_sum - door_sum;
			Suf[i] = s;
			if (i == 0) ans = min(ans, Suf[i]);
			else ans =min(ans, Suf[i] + Pre[i - 1]);
 		}
 		cout << ans + q.size()  + sum<< endl;
		return 0;
	}
	for (i = 0; i < v.size(); i ++) {
		ans = ans + abs(v[s] - v[i]);
	}
	cout << ans + v.size()/2<< endl;
}

Compilation message

bridge.cpp:18:10: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   18 | bool cmp(auto& A, auto& B) {
      |          ^~~~
bridge.cpp:18:19: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   18 | bool cmp(auto& A, auto& B) {
      |                   ^~~~
bridge.cpp: In function 'int main()':
bridge.cpp:84:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |   for (i = 0; i < q.size(); i ++) {
      |               ~~^~~~~~~~~~
bridge.cpp:107:16: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |  for (i = 0; i < v.size(); i ++) {
      |              ~~^~~~~~~~~~
bridge.cpp:55:5: warning: unused variable 't' [-Wunused-variable]
   55 |  ll t, n, m, ans, s,sum, x, y, r, p, i, j, cnt = 0;
      |     ^
bridge.cpp:55:32: warning: unused variable 'r' [-Wunused-variable]
   55 |  ll t, n, m, ans, s,sum, x, y, r, p, i, j, cnt = 0;
      |                                ^
bridge.cpp:55:35: warning: unused variable 'p' [-Wunused-variable]
   55 |  ll t, n, m, ans, s,sum, x, y, r, p, i, j, cnt = 0;
      |                                   ^
bridge.cpp:55:41: warning: unused variable 'j' [-Wunused-variable]
   55 |  ll t, n, m, ans, s,sum, x, y, r, p, i, j, cnt = 0;
      |                                         ^
bridge.cpp:55:44: warning: unused variable 'cnt' [-Wunused-variable]
   55 |  ll t, n, m, ans, s,sum, x, y, r, p, i, j, cnt = 0;
      |                                            ^~~

Subtask #1
8.0 / 8.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 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 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 1 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 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 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 17 ms 3784 KB Output is correct
13 Correct 40 ms 4180 KB Output is correct
14 Correct 26 ms 3780 KB Output is correct
15 Correct 19 ms 2504 KB Output is correct
16 Correct 20 ms 3784 KB Output is correct
17 Correct 24 ms 3780 KB Output is correct
18 Correct 27 ms 3692 KB Output is correct
19 Correct 32 ms 3784 KB Output is correct
20 Correct 25 ms 3836 KB Output is correct
21 Correct 30 ms 3708 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 548 KB Output isn't correct
2 Halted 0 ms 0 KB -