oj.uz

Submission #518628

# Submission time Handle Problem Language Result Execution time Memory
518628 2022-01-24T10:13:56 Z KhoaHo Robot (JOI21_ho_t4) C++11
100 / 100
 158 ms 21276 KB 
/// KoJa
#include <bits/stdc++.h>
using namespace std;
#define task "QG04PAINT"
#define pb push_back
#define SZ(a) (a).begin(), (a).end()
#define SZZ(a, Begin, End) (a) + (Begin), (a) + (Begin) + (End)
#define BIT(a) (1LL << (a))
#define vec vector
#define fi first
#define se second

typedef long long ll;
typedef pair<ll, int> ii;

template <class T>
inline bool maximize(T &a, const T &b) { return (a < b ? (a = b, 1) : 0); }
template <class T>
inline bool minimize(T &a, const T &b) { return (a > b ? (a = b, 1) : 0); }
void init()
{
    freopen(task ".inp", "r", stdin);
    freopen(task ".out", "w", stdout);
}
void fastio()
{
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL);
    cout.tie(NULL);
}
const int N = int(2e5) + 1000;
const ll INF = 1e18;
int n, m;
ll dist[N], best[N], sum[N];
struct Edge
{
    int to, c;
    ll cost;
    Edge(int _to = 0, int _c = 0, ll _cost = 0)
    {
        to = _to;
        c = _c;
        cost = _cost;
    }
};
vec<Edge> adj[N];
int main()
{
    fastio();
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int u, v, c;
        ll cost;
        cin >> u >> v >> c >> cost;
        adj[u].pb(Edge(v, c, cost));
        adj[v].pb(Edge(u, c, cost));
    }
    for (int i = 1; i <= n; i++)
        dist[i] = INF;
    for (int i = 1; i <= m; i++)
    {
        best[i] = INF;
        sum[i] = 0;
    }
    dist[1] = 0;
    priority_queue<ii> q;
    q.push(ii(0, 1));
    while (!q.empty())
    {
        int u = q.top().se;
        ll du = -q.top().fi;
        // cout << u << " " << -du << '\n';
        q.pop();
        if (du != dist[u])
            continue;

        for (Edge x : adj[u])
        {
            sum[x.c] += x.cost;
            best[x.c] = min(best[x.c], dist[x.to]);
        }

        for (Edge x : adj[u])
        {
            if (minimize(dist[x.to], du + min(x.cost, sum[x.c] - x.cost)))
                q.push(ii(-dist[x.to], x.to));
            if (minimize(dist[x.to], best[x.c] + sum[x.c] - x.cost))
                q.push(ii(-dist[x.to], x.to));
        }

        for (Edge x : adj[u])
        {
            sum[x.c] = 0;
            best[x.c] = INF;
        }
    }
    if (dist[n] >= INF)
        cout << -1;
    else
        cout << dist[n];
    return 0;
}

Compilation message

Main.cpp: In function 'void init()':
Main.cpp:22:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     freopen(task ".inp", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:23:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |     freopen(task ".out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4940 KB Output is correct
2 Correct 2 ms 4940 KB Output is correct
3 Correct 2 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 5060 KB Output is correct
6 Correct 2 ms 4940 KB Output is correct
7 Correct 3 ms 5068 KB Output is correct
8 Correct 3 ms 5036 KB Output is correct
9 Correct 4 ms 5188 KB Output is correct
10 Correct 3 ms 5196 KB Output is correct
11 Correct 3 ms 5196 KB Output is correct
12 Correct 3 ms 5184 KB Output is correct
13 Correct 4 ms 5192 KB Output is correct
14 Correct 3 ms 5252 KB Output is correct
15 Correct 3 ms 5064 KB Output is correct
16 Correct 4 ms 5196 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 3 ms 5068 KB Output is correct
19 Correct 4 ms 5188 KB Output is correct
20 Correct 4 ms 5276 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 10868 KB Output is correct
2 Correct 20 ms 7756 KB Output is correct
3 Correct 61 ms 14828 KB Output is correct
4 Correct 29 ms 9104 KB Output is correct
5 Correct 121 ms 20384 KB Output is correct
6 Correct 130 ms 21276 KB Output is correct
7 Correct 113 ms 20592 KB Output is correct
8 Correct 131 ms 19532 KB Output is correct
9 Correct 135 ms 19396 KB Output is correct
10 Correct 73 ms 14512 KB Output is correct
11 Correct 45 ms 12344 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4940 KB Output is correct
2 Correct 2 ms 4940 KB Output is correct
3 Correct 2 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 5060 KB Output is correct
6 Correct 2 ms 4940 KB Output is correct
7 Correct 3 ms 5068 KB Output is correct
8 Correct 3 ms 5036 KB Output is correct
9 Correct 4 ms 5188 KB Output is correct
10 Correct 3 ms 5196 KB Output is correct
11 Correct 3 ms 5196 KB Output is correct
12 Correct 3 ms 5184 KB Output is correct
13 Correct 4 ms 5192 KB Output is correct
14 Correct 3 ms 5252 KB Output is correct
15 Correct 3 ms 5064 KB Output is correct
16 Correct 4 ms 5196 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 3 ms 5068 KB Output is correct
19 Correct 4 ms 5188 KB Output is correct
20 Correct 4 ms 5276 KB Output is correct
21 Correct 46 ms 10868 KB Output is correct
22 Correct 20 ms 7756 KB Output is correct
23 Correct 61 ms 14828 KB Output is correct
24 Correct 29 ms 9104 KB Output is correct
25 Correct 121 ms 20384 KB Output is correct
26 Correct 130 ms 21276 KB Output is correct
27 Correct 113 ms 20592 KB Output is correct
28 Correct 131 ms 19532 KB Output is correct
29 Correct 135 ms 19396 KB Output is correct
30 Correct 73 ms 14512 KB Output is correct
31 Correct 45 ms 12344 KB Output is correct
32 Correct 61 ms 14788 KB Output is correct
33 Correct 62 ms 13528 KB Output is correct
34 Correct 93 ms 16020 KB Output is correct
35 Correct 80 ms 14500 KB Output is correct
36 Correct 93 ms 15132 KB Output is correct
37 Correct 111 ms 18144 KB Output is correct
38 Correct 106 ms 20472 KB Output is correct
39 Correct 82 ms 17600 KB Output is correct
40 Correct 158 ms 19424 KB Output is correct
41 Correct 155 ms 19520 KB Output is correct
42 Correct 131 ms 19000 KB Output is correct
43 Correct 52 ms 12520 KB Output is correct
44 Correct 91 ms 19716 KB Output is correct
45 Correct 107 ms 16184 KB Output is correct
46 Correct 92 ms 15668 KB Output is correct
47 Correct 115 ms 17412 KB Output is correct
48 Correct 147 ms 20520 KB Output is correct