oj.uz

Submission #639506

# Submission time Handle Problem Language Result Execution time Memory
639506 2022-09-10T09:43:56 Z Cookie Crocodile's Underground City (IOI11_crocodile) C++14
89 / 100
 406 ms 63512 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 = 2e5;
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 n, m, k;
int r[10][2], l[10], p[10];
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){
                d[v].se = dd + w;
                if(d[v].fi > d[v].se)swap(d[v].fi, d[v].se);
                if(d[v].se != inf){
                    pq.push({v, d[v].se});
                }
            }
        }
    }
    return(69);
}

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 5028 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 3 ms 5040 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 5028 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 3 ms 5040 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 4 ms 5204 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 5 ms 5460 KB Output is correct
13 Correct 5 ms 5460 KB Output is correct
14 Correct 4 ms 5028 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 5028 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 3 ms 5040 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 4 ms 5204 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 5 ms 5460 KB Output is correct
13 Correct 5 ms 5460 KB Output is correct
14 Correct 4 ms 5028 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 363 ms 59648 KB Output is correct
17 Correct 63 ms 16076 KB Output is correct
18 Correct 78 ms 17548 KB Output is correct
19 Correct 406 ms 63512 KB Output is correct
20 Correct 249 ms 52004 KB Output is correct
21 Correct 35 ms 10032 KB Output is correct
22 Incorrect 261 ms 48284 KB Output isn't correct
23 Halted 0 ms 0 KB -