oj.uz

Submission #1024827

# Submission time Handle Problem Language Result Execution time Memory
1024827 2024-07-16T10:49:39 Z EkinOnal Palembang Bridges (APIO15_bridge) C++17
22 / 100
 38 ms 6072 KB 
//#pragma GCC optimize("O3,unroll-loops,Ofast")
//#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
 
 
#define MAX 1000007
#define pb push_back
#define mp make_pair 
#define int long long
#define f first
#define s second
#define vi vector<int>
#define pii pair<int,int>
#define si set<int>
#define vpii vector<pair<int,int>> 
const int mod = 2019201997;
const int INF = 1e18;
// myMap.begin()->first :  key
// myMap.begin()->second : value
 
int epow(int a,int b){int ans=1;while(b){if(b&1) ans*=a;a*=a;/*ans%=mod;a%=mod;*/b>>=1;}return ans/*%mod*/;}
int gcd(int a,int b) {if(a<b)swap(a,b);while(b){int tmp=b;b=a%b;a=tmp;}return a;}
int mul(int a,int b){return ((a%mod)*(b%mod))%mod;}
 
 
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
 
struct DSU {
	vi e,sayi; void init(int N) { e = vi(N,-1); sayi = vi(N);}
	int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); } 
	bool sameSet(int a, int b) { return get(a) == get(b); }
	int size(int x) { return -e[get(x)]; }
	bool unite(int x, int y) { // union by size
		x = get(x), y = get(y); if (x == y) return 0;
		if (e[x] > e[y]) swap(x,y);
		e[x] += e[y]; e[y] = x; sayi[x]+=sayi[y]; return 1;
	}
};
 
typedef tree<pii, null_type, less<pii>, rb_tree_tag,
	tree_order_statistics_node_update>ordered_set;
 
 
priority_queue<int,vi,greater<int>> rq;
priority_queue<int> lq;
 
int lsum,rsum;
 
void add(int a)
{
	int medyan=(lq.size()?lq.top():INF);
 
	if(a<=medyan) {lq.push(a);lsum+=a;}
	else {rq.push(a);rsum+=a;}
 
//	lq.push(a);
	if(lq.size()>rq.size()+1)
	{
		int sayi=lq.top();
		lq.pop();
		rq.push(sayi);
		rsum+=sayi;
		lsum-=sayi;
	}
	if(lq.size()<rq.size()) //whilea gerek yok gibi
	{
		lq.push(rq.top()); 
		lsum+=rq.top(); rsum-=rq.top();
		rq.pop();
	}
}
 
bool cmp(pair<int, int> a, pair<int, int> b) {
	return a.first + a.second < b.first + b.second;
}
 
void solve() 
{
	int n,k; cin >> k >> n;
 
	vpii v = {{0, 0}};
	int ans=0;
	for(int i=1;i<=n;i++)
	{
		int b,d;char a,c; cin>>a>>b>>c>>d;
		if(a==c) ans+=abs(b-d);
		else
		{
		//	add(b); add(d);
			v.pb({b,d});
		}
	}
 
	sort(v.begin(),v.end(),cmp);
	n=v.size()-1;
 
	ans += n;
 
	vi pre(n+5);
 
	for(int i=1;i<=n;i++)
	{
		add(v[i].f); add(v[i].s);
		pre[i]=rsum-lsum;
	}
 
//	for(int i=1;i<=n;i++) cout << pre[i] << " ";cout<<endl;
 
	if(k==1)
	{
		cout << ans+pre[n] << endl;
		return;
	}
 
	while (lq.size()) lq.pop();
	while (rq.size()) rq.pop();
 
	lsum=rsum=0;
 
	int cvp=INF;
	for(int i=n;i>0;i--)
	{
		add(v[i].f); add(v[i].s);
		cvp=min(cvp,pre[i-1]+rsum-lsum);
	}
 
 
	cout << cvp+ans << endl;
 	
    return;	
 	
}	
 
 
int32_t main() {
//	freopen("hayfeast.in", "r", stdin);
//	freopen("hayfeast.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(0);   
 
    int t=1;
//    cin >> t;
    while (t--) solve();
 
    return 0;
}

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 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 1 ms 348 KB Output is correct
6 Correct 1 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 1 ms 348 KB Output is correct

Subtask #2
14.0 / 14.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 344 KB Output is correct
4 Correct 0 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 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 0 ms 348 KB Output is correct
12 Correct 19 ms 5576 KB Output is correct
13 Correct 38 ms 5320 KB Output is correct
14 Correct 34 ms 5832 KB Output is correct
15 Correct 23 ms 3544 KB Output is correct
16 Correct 23 ms 5320 KB Output is correct
17 Correct 30 ms 5744 KB Output is correct
18 Correct 27 ms 6072 KB Output is correct
19 Correct 35 ms 5576 KB Output is correct
20 Correct 23 ms 5548 KB Output is correct
21 Correct 33 ms 5744 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 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 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -