oj.uz

Submission #498771

# Submission time Handle Problem Language Result Execution time Memory
498771 2021-12-26T10:22:53 Z gs18103 None (KOI16_gas) C++17
42 / 100
 55 ms 4776 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define em emplace
#define all(v) v.begin(), v.end()

using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const int MAX = 2500;
const int INF = 1e9;
const ll LINF = 1e12;

ll c[MAX];
int n, m;
vector <pair <int, ll> > g[MAX], ng[MAX];

void djikstra(int v) {
    vector <ll> d(n+1);
    for(int i = 1; i <= n; i++) {
        d[i] = LINF;
    }
    d[v] = 0;
    priority_queue <pll, vector <pll>, greater <pll> > pq;
    pq.em(0, v);
    while(!pq.empty()) {
        int x = pq.top().se;
        ll temp = pq.top().fi;
        pq.pop();
        if(temp > d[x]) continue;
        for(auto i : g[x]) {
            int y = i.fi;
            if(d[y] > d[x] + i.se) {
                d[y] = d[x] + i.se;
                pq.em(d[y], y);
            }
        }
    }
    cout << endl;
    for(int i = 1; i <= n; i++) {
        if(i == v) continue;
        ng[v].eb(i, c[v] * d[i]);
    }
}

void ndjikstra(int v) {
    vector <ll> d(n+1);
    for(int i = 1; i <= n; i++) {
        d[i] = LINF;
    }
    d[v] = 0;
    priority_queue <pll, vector <pll>, greater <pll> > pq;
    pq.em(0, v);
    while(!pq.empty()) {
        int x = pq.top().se;
        ll temp = pq.top().fi;
        pq.pop();
        if(temp > d[x]) continue;
        for(auto i : ng[x]) {
            int y = i.fi;
            if(d[y] > d[x] + i.se) {
                d[y] = d[x] + i.se;
                pq.em(d[y], y);
            }
        }
    }
    cout << d[n];
}

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);

    cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        cin >> c[i];
    }
    for(int i = 1; i <= m; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        g[u].eb(v, w), g[v].eb(u, w);
    }
    for(int i = 1; i <= n; i++) {
        djikstra(i);
    }
    ndjikstra(1);
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 432 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 4 ms 1104 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 1088 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 432 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 19 ms 4548 KB Output is correct
15 Correct 18 ms 4528 KB Output is correct
16 Correct 15 ms 4560 KB Output is correct
17 Correct 51 ms 4680 KB Output is correct
18 Correct 55 ms 4776 KB Output is correct
19 Correct 25 ms 4412 KB Output is correct
20 Correct 29 ms 4380 KB Output is correct
21 Correct 27 ms 4400 KB Output is correct
22 Correct 27 ms 4432 KB Output is correct

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 432 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Runtime error 4 ms 1104 KB Execution killed with signal 6
15 Halted 0 ms 0 KB -