제출 #114359

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
114359		faustaadp	Shortcut (IOI16_shortcut)	C++17	0 / 100	2 ms	384 KiB

shortcut

#include "shortcut.h"
#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ll n,i,jar[550],tam[550],has,j,d[550],C,b[550];
vector<ll> v[550],w[550];
ll cak(ll aa)
{
	ll ii;
	priority_queue<pair<ll,ll> > pq;
	for(ii=0;ii<(n*2);ii++)
		b[ii]=0;
	for(ii=0;ii<(n*2);ii++)
		d[ii]=1e18;
	d[aa]=0;
	ll ma=0;
	pq.push(mp(0,aa));
	while(!pq.empty())
	{
		ll u=pq.top().se;
		ll dis=-pq.top().fi;
		pq.pop();
		if(b[u])
			continue;
		b[u]=1;
		//cout<<aa<<" "<<bb<<" "<<u<<" "<<dis<<" "<<d[u]<<"\n";
		ma=max(ma,d[u]);
		for(ii=0;ii<v[u].size();ii++)
		{
			if(d[v[u][ii]]>d[u]+w[u][ii])
			{
				d[v[u][ii]]=d[u]+w[u][ii];
				pq.push(mp(-d[v[u][ii]],v[u][ii]));
			}
		}
	}
	return ma;
}
ll cek(ll aa,ll bb)
{
	ll ii;
	v[aa].pb(bb);
	w[aa].pb(C);
	v[bb].pb(aa);
	w[bb].pb(C);
	ll ma=0,cln=0;
	for(ii=n;ii<n*2;ii++)
		ma=max(ma,cak(ii));
	v[aa].pop_back();
	w[aa].pop_back();
	v[bb].pop_back();
	w[bb].pop_back();
	return ma;
	//cout<<aa<<" "<<bb<<" "<<ma<<" "<<cln<<"\n";
	/*
	ma=0;
	for(ii=0;ii<(n*2);ii++)
		d[ii]=1e18;
	d[cln]=0;
	pq.push(mp(0,cln));
	cln=0;
	while(!pq.empty())
	{
		ll u=pq.top().se;
		ll dis=-pq.top().fi;
		pq.pop();
		if(d[u]!=dis)
			continue;
		ma=max(ma,d[u]);
		if(ma==d[u])
			cln=u;
		ll ii;
		for(ii=0;ii<v[u].size();ii++)
		{
			if(d[v[u][ii]]>d[u]+w[u][ii])
			{
				d[v[u][ii]]=d[u]+w[u][ii];
				pq.push(mp(-d[v[u][ii]],v[u][ii]));
			}
		}
	}
	//cout<<aa<<" "<<bb<<" "<<ma<<"\n";
	//cout<<ma<<"\n";
	return ma;
	*/
}
long long find_shortcut(int N, std::vector<int> l, std::vector<int> d, int c)
{
	n=N;
	C=c;
	for(i=0;i<(n*2);i++)
	{
		v[i].clear();
		w[i].clear();
	}
	for(i=0;i<(n-1);i++)
	{
		v[i].pb(i+1);
		w[i].pb(jar[i]);
		v[i+1].pb(i);
		w[i+1].pb(jar[i]);
	}
	for(i=0;i<n;i++)
	{
		v[i].pb(i+n);
		w[i].pb(tam[i]);
		v[i+n].pb(i);
		w[i+n].pb(tam[i]);
	}
	for(i=0;i<(n-1);i++)
		jar[i]=l[i];
	for(i=0;i<n;i++)
		tam[i]=d[i];
	has=1e18;
	for(i=0;i<n;i++)
		for(j=i+1;j<n;j++)
			has=min(has,cek(i,j));
    return has;
}

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

shortcut.cpp: In function 'll cak(ll)':
shortcut.cpp:32:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(ii=0;ii<v[u].size();ii++)
            ~~^~~~~~~~~~~~
shortcut.cpp:25:6: warning: unused variable 'dis' [-Wunused-variable]
   ll dis=-pq.top().fi;
      ^~~
shortcut.cpp: In function 'll cek(ll, ll)':
shortcut.cpp:50:10: warning: unused variable 'cln' [-Wunused-variable]
  ll ma=0,cln=0;
          ^~~

• Subtask 1: 0 / 9
• Subtask 2: 0 / 14
• Subtask 3: 0 / 8
• Subtask 4: 0 / 7
• Subtask 5: 0 / 33
• Subtask 6: 0 / 22
• Subtask 7: 0 / 4
• Subtask 8: 0 / 3