제출 #67390

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
67390		zscoder	전선 연결 (IOI17_wiring)	C++17	17 / 100	1089 ms	32076 KiB

wiring

#include "wiring.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<ll,ll> ii;

#define mp make_pair
#define pb push_back
#define fi first
#define se second

const int N = 100111;
const int M = 100111;
const int INF = int(1e9)+19;
ll dp[N+M+10];
int lastop[N+M+10]; //last opposite
ll S[N+M+10];
int lastsame[N+M+10];
int nxtsame[N+M+10];
int nxtop[N+M+10];
ll sum(int l, int r)
{
	if(l==0) return S[r];
	else return S[r]-S[l-1];
}

long long min_total_length(std::vector<int> r, std::vector<int> b) 
{
	int n = r.size(); int m = b.size();
	r.pb(INF); b.pb(INF);
	vector<ii> vec;
	vec.pb(mp(-INF,-INF));
	int ptrr=0; int ptrb=0;
	for(int i=0;i<n+m;i++)
	{
		if(r[ptrr]<b[ptrb])
		{
			vec.pb(mp(r[ptrr],0));
			ptrr++;
		}
		else
		{
			vec.pb(mp(b[ptrb],1));
			ptrb++;
		}
	}
	lastop[0]=0;
	S[0]=0;
	for(int i=1;i<vec.size();i++) S[i]=vec[i].fi+S[i-1];
	for(int i=1;i<vec.size();i++) lastop[i]=(vec[i-1].se==vec[i].se?lastop[i-1]:i-1);
	for(int i=1;i<vec.size();i++) lastsame[i]=(vec[i-1].se==vec[i].se?i-1:lastop[i-1]);
	nxtop[int(vec.size())-1]=INF; nxtsame[int(vec.size())-1]=INF;
	for(int i=int(vec.size())-2;i>=0;i--) nxtop[i]=(vec[i].se==vec[i+1].se?nxtop[i+1]:i+1);
	for(int i=int(vec.size())-2;i>=0;i--) nxtsame[i]=(vec[i].se==vec[i+1].se?i+1:nxtop[i+1]);
	for(int i=0;i<N+M+10;i++){dp[i]=ll(1e18);}
	dp[0]=0;
	for(int i=1;i<=n+m;i++)
	{
		ll pos=vec[i].fi; int ty=vec[i].se;
		//spam opposite sides;
		{
			if(lastop[i]>0) dp[i] = min(dp[i], dp[i-1]+pos-vec[lastop[i]].fi);
			ll d=0;
			for(int k=i-1;vec[k].se==(ty^1);k--)
			{
				d+=pos-vec[k].fi;
				dp[i] = min(dp[i], dp[k-1] + d);
			}
			d=0; int curb=lastop[i]; int curr=i;
			while(curr>curb&&curb>0)
			{
				d+=vec[curr].fi-vec[curb].fi;
				curr=lastsame[curr]; 
				int tmpb=curb;
				curb=lastsame[curb];
				if(curr<tmpb) break;
			}
			if((curb==0&&curr==0)||(curb>0&&curr>0))
			{
				dp[i] = min(dp[i], dp[max(curr,curb)] + d);
			}
			int nxtr=nxtsame[curr];
			for(int k=curb;vec[k].se==(ty^1)&&vec[k].fi>vec[curr].fi;k--)
			{	
				d+=vec[nxtr].fi-vec[k].fi;
				dp[i]=min(dp[i],dp[k-1]+d);
			}
			//cerr<<i<<' '<<dp[i]<<'\n';
			/*
			int p = lastop[i];
			if(p>0)
			{
				ll d = sum(p+1,i)-ll(i-p)*vec[p].fi;
				//cerr<<i<<' '<<p<<' '<<d<<'\n';
				dp[i][j] = min(dp[i][j], dp[p-1][0] + d);
				if(i-p>=2&&vec[p-1].se==vec[p].se)
				{
					dp[i][j] == min(dp[i][j], dp[p-1][1] + d - (vec[p+1].fi - vec[p].fi));
				}
			}
			*/
		}
	}
	return dp[n+m];
}

컴파일 시 표준 에러 (stderr) 메시지

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:52:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1;i<vec.size();i++) S[i]=vec[i].fi+S[i-1];
              ~^~~~~~~~~~~
wiring.cpp:53:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1;i<vec.size();i++) lastop[i]=(vec[i-1].se==vec[i].se?lastop[i-1]:i-1);
              ~^~~~~~~~~~~
wiring.cpp:54:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1;i<vec.size();i++) lastsame[i]=(vec[i-1].se==vec[i].se?i-1:lastop[i-1]);
              ~^~~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 0 / 13
• Subtask 3: 10 / 10
• Subtask 4: 0 / 25
• Subtask 5: 0 / 45