oj.uz

답안 #914931

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
914931 2024-01-23T00:35:19 Z 8pete8 Palembang Bridges (APIO15_bridge) C++17
100 / 100
 69 ms 8136 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];
bool cmp(pii a,pii b){return a.f+a.s<b.f+b.s;}
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),cmp);
	t.init();
	int add=0;
	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<<add+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:91: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]
   91 |  for(int i=0;i<v.size();i++){
      |              ~^~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 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 348 KB Output is correct
8 Correct 0 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 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 20 ms 5584 KB Output is correct
13 Correct 39 ms 5832 KB Output is correct
14 Correct 31 ms 4836 KB Output is correct
15 Correct 23 ms 3796 KB Output is correct
16 Correct 22 ms 5588 KB Output is correct
17 Correct 33 ms 5576 KB Output is correct
18 Correct 22 ms 5584 KB Output is correct
19 Correct 39 ms 5500 KB Output is correct
20 Correct 27 ms 5576 KB Output is correct
21 Correct 37 ms 5588 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 440 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 532 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 464 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 476 KB Output is correct
21 Correct 1 ms 516 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct

Subtask #5
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 476 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 29 ms 6520 KB Output is correct
26 Correct 51 ms 6800 KB Output is correct
27 Correct 63 ms 7804 KB Output is correct
28 Correct 69 ms 8136 KB Output is correct
29 Correct 66 ms 7616 KB Output is correct
30 Correct 34 ms 4556 KB Output is correct
31 Correct 27 ms 7368 KB Output is correct
32 Correct 56 ms 7976 KB Output is correct
33 Correct 37 ms 7632 KB Output is correct
34 Correct 69 ms 7880 KB Output is correct
35 Correct 40 ms 7628 KB Output is correct
36 Correct 62 ms 7892 KB Output is correct
37 Correct 26 ms 6352 KB Output is correct