oj.uz

Submission #234764

# Submission time Handle Problem Language Result Execution time Memory
234764 2020-05-25T13:53:58 Z muhammad_hokimiyon Crocodile's Underground City (IOI11_crocodile) C++14
0 / 100
 6 ms 3456 KB 
#include "crocodile.h"
#include <bits/stdc++.h>

#define fi first
#define se second
#define ll long long
#define dl double long

using namespace std;

const int NN = 2e6 + 7;
const int maxn = 1e5 + 7;
//const int M = 22;
const int mod = 998244353;
const ll inf = 1e18 + 7;
const dl rf = 1e-14;
const int B = sqrt(maxn);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int b[maxn];
bool used[maxn];
vector < pair < int , int > > v[maxn];
vector < int > d(maxn , 2e9);
vector < int > d1(maxn , 2e9);

int travel_plan(int n, int m, int a[][2], int l[], int k, int p[])
{
    for( int i = 0; i < m; i++ ){
        a[i][0] += 1 , a[i][1] += 1;
    }
    for( int i = 0; i < m; i++ ){
        v[a[i][0]].push_back({ a[i][1] , l[i] });
        v[a[i][1]].push_back({ a[i][0] , l[i] });
    }
    set < pair < int , int > > s;
    for( int i = 0; i < k; i++ ){
        p[i] += 1;
        d[p[i]] = 0;
        d1[p[i]] = 0;
        s.insert({ 0 , p[i] });
    }
    while( !s.empty() ){
        auto x = *s.begin();
        s.erase(s.begin());
        for( auto y : v[x.se] ){
            if( d[y.fi] > y.se + x.fi ){
                s.erase({ d[y.fi] , y.fi });
                d1[y.fi] = d[y.fi];
                d[y.fi] = y.se + x.fi;
                s.insert({ d[y.fi] , y.fi });
            }else{
                if( d1[y.fi] > y.se + x.fi ){
                    d1[y.fi] = y.se + x.fi;
                }
            }
        }
    }
    if( d1[1] == 2e9 )d1[1] = d[1];
    return d1[1];
}

Subtask #1
0 / 46.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 3456 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 43.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 3456 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 3456 KB Output isn't correct
2 Halted 0 ms 0 KB -