Submission #644255

#	Time	Username	Problem	Language	Result	Execution time	Memory
644255		ToroTN	Crocodile's Underground City (IOI11_crocodile)	C++14	0 / 100	2 ms	2644 KiB

crocodile

#include "crocodile.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define X first
#define Y second
int n,m,k,p[100005],y,cost,d[100005][2],u;
vector<pair<int,int> > g[100005];
priority_queue<pair<int,int> > pq;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
    n=N;
    for(int i=1;i<=n;i++)
    {
        d[i][0]=2e9;
        d[i][1]=2e9;
    }
    m=M;
    for(int i=0;i<m;i++)
    {
        g[R[i][0]+1].pb({R[i][1]+1,L[i]});
        g[R[i][1]+1].pb({R[i][0]+1,L[i]});
    }
    k=K;
    for(int i=0;i<k;i++)
    {
        p[i+1]=P[i]+1;
    }
    for(int i=1;i<=k;i++)
    {
        d[p[i]][0]=0;
        d[p[i]][1]=0;
        pq.push({0,p[i]});
    }
    /*while(!pq.empty())
    {
        printf("%d %d\n",pq.top().X,pq.top().Y);
        pq.pop();
    }*/
    while(!pq.empty())
    {
        u=pq.top().Y;
        pq.pop();
        for(auto [y,cost]:g[u])
        {
            if(d[u][1]+cost<=d[y][0])
            {
                d[y][1]=d[y][0];
                d[y][0]=d[u][1]+cost;
                pq.push({-d[y][1],y});
            }else if(d[u][1]+cost<d[y][1])
            {
                d[y][1]=d[u][1]+cost;
                pq.push({-d[y][1],y});
            }
        }
    }
    return d[1][1];
}

Compilation message (stderr)

crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:46:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   46 |         for(auto [y,cost]:g[u])
      |                  ^

• Subtask 1: 0 / 46
• Subtask 2: 0 / 43
• Subtask 3: 0 / 11