Submission #411249

#	Time	Username	Problem	Language	Result	Execution time	Memory
411249		LouayFarah	Crocodile's Underground City (IOI11_crocodile)	C++14	0 / 100	1 ms	204 KiB

crocodile

#include "bits/stdc++.h"
#include "crocodile.h"
using namespace std;
 
#define fi first
#define se second
#define pb push_back
#define mp make_pair
 
void dfs(vector<pair<int, int>> tree[], vector<int> &dist, vector<int> &len, int u, int e)
{
    for(auto v: tree[u])
    {
        if(v.first==e)
            continue;
        dist[v.fi] = dist[u] + v.se;
        len[v.fi] = len[u] + 1;
        dfs(tree, dist, len, v.fi, u);
    }
}
 
int travel_plan(int n, int m, int r[][2], int l[], int k, int p[])
{
    vector<pair<int, int>> tree[n];
    for(int i = 0; i<m; i++)
    {
        tree[r[i][0]].pb(mp(r[i][1], l[i]));
        tree[r[i][1]].pb(mp(r[i][0], l[i]));
    }
 
    vector<int> dist(n, 0);
    vector<int> len(n, 0);
    dfs(tree, dist, len, 0, -1);
 
    int res = 0;
 
    vector<pair<int, int>> v;
    for(int i = 0; i<k; i++)
    {
        v.pb(mp(dist[p[i]], len[p[i]]));
    }
 
    sort(v.begin(), v.end());
 
    for(int i = 0; i<k; i++)
    {
        if(v[i].se<i+1)
        {
            res = v[i].fi;
            break;
        }
    }
 
    return res;
}

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