oj.uz

Submission #1093709

# Submission time Handle Problem Language Result Execution time Memory
1093709 2024-09-27T10:13:57 Z Aviansh Crocodile's Underground City (IOI11_crocodile) C++17
0 / 100
 2000 ms 197720 KB 
#include <bits/stdc++.h>
#include "crocodile.h"

using namespace std;

int travel_plan(int n, int m, int edges[][2], int w[], int k, int p[])
{
    set<pair<int,int>> g[n];
    for(int i =0;i<m;i++){
        g[edges[i][0]].insert({edges[i][1],w[i]});
        g[edges[i][1]].insert({edges[i][0],w[i]});
    }
    bool ex[n];
    bool rem[n];
    bool vis[n];
    fill(rem,rem+n,0);
    fill(ex,ex+n,0);
    fill(vis,vis+n,0);
    priority_queue<array<int,3>,vector<array<int,3>>,greater<array<int,3>>>pq; // dist,destination,origin
    for(int i = 0;i<k;i++){
        vis[p[i]]=1;
        ex[p[i]]=1;
        for(pair<int,int>pa : g[p[i]]){
            pq.push({pa.second,pa.first,p[i]});
        }
    }
    while(!pq.empty()){
        array<int,3> a = pq.top();
        pq.pop();
        if(vis[a[1]]){
            continue;
        }
        if(rem[a[1]]){
            for(pair<int,int>p:g[a[1]]){
                if(vis[p.first]) continue;
                pq.push({a[0]+p.second,p.first,a[1]});
            }
            vis[a[1]]=1;
        }
        else{
            //cout << "removing edge: " << a[1] << " " << a[2] << "\n";
            g[a[1]].erase(g[a[1]].lower_bound({a[2],0}));
            rem[a[1]]=1;
        }
    }
    fill(vis,vis+n,0);
    pq.push({0,0,-1});
    vis[0]=1;
    while(!pq.empty()){
        array<int,3>a=pq.top();
        pq.pop();
        if(ex[a[1]]) return a[0];
        for(pair<int,int>p:g[a[1]]){
            if(vis[p.first]) continue;
            pq.push({p.second+a[0],p.first,a[1]});
        }
    }
    assert(0);
    return -1;
}

Subtask #1
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 856 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Execution timed out 2103 ms 197720 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #2
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 856 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Execution timed out 2103 ms 197720 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 856 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Execution timed out 2103 ms 197720 KB Time limit exceeded
9 Halted 0 ms 0 KB -