Submission #56627

#	Time	Username	Problem	Language	Result	Execution time	Memory
56627		leejseo	Palembang Bridges (APIO15_bridge)	C++17	63 / 100	1675 ms	3868 KiB

bridge

#include <bits/stdc++.h>
using namespace std;
 
int K, N;
 
void solve1(){
	long long ans = 0;
	vector<int> L;
	int u, v;
	char x, y;
	for(int i=0; i<N; i++){
		scanf("%c %d %c %d\n", &x, &u, &y, &v);		
		if (x == y) ans += abs(u-v);
		else{
			L.push_back(u);
			L.push_back(v);
		}
	}
	sort(L.begin(), L.end());
	int M = L.size();
	if (M == 0){
		printf("%lld\n", ans);
		return;
	}
	long long mid = L[M/2];
	for (int i=0; i<M; i++) ans += abs(L[i] - mid);
	ans += M/2;
	printf("%lld\n", ans);
	L.clear();
	return;
}
 
long long f(vector<int>&X, vector<int>&Y, int s){
	vector<int> lo, hi;
	int N = X.size();
	for (int i=0; i<N; i++){
		if (X[i] + Y[i] < s){
			lo.push_back(X[i]);
			lo.push_back(Y[i]);
		}
		else{
			hi.push_back(X[i]);
			hi.push_back(Y[i]);
		}
	}
	long long ans = 0LL;
	sort(lo.begin(), lo.end());
	sort(hi.begin(), hi.end());
	for (int i=0; i<N; i++){
		if (X[i] + Y[i] < s) ans += abs(X[i]-lo[lo.size()/2])+abs(Y[i]-lo[lo.size()/2]); 
		else ans += abs(X[i]-hi[hi.size()/2])+abs(Y[i]-hi[hi.size()/2]);
	}
	lo.clear();
	hi.clear();
	return ans;
}
 
void solve2(){
	long long ans = 0;
	vector<int> S;
	vector<int> X;
	vector<int> Y;
	int u, v;
	char x, y;
	for(int i=0; i<N; i++){
		scanf("%c %d %c %d\n", &x, &u, &y, &v);		
		if (x == y) ans += abs(u-v);
		else{
			S.push_back(u+v);
			X.push_back(u);
			Y.push_back(v);
		}
	}
	int M = X.size();
	if (M == 0){
		printf("%lld\n", ans);
		return;
	}
	sort(S.begin(), S.end());
	unique(S.begin(), S.end());
	int lo = 0, hi = S.size()-1;
	long long temp = 1LL << 61;
    if (hi <= 2000){
		for (int i=lo; i<=hi; i++){
			temp = min(temp, f(X, Y, S[i]));
		}
    }
    else{
      while (lo + 55 < hi){
			int llh = (lo + lo + hi)/3;
			int lhh = (lo + hi + hi + 1)/3;
			long long left = f(X, Y, S[llh]), right = f(X, Y, S[lhh]);
			if (left < right) hi = lhh - 1;
			else if (left == right){
				lo = llh;
				hi = lhh;
			}
			else lo = llh+1;
		}
		for (int i=lo; i<=hi; i++){
			temp = min(temp, f(X, Y, S[i]));
		}
    }
	ans += temp;
	ans += M;
	printf("%lld\n", ans);
	return;
}
int main(void){
	scanf("%d%d\n", &K, &N);
	if (K == 1) solve1();
	else solve2();
}

Compilation message (stderr)

bridge.cpp: In function 'void solve1()':
bridge.cpp:12:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%c %d %c %d\n", &x, &u, &y, &v);  
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridge.cpp: In function 'void solve2()':
bridge.cpp:66:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%c %d %c %d\n", &x, &u, &y, &v);  
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridge.cpp: In function 'int main()':
bridge.cpp:110:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d\n", &K, &N);
  ~~~~~^~~~~~~~~~~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 14 / 14
• Subtask 3: 9 / 9
• Subtask 4: 32 / 32
• Subtask 5: 0 / 37