oj.uz

답안 #915777

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
915777 2024-01-24T17:08:10 Z ace5 Robot (JOI21_ho_t4) C++17
100 / 100
 1236 ms 77488 KB 
#include <bits/stdc++.h>

using namespace std;

#define int int64_t

const int INF = 1e18;

struct edge
{
    edge(int _v,int _to,int _c,int _p){v = _v;to = _to;c = _c;p = _p;};
    edge(){v = 0;to = 0;c = 0;p = 0;};
    int v;
    int to;
    int c;
    int p;
};

vector<vector<int>> g;
vector<map<int,vector<int>>> rc;
vector<map<int,int>> sum;
vector<edge> e;
vector<int> dist;
vector<int> vis;
set<pair<int,int>> ff;

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n,m;
    cin >> n >> m;
    g.resize(n);
    rc.resize(n);
    sum.resize(n);
    for(int j = 0;j < m;++j)
    {
        int u,v,c,p;
        cin >> u >> v >> c >> p;
        u--;
        v--;
        e.push_back(edge(u,v,c,p));
        g[u].push_back(j);
        g[v].push_back(j);
        sum[u][c] += p;
        sum[v][c] += p;
        rc[u][c].push_back(j);
        rc[v][c].push_back(j);
    }
    for(int j = 0;j < n;++j)
    {
        for(auto& c:rc[j])
        {
            sort(c.second.begin(),c.second.end(),[&](int ind1,int ind2){return e[ind1].p > e[ind2].p;});
        }
    }
    dist.resize(n);
    vis.resize(n);
    for(int j =0 ;j < n;++j)
    {
        dist[j] = INF;
        vis[j] = 0;
    }
    dist[0] =0;
    ff.insert({0,0});
    while(ff.size())
    {
        int v = (*ff.begin()).second;
        ff.erase(ff.begin());
        vis[v] = 1;
        for(auto ind:g[v])
        {
            int u = e[ind].v + e[ind].to - v;
            int64_t nu = dist[v] + min(e[ind].p,sum[v][e[ind].c]-e[ind].p);
            if(!vis[u] && dist[u] > nu)
            {
                ff.erase({dist[u],u});
                dist[u] = nu;
                ff.insert({dist[u],u});
            }
            if(rc[u][e[ind].c].size() >= 2)
            {
                int ind2 = (rc[u][e[ind].c][0] == ind ? rc[u][e[ind].c][1] : rc[u][e[ind].c][0]);
                int64_t v2 = e[ind2].v+e[ind2].to-u;
                if(!vis[v2] && dist[v2] > dist[v] + sum[u][e[ind2].c] - e[ind2].p)
                {
                    ff.erase({dist[v2],v2});
                    dist[v2] = dist[v] + sum[u][e[ind2].c] - e[ind2].p;
                    ff.insert({dist[v2],v2});
                }
            }
        }
    }
    cout << (dist[n-1] == INF ? -1 : dist[n-1]);
    return 0;
}

Subtask #1
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 3 ms 1116 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 2 ms 860 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 1 ms 796 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 860 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 169 ms 21920 KB Output is correct
2 Correct 40 ms 11468 KB Output is correct
3 Correct 234 ms 23736 KB Output is correct
4 Correct 70 ms 15808 KB Output is correct
5 Correct 1071 ms 72632 KB Output is correct
6 Correct 834 ms 62128 KB Output is correct
7 Correct 383 ms 51268 KB Output is correct
8 Correct 420 ms 48156 KB Output is correct
9 Correct 408 ms 48048 KB Output is correct
10 Correct 320 ms 38084 KB Output is correct
11 Correct 124 ms 32628 KB Output is correct

Subtask #3
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 3 ms 1116 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 2 ms 860 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 1 ms 796 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 860 KB Output is correct
21 Correct 169 ms 21920 KB Output is correct
22 Correct 40 ms 11468 KB Output is correct
23 Correct 234 ms 23736 KB Output is correct
24 Correct 70 ms 15808 KB Output is correct
25 Correct 1071 ms 72632 KB Output is correct
26 Correct 834 ms 62128 KB Output is correct
27 Correct 383 ms 51268 KB Output is correct
28 Correct 420 ms 48156 KB Output is correct
29 Correct 408 ms 48048 KB Output is correct
30 Correct 320 ms 38084 KB Output is correct
31 Correct 124 ms 32628 KB Output is correct
32 Correct 111 ms 21444 KB Output is correct
33 Correct 126 ms 19788 KB Output is correct
34 Correct 359 ms 42140 KB Output is correct
35 Correct 278 ms 32612 KB Output is correct
36 Correct 394 ms 45192 KB Output is correct
37 Correct 360 ms 49328 KB Output is correct
38 Correct 360 ms 53616 KB Output is correct
39 Correct 132 ms 24036 KB Output is correct
40 Correct 431 ms 52656 KB Output is correct
41 Correct 493 ms 53944 KB Output is correct
42 Correct 555 ms 60464 KB Output is correct
43 Correct 184 ms 27464 KB Output is correct
44 Correct 333 ms 33600 KB Output is correct
45 Correct 403 ms 48316 KB Output is correct
46 Correct 313 ms 49596 KB Output is correct
47 Correct 417 ms 52096 KB Output is correct
48 Correct 1236 ms 77488 KB Output is correct