제출 #151512

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
151512		Nucleist	Sky Walking (IOI19_walk)	C++14	0 / 100	86 ms	8996 KiB

walk

#include <bits/stdc++.h>
#include "walk.h" 
using namespace std; 
#define flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ll long long
#define INF 1000000000000000000
#define pb push_back
#define ve vector<ll>
#define dos pair<ll,ll>
#define vedos vector<dos>
struct greateri
{
    template<class T>
    bool operator()(T const &a, T const &b) const { return a > b; }
};
ll so,go;
ll n,m;
vector<pair<ll,ll>>graph[100001];
map<pair<ll,ll>,ll>dp;
vector<int>xo;
ll solve(ll node,ll index)
{
	ll ans=INF;
	if(node==(n-1))
	{
		return index;
	}
	if(dp.find({node,index})!=dp.end())return dp[{node,index}];
	for (ll i = 0; i < graph[node].size(); ++i)
	{
		ll next = graph[node][i].first;
		ll indexi = graph[node][i].second;
		ans=min(ans,solve(next,indexi)+abs(xo[n]-xo[next])+abs(index-indexi));
	}
	return dp[{node,index}]=ans;
}
ll min_distance(vector<int>x,vector<int>h,vector<int>l,vector<int>r,vector<int>y,int s,int g)
{
  for (ll i = 0; i < l.size(); ++i)
  {
  	graph[l[i]].pb({r[i],y[i]});
  }
  xo=x;
  ll ans=solve(0,0);
  if(ans==INF)return -1;
  return ans;
}
//code the AC sol !
// BS/queue/map

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

walk.cpp: In function 'long long int solve(long long int, long long int)':
walk.cpp:33:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (ll i = 0; i < graph[node].size(); ++i)
                 ~~^~~~~~~~~~~~~~~~~~~~
walk.cpp: In function 'long long int min_distance(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, int, int)':
walk.cpp:43:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (ll i = 0; i < l.size(); ++i)
                  ~~^~~~~~~~~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 14
• Subtask 3: 0 / 15
• Subtask 4: 0 / 18
• Subtask 5: 0 / 43