oj.uz

Submission #148281

# Submission time Handle Problem Language Result Execution time Memory
148281 2019-08-31T19:54:31 Z karma Crocodile's Underground City (IOI11_crocodile) C++14
0 / 100
 1378 ms 134128 KB 
#include <bits/stdc++.h>
#include "crocodile.h"
#define pb      emplace_back
#define mp      make_pair
#define fi      first
#define se      second

using namespace std;

const int N = int(1e5) + 2;
const int oo = int(1e9) + 7;
typedef pair<int, int> pii;

pii top;
int8_t vis[N];
vector<int> a[N];

int travel_plan(int n, int m, int r[][2], int l[], int k, int p[])
{
    priority_queue<pii, vector<pii>, greater<pii>> pq;
    for(int i = 0; i < m; ++i) a[r[i][0]].pb(i), a[r[i][1]].pb(i);
    for(int i = 0; i < k; ++i) vis[p[i]] = 1, pq.push(mp(0, p[i]));
    while(!pq.empty()) {
        top = pq.top(); pq.pop();
        if(!vis[top.se]) ++vis[top.se];
        else if(vis[top.se] == 1) {
            if(!top.se) return top.fi;
            for(int i: a[top.se])
                pq.push(mp(top.fi + l[i], r[i][0] ^ r[i][1] ^ top.se));
        }
    }
}

//int n, m, r[N][2], l[N], k, p[N];
//
//int main()
//{
//    ios_base::sync_with_stdio(0);
//    cin.tie(0), cout.tie(0);
//    if(fopen("test.inp", "r")) {
//        freopen("test.inp", "r", stdin);
//        freopen("test.out", "w", stdout);
//    }
//    cin >> n >> m >> k;
//    for(int i = 0; i < m; ++i) cin >> r[i][0] >> r[i][1] >> l[i];
//    for(int i = 0; i < k; ++i) cin >> p[i];
//    cout << travel_plan(n, m, r, l, k, p);
//}

Compilation message

crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:32:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
0 / 46.0

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

Subtask #2
0 / 43.0

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

Subtask #3
0 / 11.0

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