oj.uz

Submission #914927

# Submission time Handle Problem Language Result Execution time Memory
914927 2024-01-23T00:28:39 Z 8pete8 Palembang Bridges (APIO15_bridge) C++17
22 / 100
 40 ms 5840 KB 
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include<bitset> 
#include<stack>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define pppiiii pair<pii,pii>
#define ppii pair<int,pii>
#define all(x) x.begin(),x.end()
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-loops")
#define int long long
const ll mod=998244353,mxn=2e5+5,lg=30,inf=1e18,minf=-1e9,Mxn=100000;
struct solve{
	priority_queue<int>l;
	priority_queue<int,vector<int>,greater<int>>r;
	int suml=0,sumr=0,med=inf;
	void add(int val){
		med=getmed();
		if(val>med)r.push(val),sumr+=val;
		else l.push(val),suml+=val;
		balance();
	}
	void balance(){
		while(r.size()>l.size()+1){
			l.push(r.top());
			sumr-=r.top();
			suml+=r.top();
			r.pop();
		}
		while(l.size()>r.size()+1){
			r.push(l.top());
			suml-=l.top();
			sumr+=l.top();
			l.pop();
		}
	}
	int qry(){
		if(l.size()>r.size())return ((l.top()*l.size())-suml)+(sumr-(l.top()*r.size()));
		else return (sumr-(r.top()*r.size()))+((r.top()*l.size())-suml);
	}
	int getmed(){
		if(l.empty()&&r.empty())return inf;
		if(l.size()>r.size())return l.top();
		else return r.top();
	}
	void init(){
		while(!l.empty())l.pop();
		while(!r.empty())r.pop();
		suml=0;
		sumr=0;
		med=0;
	}
}t;
int k,n;
int pref[mxn+10];/*
void subk1(){
	int ans=0;
	vector<int>v;
	pair<char,int>a,b;
	for(int i=0;i<n;i++){
		cin>>a.f>>a.s>>b.f>>b.s;
		if(a.f==b.f)ans+=abs(a.s-b.s);
		else v.pb(b.s),v.pb(a.s),ans++;
	}
	sort(all(v));
	for(auto i:v)ans+=abs(v[v.size()/2]-i);
	cout<<ans;
}*/
int32_t main(){
	fastio
	cin>>k>>n;
	int ans=0;
	vector<pii>v;
	pair<char,int>a,b;
	t.init();
	for(int i=0;i<n;i++){
		cin>>a.f>>a.s>>b.f>>b.s;
		if(a.f==b.f)ans+=abs(a.s-b.s);
		else v.pb({min(a.s,b.s),max(a.s,b.s)}),ans++;
	}
	sort(all(v));
	t.init();
	int add=inf;
	for(int i=0;i<v.size();i++){
		t.add(v[i].f);
		t.add(v[i].s);
		pref[i]=t.qry();
		add=pref[i];
	}
	if(k==1)return cout<<pref[v.size()-1]+ans,0;
	t.init();
	for(int i=v.size()-1;i>1;i--){
		t.add(v[i].f);
		t.add(v[i].s);
		add=min(add,t.qry()+pref[i-1]);
	}
	cout<<ans+add;
}

Compilation message

bridge.cpp: In function 'int32_t main()':
bridge.cpp:103:15: 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]
  103 |  for(int i=0;i<v.size();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 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 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 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 0 ms 348 KB Output is correct
2 Correct 0 ms 428 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 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 18 ms 5840 KB Output is correct
13 Correct 40 ms 5496 KB Output is correct
14 Correct 33 ms 5316 KB Output is correct
15 Correct 22 ms 3024 KB Output is correct
16 Correct 19 ms 5624 KB Output is correct
17 Correct 31 ms 5840 KB Output is correct
18 Correct 25 ms 5580 KB Output is correct
19 Correct 37 ms 5580 KB Output is correct
20 Correct 28 ms 5580 KB Output is correct
21 Correct 34 ms 5580 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 1 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 348 KB Output isn't correct
2 Halted 0 ms 0 KB -