oj.uz

Submission #639509

# Submission time Handle Problem Language Result Execution time Memory
639509 2022-09-10T09:48:24 Z Cookie Crocodile's Underground City (IOI11_crocodile) C++14
0 / 100
 2 ms 2644 KB 
#include<bits/stdc++.h>
 
using namespace std;
#include<fstream>
 
#define ll long long
#define vt vector
#define pb push_back
#define fi first
#define se second
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
typedef unsigned long long ull;
 
#define pii pair<int, int>
const ll mod = 1e9 + 7;

#include<fstream>
ifstream fin("timeline.in");
ofstream fout("timeline.out");
 
const int mxn = 1e5;
const int inf = 1e9 + 3;
vt<pii>adj[mxn + 1];
pii d[mxn + 1]; // best and second best
struct ch{
    int u, d;
};
struct cmp{
    bool operator()(ch a, ch b){
        return(a.d > b.d);
    }
};


int travel_plan(int n, int m, int r[][2], int l[], int k, int p[]){
    for(int i = 0; i < n; i++){
        d[i].fi = d[i].se = inf;
    }
    for(int i = 0; i < m; i++){
        int u = r[i][0], v = r[i][1], w = l[i];
        adj[u].pb({v, w}); adj[v].pb({u, w});
    }
    priority_queue<ch, vt<ch>, cmp>pq; 
    for(int i = 0; i < k; i++){
        d[p[i]].fi = d[p[i]].se = 0;
        pq.push({p[i], 0});
    }
    while(!pq.empty()){
        ch nw = pq.top(); pq.pop();
        
        int u = nw.u, dd = nw.d;
        if(u == 0){
            return(dd);
        }
        if(d[u].se > dd)continue;
        for(auto i: adj[u]){
            int v = i.fi, w = i.se;
            if(dd + w < d[v].se){
                int cr = d[v].se;
                d[v].se = dd + w;
                if(d[v].fi > d[v].se)swap(d[v].fi, d[v].se);
                if(d[v].se < cr){
                    pq.push({v, d[v].se});
                }
            }
        }
    }
    assert(false);
    return(69);
}

Subtask #1
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Incorrect 2 ms 2644 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Incorrect 2 ms 2644 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Incorrect 2 ms 2644 KB Output isn't correct
4 Halted 0 ms 0 KB -