oj.uz

Submission #445894

# Submission time Handle Problem Language Result Execution time Memory
445894 2021-07-20T05:32:05 Z cpp219 Robot (JOI21_ho_t4) C++14
100 / 100
 1216 ms 89964 KB 
#pragma GCC optimization O2
#pragma GCC optimization "unroll-loop"
#pragma target ("avx2")

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fs first
#define sc second
using namespace std;
typedef pair<ll,ll> LL;
const ll N = 1e5 + 9;
const ll Log2 = 20;
const ll inf = 1e16 + 7;

map<ll,ll> s[N],d[N];
map<ll,vector<LL>> g[N];
ll n,m,x,y,c,p,ans = inf;

struct Node{
    ll val,u,c;
};

bool operator < (Node a,Node b){
    return a.val > b.val;
}

priority_queue<Node> pq;

void Add(ll u,ll c,ll val){
    if (d[u][c] > val) d[u][c] = val,pq.push({val,u,c});
}

int main(){
    ios_base::sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
    #define task "tst"
    if (fopen(task".INP","r")){
        freopen(task".INP","r",stdin);
        //freopen(task".OUT","w",stdout);
    }
    cin>>n>>m;
    while(m--){
        cin>>x>>y>>c>>p;
        g[x][c].push_back({y,p});
        g[y][c].push_back({x,p});
        s[x][c] += p; s[y][c] += p;
        d[x][c] = d[y][c] = inf;
    }
    for (ll i = 1;i <= n;i++) d[i][0] = inf;
    d[1][0] = 0;
    pq.push({0,1,0});

    while(!pq.empty()){
        Node t = pq.top(); pq.pop();
        ll u = t.u,c = t.c,val = t.val;
        if (val != d[u][c]) continue;
        if (c){
            for (auto i : g[u][c]) Add(i.fs,0,val + s[u][c] - i.sc);
        }
        else{
            for (auto i : g[u]){
                for (auto j : i.sc){
                    ll v = j.fs,L = j.sc;
                    Add(v,0,val + L);
                    Add(v,0,val + s[u][i.fs] - L);
                    Add(v,i.fs,val);
                }
            }
        }
    }
    ans = d[n][0];
    if (ans != inf) cout<<ans;
    else cout<<-1;
}

Compilation message

Main.cpp:1: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    1 | #pragma GCC optimization O2
      | 
Main.cpp:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization "unroll-loop"
      | 
Main.cpp:3: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    3 | #pragma target ("avx2")
      | 
Main.cpp: In function 'int main()':
Main.cpp:38:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |         freopen(task".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14284 KB Output is correct
2 Correct 9 ms 14404 KB Output is correct
3 Correct 9 ms 14284 KB Output is correct
4 Correct 9 ms 14404 KB Output is correct
5 Correct 9 ms 14412 KB Output is correct
6 Correct 9 ms 14412 KB Output is correct
7 Correct 9 ms 14532 KB Output is correct
8 Correct 9 ms 14412 KB Output is correct
9 Correct 14 ms 15180 KB Output is correct
10 Correct 13 ms 15052 KB Output is correct
11 Correct 11 ms 14796 KB Output is correct
12 Correct 12 ms 14796 KB Output is correct
13 Correct 11 ms 14852 KB Output is correct
14 Correct 11 ms 14924 KB Output is correct
15 Correct 10 ms 14692 KB Output is correct
16 Correct 11 ms 14800 KB Output is correct
17 Correct 11 ms 14796 KB Output is correct
18 Correct 10 ms 14684 KB Output is correct
19 Correct 12 ms 14612 KB Output is correct
20 Correct 10 ms 14704 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 286 ms 34628 KB Output is correct
2 Correct 119 ms 25088 KB Output is correct
3 Correct 290 ms 31048 KB Output is correct
4 Correct 164 ms 28608 KB Output is correct
5 Correct 1188 ms 89128 KB Output is correct
6 Correct 964 ms 75944 KB Output is correct
7 Correct 486 ms 59924 KB Output is correct
8 Correct 503 ms 52572 KB Output is correct
9 Correct 532 ms 52548 KB Output is correct
10 Correct 489 ms 51304 KB Output is correct
11 Correct 194 ms 40180 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14284 KB Output is correct
2 Correct 9 ms 14404 KB Output is correct
3 Correct 9 ms 14284 KB Output is correct
4 Correct 9 ms 14404 KB Output is correct
5 Correct 9 ms 14412 KB Output is correct
6 Correct 9 ms 14412 KB Output is correct
7 Correct 9 ms 14532 KB Output is correct
8 Correct 9 ms 14412 KB Output is correct
9 Correct 14 ms 15180 KB Output is correct
10 Correct 13 ms 15052 KB Output is correct
11 Correct 11 ms 14796 KB Output is correct
12 Correct 12 ms 14796 KB Output is correct
13 Correct 11 ms 14852 KB Output is correct
14 Correct 11 ms 14924 KB Output is correct
15 Correct 10 ms 14692 KB Output is correct
16 Correct 11 ms 14800 KB Output is correct
17 Correct 11 ms 14796 KB Output is correct
18 Correct 10 ms 14684 KB Output is correct
19 Correct 12 ms 14612 KB Output is correct
20 Correct 10 ms 14704 KB Output is correct
21 Correct 286 ms 34628 KB Output is correct
22 Correct 119 ms 25088 KB Output is correct
23 Correct 290 ms 31048 KB Output is correct
24 Correct 164 ms 28608 KB Output is correct
25 Correct 1188 ms 89128 KB Output is correct
26 Correct 964 ms 75944 KB Output is correct
27 Correct 486 ms 59924 KB Output is correct
28 Correct 503 ms 52572 KB Output is correct
29 Correct 532 ms 52548 KB Output is correct
30 Correct 489 ms 51304 KB Output is correct
31 Correct 194 ms 40180 KB Output is correct
32 Correct 182 ms 25796 KB Output is correct
33 Correct 237 ms 29024 KB Output is correct
34 Correct 610 ms 50616 KB Output is correct
35 Correct 430 ms 42676 KB Output is correct
36 Correct 432 ms 51732 KB Output is correct
37 Correct 474 ms 54608 KB Output is correct
38 Correct 560 ms 64400 KB Output is correct
39 Correct 186 ms 28256 KB Output is correct
40 Correct 533 ms 52456 KB Output is correct
41 Correct 572 ms 52420 KB Output is correct
42 Correct 713 ms 64916 KB Output is correct
43 Correct 323 ms 38912 KB Output is correct
44 Correct 620 ms 39520 KB Output is correct
45 Correct 423 ms 49252 KB Output is correct
46 Correct 370 ms 49884 KB Output is correct
47 Correct 453 ms 53572 KB Output is correct
48 Correct 1216 ms 89964 KB Output is correct