제출 #591572

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
591572		yutabi	Shortcut (IOI16_shortcut)	C++14	0 / 100	2070 ms	308 KiB

shortcut

#include "shortcut.h"


#include <bits/stdc++.h>
using namespace std;


#define pb push_back


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


ll maxi=100000000000000000;


ll best[3000];

ll ans=maxi;


vector <vector <ii> > graph;


void DFS(int node, ll dis=0)
{
    best[node]=min(best[node],dis);

    for(int i=0;i<graph[node].size();i++)
    {
        if(best[graph[node][i].second]>dis+graph[node][i].first)
        {
            DFS(graph[node][i].second,dis+graph[node][i].first);
        }
    }
}


long long find_shortcut(int n, std::vector<int> l, std::vector<int> d, int c)
{
    graph=vector <vector <ii> > (2*n);

    for(int i=0;i<n;i++)
    {
        if(i!=n-1)
        {
            graph[i].pb(ii(l[i],i+1));
            graph[i+1].pb(ii(l[i],i));
        }

        graph[i].pb(ii(d[i],i+n));
        graph[i+n].pb(ii(d[i],i));
    }

    for(int i=0;i<n;i++)
    {
        for(int j=i+1;j<n;j++)
        {
            graph[i].pb(ii(c,j));
            graph[j].pb(ii(c,i));

            ll maxii=0;

            for(int k=0;k<2*n;k++)
            {
                for(int l=0;l<2*n;l++)
                {
                    best[l]=maxi;
                }

                DFS(k);

                for(int l=0;l<2*n;l++)
                {
                    maxii=max(maxii,best[l]);
                }
            }

            ans=min(ans,maxii);

            graph[i].pop_back();
            graph[j].pop_back();
        }
    }

    return ans;
}

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

shortcut.cpp: In function 'void DFS(int, ll)':
shortcut.cpp:30:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for(int i=0;i<graph[node].size();i++)
      |                 ~^~~~~~~~~~~~~~~~~~~

• 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