oj.uz

Submission #915678

# Submission time Handle Problem Language Result Execution time Memory
915678 2024-01-24T14:16:06 Z tvladm2009 Palembang Bridges (APIO15_bridge) C++17
22 / 100
 34 ms 4512 KB 
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
 
using namespace std;
template<typename T1, typename T2> inline void chkmin(T1 &a, T2 b) {if (a > b) a = b;}
template<typename T1, typename T2> inline void chkmax(T1 &a, T2 b) {if (a < b) a = b;}
#define files(FILENAME) read(FILENAME); write(FILENAME)
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define left left228
#define right right228
#define y1 y1228
#define mp make_pair
#define pb push_back
#define y2 y2228
#define rank rank228
using ll = long long;
using ld = long double; 
const string FILENAME = "input";
 
int k, n;
map<int, vector<int>> ind;

struct three {
	ll first;
	ll second;
	ll third;
	
	bool operator < (three oth) const {
		return first > oth.first;
	}
};

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//read(FILENAME);
	cin >> k >> n;
	ll add = 0;
	vector<pair<int, int>> v;
	vector<int> points;
	int cnt = 0;
	for (int i = 1; i <= n; i++) {
		char p, q;
		int s, t;
		cin >> p >> s >> q >> t;
		if (p == q) {
			add += abs(s - t);
		} else {
			points.pb(s);
			points.pb(t);
			if (p == '1') {
				swap(s, t);
			}
			v.pb(mp(s, t));
			cnt++;
		}
	}
	sort(all(points));		
	if (k == 1) {
		auto f = [&](int bridge) {
			ll res = 0;
			for (auto i: points) {
				res += abs(i - bridge);
			}
			res += cnt;
			return res;
		};
		
		int med = (sz(points) + 1) / 2;
		cout << f(points[med - 1]) + add << '\n';
	} else {
		sort(all(v));
		ll sum = 0;
		for (auto i: v) {
			sum += abs(i.second - i.first);
		}
		for (auto i: v) {
			ind[max(i.first, i.second)].pb(min(i.first, i.second));
		}
		points.resize(unique(all(points)) - points.begin());
		ll ans = 1e18;
		for (int i = 0; i + 1 < sz(points); i++) {
			ll cost = sum;
			priority_queue<three> pq;
			int offset = 0;
			ll inpq = 2 * (points[i + 1] - points[i]); 
			for (int j = i + 1; j < sz(points); j++) {
				while (!pq.empty() && -pq.top().first <= offset) {
					cost += pq.top().second;
					inpq -= -pq.top().third;
					pq.pop();
				}
				for (auto kek: ind[points[j]]) {
					if (kek >= points[i]) {
						cost -= points[j] - kek;
						pq.push({-(points[j] - points[i] + kek - points[i] - points[j] + kek + offset), points[j] - points[i] + kek - points[i], points[j] - kek + offset});
						inpq += points[j] - kek + offset;
					}
				}
				chkmin(ans, cost + inpq - offset * pq.size());
				if (j == sz(points)) {
					break;
				}
				offset += 2 * (points[j + 1] - points[j]);
			}
		}
		cout << ans + cnt + add << '\n';
	}
	return 0;
}

Compilation message

bridge.cpp: In instantiation of 'void chkmin(T1&, T2) [with T1 = long long int; T2 = long long unsigned int]':
bridge.cpp:124:49:   required from here
bridge.cpp:25:75: warning: comparison of integer expressions of different signedness: 'long long int' and 'long long unsigned int' [-Wsign-compare]
   25 | template<typename T1, typename T2> inline void chkmin(T1 &a, T2 b) {if (a > b) a = b;}
      |                                                                         ~~^~~

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 1 ms 344 KB Output is correct
4 Correct 1 ms 360 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 356 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 504 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 500 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 508 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 18 ms 3016 KB Output is correct
13 Correct 34 ms 4392 KB Output is correct
14 Correct 27 ms 3280 KB Output is correct
15 Correct 22 ms 2828 KB Output is correct
16 Correct 22 ms 3784 KB Output is correct
17 Correct 24 ms 4512 KB Output is correct
18 Correct 31 ms 3964 KB Output is correct
19 Correct 31 ms 4488 KB Output is correct
20 Correct 22 ms 3900 KB Output is correct
21 Correct 32 ms 4228 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 848 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 456 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

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