oj.uz

Submission #937497

# Submission time Handle Problem Language Result Execution time Memory
937497 2024-03-04T07:13:04 Z Baizho Palembang Bridges (APIO15_bridge) C++14
22 / 100
 40 ms 3984 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
 
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt,sse3,avx")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(2e5)+100;
const int M = ll(2e5) + 100;
const long long inf = 5e18;
//const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
 
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
 
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
 
int k, n, m;
pair<int, int> point[N];
long long suf[N];

bool cmp(pair<int, int> a, pair<int, int> b) {
	return (a.ff + a.ss) < (b.ff + b.ss);
}

vector<int> get(int l, int r) {
	if(l > r) return {};
	vector<int> res;
	for(int i = l; i <= r; i ++) res.pb(point[i].ff), res.pb(point[i].ss);
	sort(all(res));
	return res;
}

multiset<int> v1, v2;
long long sumv1 = 0, sumv2 = 0, siz = 0;

void add(int x) {
	siz ++;
	if(v1.size() < (siz + 1) / 2 || x <= *v1.rbegin()) {
		sumv1 += x;
		v1.insert(x);
	} else {
		sumv2 += x;
		v2.insert(x);
	}
	if(v1.size() > (siz + 1) / 2) {
		int x = *v1.rbegin();
		sumv1 -= x;
		v1.erase(v1.find(x));
		sumv2 += x;
		v2.insert(x);
	}
	
}
 
void Baizho() {
	cin>>k>>n;
	long long ex = 0;
	for(int i = 1; i <= n; i ++) {
		char p, q;
		int s, t; 
		cin>>p>>s>>q>>t;
		if(s > t) swap(s, t);
		if(p == q) ex += t - s;
		else {
			ex ++;
			point[++m] = {s, t};
		}
	}
	sort(point + 1, point + m + 1, cmp);
	long long ans = 0;
	if(k == 1) {
		vector<int> pos = get(1, m);
		int mid = (pos.size()) / 2;
		for(auto x : pos) ans += abs(pos[mid] - x);
	} else if(k == 2 && m) {
		ans = inf;
		for(int i = m; i >= 1; i --) {
			add(point[i].ff);
			add(point[i].ss);
			int median = *v1.rbegin();
			suf[i] = 1LL * sumv2 - sumv1 + median * (v1.size() - v2.size());
		}
		sumv1 = 0, sumv2 = 0, siz = 0;
		v1.clear(), v2.clear();
		for(int i = 1; i <= m; i ++) {
			add(point[i].ff);
			add(point[i].ss);
			int median = *v1.rbegin();
			long long res = suf[i + 1] + 1LL * sumv2 - sumv1 + median * (v1.size() - v2.size());
			ans = min(ans, res);
		}
	}
	cout<<ans + ex;
}
 
signed main() {		
// 	Freopen("nondec");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;
 
    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message

bridge.cpp: In function 'void add(int)':
bridge.cpp:58:15: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   58 |  if(v1.size() < (siz + 1) / 2 || x <= *v1.rbegin()) {
      |     ~~~~~~~~~~^~~~~~~~~~~~~~~
bridge.cpp:65:15: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   65 |  if(v1.size() > (siz + 1) / 2) {
      |     ~~~~~~~~~~^~~~~~~~~~~~~~~
bridge.cpp: In function 'void Freopen(std::string)':
bridge.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridge.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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 412 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 2 ms 2400 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 18 ms 3800 KB Output is correct
13 Correct 40 ms 3792 KB Output is correct
14 Correct 32 ms 3548 KB Output is correct
15 Correct 24 ms 3152 KB Output is correct
16 Correct 20 ms 3672 KB Output is correct
17 Correct 29 ms 3664 KB Output is correct
18 Correct 30 ms 3776 KB Output is correct
19 Correct 31 ms 3804 KB Output is correct
20 Correct 23 ms 3760 KB Output is correct
21 Correct 29 ms 3984 KB Output is correct

Subtask #3
0 / 9.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 2396 KB Output is correct
4 Incorrect 1 ms 2396 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 32.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 2396 KB Output is correct
4 Incorrect 1 ms 2396 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

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