oj.uz

Submission #383556

# Submission time Handle Problem Language Result Execution time Memory
383556 2021-03-30T09:32:44 Z valerikk Robot (JOI21_ho_t4) C++17
100 / 100
 1295 ms 155216 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long 
const ll INF = 1e18;
const int N = 101010, M = 202020;
const int V = 2020202;

int n, m;
struct edge {
    int a, b, c;
    ll p;
} e[2 * M];
vector<ll> sum[N];
vector<pair<ll, int>> g[V];
int cnt;
ll d[V];
vector<int> cs[N], vv[N];
int an[N], sz[N];

void go(int st) {
    for (int i = 0; i < cnt; i++) d[i] = INF;
    priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> q;
    d[st] = 0;
    q.push({d[st], st});
    while (!q.empty()) {
        auto t = q.top();
        q.pop();
        int v = t.second;
        if (t.first != d[v]) continue;
        for (auto p : g[v]) {
            ll w = p.first;
            int u = p.second;
            //cout << w << " " << u << "\n";
            if (d[v] + w < d[u]) {
                d[u] = d[v] + w;
                q.push({d[u], u});
            }
        }
    }
}

int getpos(int v, int c) {
    return lower_bound(cs[v].begin(), cs[v].end(), c) - cs[v].begin();
}

int main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
#endif
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        cin >> e[i].a >> e[i].b >> e[i].c >> e[i].p;
        e[i].a--;
        e[i].b--;
        e[i].c--;
        e[i + m] = e[i];
        swap(e[i + m].a, e[i + m].b);
    }
    
    for (int i = 0; i < 2 * m; i++) cs[e[i].a].push_back(e[i].c);
    cnt = 4 * m;
    for (int i = 0; i < n; i++) {
        sort(cs[i].begin(), cs[i].end());
        cs[i].erase(unique(cs[i].begin(), cs[i].end()), cs[i].end());
        sz[i] = cs[i].size();
        sum[i].resize(sz[i]);
        for (int j = 0; j < sz[i]; j++) sum[i][j] = 0;
        vv[i].resize(sz[i]);
        for (int j = 0; j < sz[i]; j++) vv[i][j] = cnt++;
        an[i] = cnt++;
    }
    for (int i = 0; i < 2 * m; i++) {
        int pos = getpos(e[i].a, e[i].c);
        sum[e[i].a][pos] += e[i].p;
    }
    
    for (int i = 0; i < 2 * m; i++) {
        //cout << e[i].a << " " << e[i].b << " " << e[i].c << " " << e[i].p << "\n";
        int pos = getpos(e[i].a, e[i].c);
        ll s = sum[e[i].a][pos] - e[i].p;
        g[an[e[i].a]].push_back({s, i});
        g[an[e[i].a]].push_back({0, i + 2 * m});
        g[vv[e[i].a][pos]].push_back({s, i});
        
        g[i + 2 * m].push_back({e[i].p, an[e[i].b]});
        g[i].push_back({0, an[e[i].b]});
        
        pos = getpos(e[i].b, e[i].c);
        g[i + 2 * m].push_back({0, vv[e[i].b][pos]});
    }
    
    int st = an[0], fin = an[n - 1];
    go(st);
    if (d[fin] == INF) {
        cout << "-1\n";
    } else cout << d[fin] << "\n";
    return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 54892 KB Output is correct
2 Correct 43 ms 54892 KB Output is correct
3 Correct 42 ms 54892 KB Output is correct
4 Correct 38 ms 54892 KB Output is correct
5 Correct 42 ms 55020 KB Output is correct
6 Correct 38 ms 54892 KB Output is correct
7 Correct 39 ms 55276 KB Output is correct
8 Correct 39 ms 55148 KB Output is correct
9 Correct 43 ms 55916 KB Output is correct
10 Correct 48 ms 55916 KB Output is correct
11 Correct 43 ms 56044 KB Output is correct
12 Correct 41 ms 55788 KB Output is correct
13 Correct 44 ms 55916 KB Output is correct
14 Correct 43 ms 55916 KB Output is correct
15 Correct 40 ms 55404 KB Output is correct
16 Correct 43 ms 55788 KB Output is correct
17 Correct 41 ms 55660 KB Output is correct
18 Correct 39 ms 55276 KB Output is correct
19 Correct 42 ms 55916 KB Output is correct
20 Correct 45 ms 55532 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 470 ms 92004 KB Output is correct
2 Correct 212 ms 71864 KB Output is correct
3 Correct 665 ms 119000 KB Output is correct
4 Correct 294 ms 80608 KB Output is correct
5 Correct 1184 ms 151644 KB Output is correct
6 Correct 1124 ms 150320 KB Output is correct
7 Correct 904 ms 148648 KB Output is correct
8 Correct 1138 ms 145132 KB Output is correct
9 Correct 1181 ms 145260 KB Output is correct
10 Correct 697 ms 113424 KB Output is correct
11 Correct 380 ms 101228 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 54892 KB Output is correct
2 Correct 43 ms 54892 KB Output is correct
3 Correct 42 ms 54892 KB Output is correct
4 Correct 38 ms 54892 KB Output is correct
5 Correct 42 ms 55020 KB Output is correct
6 Correct 38 ms 54892 KB Output is correct
7 Correct 39 ms 55276 KB Output is correct
8 Correct 39 ms 55148 KB Output is correct
9 Correct 43 ms 55916 KB Output is correct
10 Correct 48 ms 55916 KB Output is correct
11 Correct 43 ms 56044 KB Output is correct
12 Correct 41 ms 55788 KB Output is correct
13 Correct 44 ms 55916 KB Output is correct
14 Correct 43 ms 55916 KB Output is correct
15 Correct 40 ms 55404 KB Output is correct
16 Correct 43 ms 55788 KB Output is correct
17 Correct 41 ms 55660 KB Output is correct
18 Correct 39 ms 55276 KB Output is correct
19 Correct 42 ms 55916 KB Output is correct
20 Correct 45 ms 55532 KB Output is correct
21 Correct 470 ms 92004 KB Output is correct
22 Correct 212 ms 71864 KB Output is correct
23 Correct 665 ms 119000 KB Output is correct
24 Correct 294 ms 80608 KB Output is correct
25 Correct 1184 ms 151644 KB Output is correct
26 Correct 1124 ms 150320 KB Output is correct
27 Correct 904 ms 148648 KB Output is correct
28 Correct 1138 ms 145132 KB Output is correct
29 Correct 1181 ms 145260 KB Output is correct
30 Correct 697 ms 113424 KB Output is correct
31 Correct 380 ms 101228 KB Output is correct
32 Correct 584 ms 121716 KB Output is correct
33 Correct 582 ms 107112 KB Output is correct
34 Correct 913 ms 124888 KB Output is correct
35 Correct 757 ms 110328 KB Output is correct
36 Correct 796 ms 118236 KB Output is correct
37 Correct 883 ms 134688 KB Output is correct
38 Correct 906 ms 148280 KB Output is correct
39 Correct 840 ms 138324 KB Output is correct
40 Correct 1113 ms 146596 KB Output is correct
41 Correct 1175 ms 146920 KB Output is correct
42 Correct 1057 ms 141028 KB Output is correct
43 Correct 438 ms 98936 KB Output is correct
44 Correct 991 ms 147808 KB Output is correct
45 Correct 877 ms 126700 KB Output is correct
46 Correct 760 ms 120428 KB Output is correct
47 Correct 858 ms 131544 KB Output is correct
48 Correct 1295 ms 155216 KB Output is correct