Submission #43953

#	Time	Username	Problem	Language	Result	Execution time	Memory
43953		Kerim	Palembang Bridges (APIO15_bridge)	C++17	41 / 100	84 ms	48164 KiB

bridge

#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
vector<int>can;
vector<PII>v;
ll f(int x){
	ll res=0;
	tr(it,v)
		res+=abs(it->ff-x)+abs(x-it->ss)+1;
	return res;	
}
const int N=2005;
ll pre[N][N],suf[N][N];
bool cmp(PII x,PII y){
	return (x.ff+x.ss<y.ff+y.ss);
}
int median(){
	return (can[can.size()/2]+can[can.size()/2-1])/2;
}
int main(){
    //~ freopen("file.in", "r", stdin);
    int k,n;
    scanf("%d%d",&k,&n);
    if(k==1){
		ll ans=0;
		for(int i=1;i<=n;i++){
			char a,c;
			int b,d;
			scanf(" %c%d %c%d",&a,&b,&c,&d);
			if(a!=c){
				can.pb(b);
				can.pb(d);
				v.pb(mp(b,d));
			}
			else
				ans+=abs(b-d);
		}
		//~ cout<<median()<<endl;
		printf("%lld\n",ans+f(median()));
	}
	 if(k==2){
		ll ans=0;
		for(int i=1;i<=n;i++){
			char a,c;
			int b,d;
			scanf(" %c%d %c%d",&a,&b,&c,&d);
			can.pb(b);can.pb(d);
			if(a!=c)
				v.pb(mp(b,d));
			else
				ans+=abs(b-d);
		}
		sort(all(v),cmp);
		//~ tr(it,v)
			//~ cout<<it->ff<<" "<<it->ss<<endl;
		//~ wr	
		sort(all(can));
		can.erase(unique(all(can)),can.end());
		ll res=LONG_LONG_MAX;
		for(int i=0;i<int(can.size());i++)
			for(int j=0;j<int(v.size());j++){
				if(j)
					pre[i][j]=pre[i][j-1];
				pre[i][j]+=abs(v[j].ff-can[i])+abs(v[j].ss-can[i]);
			}
		for(int i=0;i<int(can.size());i++)
			for(int j=int(v.size())-1;j>=0;j--){
				suf[i][j]=suf[i][j+1];
				suf[i][j]+=abs(v[j].ff-can[i])+abs(v[j].ss-can[i]);
			}
		for(int i=0;i<int(can.size());i++){
			int p=0;
			for(int j=i+1;j<int(can.size());j++){
				while(p<int(v.size()) and v[p].ff+v[p].ss<=can[i]+can[j])
					p++;
				ll tmp=ans;
				if(p)
					tmp+=p+pre[i][p-1];
				if(p<int(v.size()))
					tmp+=(v.size()-p)+suf[j][p];
				//~ cout<<can[i]<<" "<<can[j]<<" "<<p<<" "<<tmp<<endl;
				umin(res,tmp);	
			}
		}
		printf("%lld\n",res);
	}
	return 0;
}

Compilation message (stderr)

bridge.cpp: In function 'int main()':
bridge.cpp:39:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&k,&n);
     ~~~~~^~~~~~~~~~~~~~
bridge.cpp:45:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf(" %c%d %c%d",&a,&b,&c,&d);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
bridge.cpp:62:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf(" %c%d %c%d",&a,&b,&c,&d);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

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