oj.uz

Submission #644271

# Submission time Handle Problem Language Result Execution time Memory
644271 2022-09-24T10:13:20 Z ToroTN Crocodile's Underground City (IOI11_crocodile) C++14
100 / 100
 442 ms 45580 KB 
#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,vis[100005],deg[100005];
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]=1e9;
        d[i][1]=1e9;
    }
    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;
        //printf("%d %d %d\n",u,d[u][0],d[u][1]);
        pq.pop();
        if(vis[u]==1)continue;
        vis[u]=1;
        for(auto [y,cost]:g[u])
        {
            // if(d[y][0]==2e9&&d[y][1]==2e9)
            // {
            //     d[y][0]=d[u][1]+cost;
            //     d[y][1]=d[u][1]+cost;
            //     pq.push({-d[y][1],y});
            //     continue;
            // }
            if(d[u][1]+cost<=d[y][0])
            {
                d[y][1]=d[y][0];
                d[y][0]=d[u][1]+cost;
                 if(++deg[y]>=2&&vis[y]==0)
                {
                    pq.push({-d[y][1],y});
                }
            }else if(d[u][1]+cost<d[y][1])
            {
                d[y][1]=d[u][1]+cost;
                 if(++deg[y]>=2&&vis[y]==0)
                {
                    pq.push({-d[y][1],y});
                }
            }
            
        }
    }
    return d[1][1];
}

Compilation message

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

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 3 ms 2900 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 4 ms 3028 KB Output is correct
13 Correct 4 ms 3028 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 3 ms 2900 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 4 ms 3028 KB Output is correct
13 Correct 4 ms 3028 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct
16 Correct 375 ms 41504 KB Output is correct
17 Correct 63 ms 11212 KB Output is correct
18 Correct 79 ms 12456 KB Output is correct
19 Correct 442 ms 45580 KB Output is correct
20 Correct 240 ms 36628 KB Output is correct
21 Correct 32 ms 6488 KB Output is correct
22 Correct 255 ms 32052 KB Output is correct