oj.uz

Submission #848168

# Submission time Handle Problem Language Result Execution time Memory
848168 2023-09-11T13:31:09 Z hariaakas646 Robot (JOI21_ho_t4) C++17
34 / 100
 3000 ms 57556 KB 
#include <bits/stdc++.h>

using namespace std;

#define scd(t) scanf("%d", &t)
#define sclld(t) scanf("%lld", &t)
#define forr(i, j, k) for (int i = j; i < k; i++)
#define frange(i, j) forr(i, 0, j)
#define all(cont) cont.begin(), cont.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<lli> vll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef long double ld;

void usaco()
{
    freopen("input.in", "r", stdin);
//    freopen("problem.out", "w", stdout);
}

struct Edge {
    int v;
    int c;
    lli p;
};

int main()
{
    // usaco();
    int n, m;
    scd(n);
    scd(m);
    
    vector<vector<Edge>> graph(n+1);
    vector<map<int, lli>> val(n+1);
    frange(i, m) {
        int a, b;
        int c;
        lli p;
        scd(a);
        scd(b);
        scd(c);
        sclld(p);
        Edge ed;
        ed.v = b;
        ed.c = c;
        ed.p = p;
        graph[a].pb(ed);
        ed.v = a;
        graph[b].pb(ed);
        val[a][c] += p;
        val[b][c] += p;
    }

    vll dist(n+1, 1e18);
    vector<map<int, lli>> dp(n+1);

    priority_queue<pair<lli, pii>> pq;
    vb vis(n+1);
    vector<map<int, bool>> vis2(n+1);

    dist[1] = 0;
    pq.push(mp(0, mp(1, 0)));

    while(pq.size()) {
        auto p = pq.top();
        pq.pop();
        if(!p.s.s) 
        {
            if(vis[p.s.f]) continue;
            vis[p.s.f] = true;
            
            for(auto e : graph[p.s.f]) {
                lli v = dist[p.s.f] + min(e.p, val[p.s.f][e.c] - e.p);
                if(v < dist[e.v]) {
                    dist[e.v] = v;
                    pq.push(mp(-v, mp(e.v, 0)));
                }
                if(dp[e.v].find(p.s.f) == dp[e.v].end() || dist[p.s.f] < dp[e.v][p.s.f]) {
                    dp[e.v][p.s.f] = dist[p.s.f];
                    pq.push(mp(-dist[p.s.f], mp(e.v, p.s.f)));
                }
            }
        }
        else {
            if(vis2[p.s.f][p.s.s]) continue;
            vis2[p.s.f][p.s.s] = true;
            lli v = 0;
            int c = 0;
            // map<int, lli> val;
            for(auto e : graph[p.s.f]) {
                if(e.v == p.s.s) {
                    v = e.p;
                    c = e.c;
                    val[p.s.f][e.c] -= e.p;
                }
                
            }
            for(auto e : graph[p.s.f]) {
                if(e.v == p.s.s) continue;
                lli v1 = v + dp[p.s.f][p.s.s] + min(e.p, val[p.s.f][e.c] - e.p);
                if(v1 < dist[e.v]) {
                    dist[e.v] = v1;
                    pq.push(mp(-v1, mp(e.v, 0)));
                }
                v1 = v + dp[p.s.f][p.s.s];
                if(dp[e.v].find(p.s.f) == dp[e.v].end() || v1 < dp[e.v][p.s.f]) {
                    dp[e.v][p.s.f] = v1;
                    pq.push(mp(-v1, mp(e.v, p.s.f)));
                }
            }
            val[p.s.f][c] += v;
        }
    }
    if(dist[n] <= 1e15)
        printf("%lld\n", dist[n]);
    else printf("-1\n");
}

Compilation message

Main.cpp: In function 'void usaco()':
Main.cpp:29:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |     freopen("input.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
Main.cpp:43:5: note: in expansion of macro 'scd'
   43 |     scd(n);
      |     ^~~
Main.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
Main.cpp:44:5: note: in expansion of macro 'scd'
   44 |     scd(m);
      |     ^~~
Main.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
Main.cpp:52:9: note: in expansion of macro 'scd'
   52 |         scd(a);
      |         ^~~
Main.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
Main.cpp:53:9: note: in expansion of macro 'scd'
   53 |         scd(b);
      |         ^~~
Main.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
Main.cpp:54:9: note: in expansion of macro 'scd'
   54 |         scd(c);
      |         ^~~
Main.cpp:6:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 | #define sclld(t) scanf("%lld", &t)
      |                  ~~~~~^~~~~~~~~~~~
Main.cpp:55:9: note: in expansion of macro 'sclld'
   55 |         sclld(p);
      |         ^~~~~

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 544 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 5 ms 600 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 137 ms 1096 KB Output is correct
10 Correct 77 ms 1524 KB Output is correct
11 Correct 68 ms 1112 KB Output is correct
12 Correct 31 ms 1104 KB Output is correct
13 Correct 72 ms 1112 KB Output is correct
14 Correct 69 ms 1112 KB Output is correct
15 Correct 2 ms 856 KB Output is correct
16 Correct 5 ms 1112 KB Output is correct
17 Correct 3 ms 856 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 18 ms 1112 KB Output is correct
20 Correct 2 ms 856 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 317 ms 32084 KB Output is correct
2 Correct 90 ms 15416 KB Output is correct
3 Correct 758 ms 44556 KB Output is correct
4 Correct 156 ms 22640 KB Output is correct
5 Execution timed out 3040 ms 57556 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 544 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 5 ms 600 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 137 ms 1096 KB Output is correct
10 Correct 77 ms 1524 KB Output is correct
11 Correct 68 ms 1112 KB Output is correct
12 Correct 31 ms 1104 KB Output is correct
13 Correct 72 ms 1112 KB Output is correct
14 Correct 69 ms 1112 KB Output is correct
15 Correct 2 ms 856 KB Output is correct
16 Correct 5 ms 1112 KB Output is correct
17 Correct 3 ms 856 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 18 ms 1112 KB Output is correct
20 Correct 2 ms 856 KB Output is correct
21 Correct 317 ms 32084 KB Output is correct
22 Correct 90 ms 15416 KB Output is correct
23 Correct 758 ms 44556 KB Output is correct
24 Correct 156 ms 22640 KB Output is correct
25 Execution timed out 3040 ms 57556 KB Time limit exceeded
26 Halted 0 ms 0 KB -