oj.uz

Submission #982904

# Submission time Handle Problem Language Result Execution time Memory
982904 2024-05-15T02:51:03 Z tamir1 Palembang Bridges (APIO15_bridge) C++17
22 / 100
 32 ms 3772 KB 
#include<bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
ll ans,n,k,i,j,x,y,l,m,a[200005],z,mn,a1,a2,m1,m2;
vector<pair<ll,ll>> v;
char s,t;
bool cmp(pair<ll,ll> a,pair<ll,ll> b){
	return (double)(a.ff+a.ss)/2<(double)(b.ff+b.ss)/2;
}
ordered_set p,q;
int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> k >> n;
	for(i=1;i<=n;i++){
		cin >> s >> x >> t >> y;
		if(s==t) ans+=abs(x-y);
		else{
			ans++;
			l++;
			a[l]=x;
			l++;
			a[l]=y;
			if(x>y) swap(x,y);
			v.push_back({x,y});
		}
	}
	sort(a+1,a+l+1);
	x=a[(l+1)/2];
	if(k==1){
	for(i=1;i<=l;i++){
		ans+=abs(x-a[i]);
	}
	cout << ans;
	return 0;}
	sort(v.begin(),v.end(),cmp);
	if(v.size()==0){
		cout << ans;
		return 0;
	}
	if(v.size()==1){
		cout << ans+v[0].ss-v[0].ff;
		return 0;
	}
	p.insert(v[0].ff);
	p.insert(v[0].ss);
	for(i=1;i<v.size();i++){
		q.insert(v[i].ff);
		q.insert(v[i].ss);
	}
	m1=*p.find_by_order(p.size()/2);
	m2=*q.find_by_order(q.size()/2);
	for(auto it=p.begin();it!=p.end();it++) a1+=abs(*it-m1);
	for(auto it=q.begin();it!=q.end();it++) a2+=abs(*it-m2);
	mn=a1+a2;
	for(i=1;i<v.size()-1;i++){
		ll x=v[i].ff,y=v[i].ss;
		p.insert(x);
		m=*p.find_by_order(p.size()/2);
		a1+=abs(x-m1);
		if(p.size()%2==1) a1-=abs(m1-m);
		m1=m;
		p.insert(y);
		m=*p.find_by_order(p.size()/2);
		a1+=abs(y-m1);
		if(p.size()%2==1) a1-=abs(m1-m);
		m1=m;
		q.erase(q.upper_bound(x));
		m=*q.find_by_order(q.size()/2);
		if(q.size()%2==0) a2+=abs(m2-m);
		a2-=(m2-x);
		m2=m;
		q.erase(q.upper_bound(y));
		m=*q.find_by_order(q.size()/2);
		if(q.size()%2==0) a2+=abs(m2-m);
		a2-=(m2-y);
		m2=m;
		mn=min(mn,a1+a2);
	}
	cout << ans+mn;
}

Compilation message

bridge.cpp: In function 'int main()':
bridge.cpp:52:11: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |  for(i=1;i<v.size();i++){
      |          ~^~~~~~~~~
bridge.cpp:61:11: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |  for(i=1;i<v.size()-1;i++){
      |          ~^~~~~~~~~~~

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 0 ms 344 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

Subtask #2
14.0 / 14.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 600 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 15 ms 3540 KB Output is correct
13 Correct 32 ms 3544 KB Output is correct
14 Correct 23 ms 3536 KB Output is correct
15 Correct 19 ms 2264 KB Output is correct
16 Correct 20 ms 3772 KB Output is correct
17 Correct 23 ms 3584 KB Output is correct
18 Correct 26 ms 3544 KB Output is correct
19 Correct 31 ms 3544 KB Output is correct
20 Correct 21 ms 3544 KB Output is correct
21 Correct 28 ms 3544 KB Output is correct

Subtask #3
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 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 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 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 1 ms 344 KB Output isn't correct
5 Halted 0 ms 0 KB -

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