oj.uz

Submission #466513

# Submission time Handle Problem Language Result Execution time Memory
466513 2021-08-19T14:21:48 Z Killer2501 Robot (JOI21_ho_t4) C++14
100 / 100
 1400 ms 109844 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define task "262144"
#define pll pair<ll, ll>
#define pi pair<ll, pll>
#define fi first
#define se second

using namespace std;
const ll mod = 1e15;
const ll N = 2e5+5;
const int base = 313;
ll n, m, t, k, T, ans, tong, a[N];
vector<ll> adj[N];
vector<ll> kq;
ll pw(ll k, ll n)
{
    ll total = 1;
    for(; n; n >>= 1)
    {
        if(n & 1)total = total * k % mod;
        k = k * k % mod;
    }
    return total;
}
map<ll, vector<pll>> mp[N];
map<ll, ll> dp[N], b[N];
void sol()
{
    cin >> n >> m;
    while(m -- > 0)
    {
        ll x, y, c, p;
        cin >> x >> y >> c >> p;
        b[x][c] += p;
        b[y][c] += p;
        mp[x][c].pb({p, y});
        mp[y][c].pb({p, x});
        dp[x][c] = mod;
        dp[y][c] = mod;
    }
    for(int i = 1; i <= n; i ++)dp[i][0] = mod;
    dp[1][0] = 0;
    priority_queue< pi, vector<pi>, greater<pi> > pq;
    pq.push({0, {1, 0}});
    while(!pq.empty())
    {
        pi u = pq.top();
        pq.pop();
        if(u.fi != dp[u.se.fi][u.se.se])continue;
        if(u.se.se)
        {
            for(pll v : mp[u.se.fi][u.se.se])
            {
                if(dp[v.se][0] > u.fi + b[u.se.fi][u.se.se] - v.fi)
                {
                   dp[v.se][0] = u.fi + b[u.se.fi][u.se.se] - v.fi;
                   pq.push({dp[v.se][0], {v.se, 0}});
                }
            }
        }
        else
        {
            for(auto vi : mp[u.se.fi])
            {
                for(pll v : vi.se)
                {
                    //cout << u.se.fi << " " << v.se <<" "<<v.fi << endl;
                    if(dp[v.se][vi.fi] > u.fi )
                    {
                       dp[v.se][vi.fi] = u.fi;
                       pq.push({dp[v.se][vi.fi], {v.se, vi.fi}});
                    }
                    if(dp[v.se][0] > u.fi + min(v.fi, b[u.se.fi][vi.fi] - v.fi))
                    {
                       dp[v.se][0] = u.fi + min(v.fi, b[u.se.fi][vi.fi] - v.fi);
                       pq.push({dp[v.se][0], {v.se, 0}});
                    }
                }
            }
        }
    }
    ans = dp[n][0];
    if(ans == mod)ans = -1;
    cout << ans;
}
int main()
{
    if(fopen(task".in", "r"))
    {
       freopen(task".in", "r", stdin);
       freopen(task".out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int ntest = 1;
    //cin >> ntest;
    while(ntest -- > 0)
    sol();
}
/*
4 5 2
10 9 5 2
6 4 20 15
9 7 10 9
-1 -1 16 11
1 2 3
2 3 3
1 4 1
4 3 1
3 1 1

*/

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:92:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   92 |        freopen(task".in", "r", stdin);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:93:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |        freopen(task".out", "w", stdout);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 33100 KB Output is correct
2 Correct 18 ms 33088 KB Output is correct
3 Correct 20 ms 33120 KB Output is correct
4 Correct 20 ms 33100 KB Output is correct
5 Correct 19 ms 33228 KB Output is correct
6 Correct 19 ms 33112 KB Output is correct
7 Correct 20 ms 33356 KB Output is correct
8 Correct 19 ms 33204 KB Output is correct
9 Correct 24 ms 33856 KB Output is correct
10 Correct 23 ms 33868 KB Output is correct
11 Correct 20 ms 33596 KB Output is correct
12 Correct 20 ms 33596 KB Output is correct
13 Correct 21 ms 33720 KB Output is correct
14 Correct 21 ms 33840 KB Output is correct
15 Correct 20 ms 33424 KB Output is correct
16 Correct 21 ms 33612 KB Output is correct
17 Correct 21 ms 33664 KB Output is correct
18 Correct 19 ms 33468 KB Output is correct
19 Correct 21 ms 33484 KB Output is correct
20 Correct 20 ms 33456 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 316 ms 55592 KB Output is correct
2 Correct 127 ms 44560 KB Output is correct
3 Correct 308 ms 52240 KB Output is correct
4 Correct 165 ms 48200 KB Output is correct
5 Correct 1321 ms 108496 KB Output is correct
6 Correct 1039 ms 98428 KB Output is correct
7 Correct 473 ms 82452 KB Output is correct
8 Correct 537 ms 75196 KB Output is correct
9 Correct 580 ms 75264 KB Output is correct
10 Correct 497 ms 72252 KB Output is correct
11 Correct 200 ms 60660 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 33100 KB Output is correct
2 Correct 18 ms 33088 KB Output is correct
3 Correct 20 ms 33120 KB Output is correct
4 Correct 20 ms 33100 KB Output is correct
5 Correct 19 ms 33228 KB Output is correct
6 Correct 19 ms 33112 KB Output is correct
7 Correct 20 ms 33356 KB Output is correct
8 Correct 19 ms 33204 KB Output is correct
9 Correct 24 ms 33856 KB Output is correct
10 Correct 23 ms 33868 KB Output is correct
11 Correct 20 ms 33596 KB Output is correct
12 Correct 20 ms 33596 KB Output is correct
13 Correct 21 ms 33720 KB Output is correct
14 Correct 21 ms 33840 KB Output is correct
15 Correct 20 ms 33424 KB Output is correct
16 Correct 21 ms 33612 KB Output is correct
17 Correct 21 ms 33664 KB Output is correct
18 Correct 19 ms 33468 KB Output is correct
19 Correct 21 ms 33484 KB Output is correct
20 Correct 20 ms 33456 KB Output is correct
21 Correct 316 ms 55592 KB Output is correct
22 Correct 127 ms 44560 KB Output is correct
23 Correct 308 ms 52240 KB Output is correct
24 Correct 165 ms 48200 KB Output is correct
25 Correct 1321 ms 108496 KB Output is correct
26 Correct 1039 ms 98428 KB Output is correct
27 Correct 473 ms 82452 KB Output is correct
28 Correct 537 ms 75196 KB Output is correct
29 Correct 580 ms 75264 KB Output is correct
30 Correct 497 ms 72252 KB Output is correct
31 Correct 200 ms 60660 KB Output is correct
32 Correct 185 ms 48048 KB Output is correct
33 Correct 254 ms 50712 KB Output is correct
34 Correct 571 ms 72924 KB Output is correct
35 Correct 417 ms 64368 KB Output is correct
36 Correct 433 ms 71944 KB Output is correct
37 Correct 532 ms 76440 KB Output is correct
38 Correct 530 ms 86668 KB Output is correct
39 Correct 197 ms 51640 KB Output is correct
40 Correct 548 ms 76512 KB Output is correct
41 Correct 633 ms 76812 KB Output is correct
42 Correct 673 ms 88508 KB Output is correct
43 Correct 305 ms 59280 KB Output is correct
44 Correct 587 ms 63224 KB Output is correct
45 Correct 441 ms 71916 KB Output is correct
46 Correct 365 ms 72132 KB Output is correct
47 Correct 443 ms 75708 KB Output is correct
48 Correct 1400 ms 109844 KB Output is correct