oj.uz

Submission #947321

# Submission time Handle Problem Language Result Execution time Memory
947321 2024-03-15T21:54:11 Z amirhoseinfar1385 Palembang Bridges (APIO15_bridge) C++17
22 / 100
 57 ms 7624 KB 
#include<bits/stdc++.h>
using namespace std;
const int maxn=100000+10;
long long n,k,fakeres,ps[maxn],suf[maxn];
vector<pair<long long,long long>>all;

bool cmp(pair<long long,long long>a,pair<long long,long long>b){
	return a.first+a.second<b.first+b.second;
}

void vorod(){
	cin>>k>>n;
	for(long long i=0;i<n;i++){
		char c,cc;
		long long d,dd;
		cin>>c>>d>>cc>>dd;
		if(d>dd){
			swap(d,dd);
		}
		if(c==cc){
			fakeres+=abs(dd-d);
		}else{
			all.push_back(make_pair(d,dd));
			fakeres++;
		}
	}
	n=(long long)all.size();
}

void pre(){
	sort(all.begin(),all.end(),cmp);
	priority_queue<long long>kam;
	long long sumkam=0,sumziad=0;
	for(long long i=0;i<n;i++){
		kam.push(all[i].first);
		kam.push(all[i].second);
		sumkam+=all[i].first+all[i].second;
		sumkam-=kam.top();
		sumziad+=kam.top();
		kam.pop();
		ps[i]=sumziad-sumkam;
	}
	while((long long)kam.size()>0){
		kam.pop();
	}
	sumkam=0,sumziad=0;
	for(long long i=n-1;i>=0;i--){
		kam.push(all[i].first);
		kam.push(all[i].second);
		sumkam+=all[i].first+all[i].second;
		sumkam-=kam.top();
		sumziad+=kam.top();
		kam.pop();
		suf[i]=sumziad-sumkam;
	}
}

void solve(){
	if(k==1){
		long long mainres=fakeres+suf[0];
		cout<<mainres<<"\n";
		return ;
	}
	long long mainres=fakeres+suf[0];
	for(long long i=0;i<n;i++){
		mainres=min(mainres,fakeres+suf[i+1]+ps[i]);
	}
	cout<<mainres<<"\n";
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	//freopen("inp.txt","r",stdin);
	vorod();
	pre();
	solve();
}

Subtask #1
8.0 / 8.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 Correct 1 ms 516 KB Output is correct
5 Correct 1 ms 344 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 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 1 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 348 KB Output is correct
5 Correct 1 ms 472 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 27 ms 6100 KB Output is correct
13 Correct 57 ms 7560 KB Output is correct
14 Correct 47 ms 6136 KB Output is correct
15 Correct 33 ms 4556 KB Output is correct
16 Correct 30 ms 6868 KB Output is correct
17 Correct 46 ms 7368 KB Output is correct
18 Correct 45 ms 7064 KB Output is correct
19 Correct 52 ms 7624 KB Output is correct
20 Correct 45 ms 7220 KB Output is correct
21 Correct 52 ms 7332 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 460 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 #5
0 / 37.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 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -