oj.uz

Submission #459618

# Submission time Handle Problem Language Result Execution time Memory
459618 2021-08-08T20:45:33 Z nickmet2004 Aesthetic (NOI20_aesthetic) C++11
73 / 100
 845 ms 134684 KB 
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 3e5 + 5;
ll n , m , au[N] , av[N] , aw[N];
ll u , v , w , A = 0;
vector<pair<ll, pair<ll , ll> > >  adj[N];
ll d1[N] , dn[N] , f[N] , par[N] , path[N] , son[N];
priority_queue<pair<ll , ll> > pq;
multiset<pair<ll , ll>> S;
vector<ll> B[N] , T[N];
void q(int x){
    f[x] = 1;
    for(auto y : adj[x]){
        //cout << "h";
        auto it = S.find({dn[y.first] + y.second.first + d1[x] , y.second.second});
        if(f[y.first]) S.erase(it);
        else S.insert({dn[x] + y.second.first + d1[y.first] , y.second.second});
    }
}
void dfs(int u , int p){
    if(path[u]) son[u] = u;
    else son[u] = son[p];
    T[son[u]].emplace_back(u);
    for(int v : B[u]) dfs(v , u);
}
main (){
    ios_base::sync_with_stdio(0); //cin.tie(0);
    scanf("%lld%lld" , &n , &m);
    for(int i  =0; i <m; ++i) scanf("%lld%lld%lld" , &au[i] , &av[i], &aw[i]);
    for(int i = m - 1; ~i; --i){
        u = au[i] , v = av[i] , w= aw[i];
        adj[u].push_back({v , {w , A}});
        adj[v].push_back({u , {w , A}});
        A = max(A , w);
        //cout << "j";
    }

    for(int i = 1; i <= n; ++i) d1[i] = dn[i] = 1e18;
    d1[1] = 0;
    dn[n] = 0;
    pq.push({0 , 1});
    while(pq.size()){
        auto T = pq.top(); pq.pop();
        u = T.second , w = -T.first;
        if(f[u])continue;
        f[u] = 1;
        for(auto e : adj[u]){
            v = e.first;
            if(!f[v] && d1[v] > w + e.second.first){
                par[v] = u;
                d1[v] = w + e.second.first;
                pq.push({-d1[v] , v});
            }
        }
        //cout << "k";
    }
    for(int i = 1; i <= n; ++i)f[i] = 0;
    //memset(f , 0 ,sizeof(f));
    pq.push({0, n});
    while(pq.size()){
        auto T = pq.top(); pq.pop();
        u = T.second , w = -T.first;
        if(f[u])continue;
        f[u] = 1;
        for(auto e : adj[u]){
            v = e.first;
            if(!f[v] && dn[v] > w + e.second.first){
                dn[v]= w + e.second.first;
                pq.push({-dn[v] , v});
            }
        }
        //cout << "l";
    }

    ll X = n;
    while(1){
        path[X] = 1;
        if(X == 1) break;
        X = par[X];
        //cout << "n";
    }

    for(int i = 1; i <= n; ++i)B[par[i]].emplace_back(i);
    dfs(1 , 0);

    for(int i = 1; i <= n; ++i) f[i] =0;
    u = n;
    ll ans = d1[n];
    //cout << "ka";
    ll k;
    while(1){
        //cout << "ha";
        if(u == 1)break;
        for(ll v : T[u]) q(v);
        //if(!S.size())continue;
        k = S.begin()->first + S.begin()->second;
        auto i = S.begin();
        ++i;
        if(i != S.end()) k =min(k , i->first);
        ans = max(ans , k);
        u = par[u];
    }
    //cout << ans;
    printf("%lld" ,ans);
}

Compilation message

Aesthetic.cpp:27:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   27 | main (){
      | ^~~~
Aesthetic.cpp: In function 'int main()':
Aesthetic.cpp:29:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |     scanf("%lld%lld" , &n , &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
Aesthetic.cpp:30:36: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     for(int i  =0; i <m; ++i) scanf("%lld%lld%lld" , &au[i] , &av[i], &aw[i]);
      |                               ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 21532 KB Output is correct
2 Correct 12 ms 21512 KB Output is correct
3 Correct 12 ms 21452 KB Output is correct
4 Correct 12 ms 21556 KB Output is correct
5 Correct 12 ms 21492 KB Output is correct
6 Correct 12 ms 21452 KB Output is correct
7 Correct 13 ms 21532 KB Output is correct
8 Correct 12 ms 21428 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 21532 KB Output is correct
2 Correct 12 ms 21512 KB Output is correct
3 Correct 12 ms 21452 KB Output is correct
4 Correct 12 ms 21556 KB Output is correct
5 Correct 12 ms 21492 KB Output is correct
6 Correct 12 ms 21452 KB Output is correct
7 Correct 13 ms 21532 KB Output is correct
8 Correct 12 ms 21428 KB Output is correct
9 Correct 14 ms 21788 KB Output is correct
10 Correct 14 ms 21760 KB Output is correct
11 Correct 14 ms 21708 KB Output is correct
12 Correct 14 ms 21788 KB Output is correct
13 Correct 14 ms 21696 KB Output is correct
14 Correct 13 ms 21740 KB Output is correct
15 Correct 14 ms 21708 KB Output is correct
16 Correct 14 ms 21784 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 721 ms 70088 KB Output is correct
2 Correct 706 ms 69716 KB Output is correct
3 Correct 686 ms 69684 KB Output is correct
4 Correct 679 ms 69808 KB Output is correct
5 Correct 713 ms 70244 KB Output is correct
6 Correct 725 ms 71396 KB Output is correct
7 Correct 709 ms 70780 KB Output is correct
8 Correct 713 ms 71528 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 702 ms 71712 KB Output is correct
2 Correct 705 ms 70564 KB Output is correct
3 Correct 716 ms 68924 KB Output is correct
4 Correct 743 ms 70980 KB Output is correct
5 Correct 709 ms 70672 KB Output is correct
6 Correct 742 ms 71452 KB Output is correct
7 Correct 707 ms 70604 KB Output is correct
8 Correct 692 ms 70820 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 554 ms 64864 KB Output is correct
2 Correct 291 ms 68804 KB Output is correct
3 Correct 282 ms 59856 KB Output is correct
4 Correct 262 ms 58768 KB Output is correct
5 Correct 312 ms 58424 KB Output is correct
6 Correct 284 ms 59648 KB Output is correct
7 Correct 262 ms 58144 KB Output is correct
8 Correct 275 ms 58472 KB Output is correct
9 Correct 259 ms 57496 KB Output is correct
10 Correct 290 ms 60652 KB Output is correct
11 Correct 262 ms 58264 KB Output is correct
12 Correct 611 ms 65568 KB Output is correct
13 Correct 280 ms 58484 KB Output is correct
14 Correct 240 ms 80888 KB Output is correct
15 Correct 177 ms 70672 KB Output is correct
16 Correct 534 ms 64732 KB Output is correct
17 Correct 579 ms 64836 KB Output is correct
18 Correct 497 ms 63092 KB Output is correct
19 Correct 300 ms 69184 KB Output is correct
20 Correct 301 ms 69096 KB Output is correct
21 Correct 304 ms 69044 KB Output is correct
22 Correct 297 ms 68888 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 554 ms 64864 KB Output is correct
2 Correct 291 ms 68804 KB Output is correct
3 Correct 282 ms 59856 KB Output is correct
4 Correct 262 ms 58768 KB Output is correct
5 Correct 312 ms 58424 KB Output is correct
6 Correct 284 ms 59648 KB Output is correct
7 Correct 262 ms 58144 KB Output is correct
8 Correct 275 ms 58472 KB Output is correct
9 Correct 259 ms 57496 KB Output is correct
10 Correct 290 ms 60652 KB Output is correct
11 Correct 262 ms 58264 KB Output is correct
12 Correct 611 ms 65568 KB Output is correct
13 Correct 280 ms 58484 KB Output is correct
14 Correct 240 ms 80888 KB Output is correct
15 Correct 177 ms 70672 KB Output is correct
16 Correct 534 ms 64732 KB Output is correct
17 Correct 579 ms 64836 KB Output is correct
18 Correct 497 ms 63092 KB Output is correct
19 Correct 300 ms 69184 KB Output is correct
20 Correct 301 ms 69096 KB Output is correct
21 Correct 304 ms 69044 KB Output is correct
22 Correct 297 ms 68888 KB Output is correct
23 Correct 730 ms 66288 KB Output is correct
24 Correct 359 ms 69132 KB Output is correct
25 Correct 386 ms 58904 KB Output is correct
26 Correct 359 ms 58504 KB Output is correct
27 Correct 345 ms 58444 KB Output is correct
28 Correct 424 ms 60024 KB Output is correct
29 Correct 416 ms 58720 KB Output is correct
30 Correct 369 ms 59244 KB Output is correct
31 Correct 401 ms 59920 KB Output is correct
32 Correct 377 ms 57720 KB Output is correct
33 Correct 419 ms 59400 KB Output is correct
34 Correct 698 ms 65944 KB Output is correct
35 Correct 397 ms 58400 KB Output is correct
36 Correct 267 ms 83684 KB Output is correct
37 Correct 298 ms 83764 KB Output is correct
38 Correct 681 ms 65536 KB Output is correct
39 Correct 708 ms 65200 KB Output is correct
40 Correct 776 ms 66228 KB Output is correct
41 Correct 353 ms 69200 KB Output is correct
42 Correct 381 ms 69104 KB Output is correct
43 Correct 352 ms 69056 KB Output is correct
44 Correct 352 ms 69156 KB Output is correct

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 21532 KB Output is correct
2 Correct 12 ms 21512 KB Output is correct
3 Correct 12 ms 21452 KB Output is correct
4 Correct 12 ms 21556 KB Output is correct
5 Correct 12 ms 21492 KB Output is correct
6 Correct 12 ms 21452 KB Output is correct
7 Correct 13 ms 21532 KB Output is correct
8 Correct 12 ms 21428 KB Output is correct
9 Correct 14 ms 21788 KB Output is correct
10 Correct 14 ms 21760 KB Output is correct
11 Correct 14 ms 21708 KB Output is correct
12 Correct 14 ms 21788 KB Output is correct
13 Correct 14 ms 21696 KB Output is correct
14 Correct 13 ms 21740 KB Output is correct
15 Correct 14 ms 21708 KB Output is correct
16 Correct 14 ms 21784 KB Output is correct
17 Correct 721 ms 70088 KB Output is correct
18 Correct 706 ms 69716 KB Output is correct
19 Correct 686 ms 69684 KB Output is correct
20 Correct 679 ms 69808 KB Output is correct
21 Correct 713 ms 70244 KB Output is correct
22 Correct 725 ms 71396 KB Output is correct
23 Correct 709 ms 70780 KB Output is correct
24 Correct 713 ms 71528 KB Output is correct
25 Correct 702 ms 71712 KB Output is correct
26 Correct 705 ms 70564 KB Output is correct
27 Correct 716 ms 68924 KB Output is correct
28 Correct 743 ms 70980 KB Output is correct
29 Correct 709 ms 70672 KB Output is correct
30 Correct 742 ms 71452 KB Output is correct
31 Correct 707 ms 70604 KB Output is correct
32 Correct 692 ms 70820 KB Output is correct
33 Correct 554 ms 64864 KB Output is correct
34 Correct 291 ms 68804 KB Output is correct
35 Correct 282 ms 59856 KB Output is correct
36 Correct 262 ms 58768 KB Output is correct
37 Correct 312 ms 58424 KB Output is correct
38 Correct 284 ms 59648 KB Output is correct
39 Correct 262 ms 58144 KB Output is correct
40 Correct 275 ms 58472 KB Output is correct
41 Correct 259 ms 57496 KB Output is correct
42 Correct 290 ms 60652 KB Output is correct
43 Correct 262 ms 58264 KB Output is correct
44 Correct 611 ms 65568 KB Output is correct
45 Correct 280 ms 58484 KB Output is correct
46 Correct 240 ms 80888 KB Output is correct
47 Correct 177 ms 70672 KB Output is correct
48 Correct 534 ms 64732 KB Output is correct
49 Correct 579 ms 64836 KB Output is correct
50 Correct 497 ms 63092 KB Output is correct
51 Correct 300 ms 69184 KB Output is correct
52 Correct 301 ms 69096 KB Output is correct
53 Correct 304 ms 69044 KB Output is correct
54 Correct 297 ms 68888 KB Output is correct
55 Correct 730 ms 66288 KB Output is correct
56 Correct 359 ms 69132 KB Output is correct
57 Correct 386 ms 58904 KB Output is correct
58 Correct 359 ms 58504 KB Output is correct
59 Correct 345 ms 58444 KB Output is correct
60 Correct 424 ms 60024 KB Output is correct
61 Correct 416 ms 58720 KB Output is correct
62 Correct 369 ms 59244 KB Output is correct
63 Correct 401 ms 59920 KB Output is correct
64 Correct 377 ms 57720 KB Output is correct
65 Correct 419 ms 59400 KB Output is correct
66 Correct 698 ms 65944 KB Output is correct
67 Correct 397 ms 58400 KB Output is correct
68 Correct 267 ms 83684 KB Output is correct
69 Correct 298 ms 83764 KB Output is correct
70 Correct 681 ms 65536 KB Output is correct
71 Correct 708 ms 65200 KB Output is correct
72 Correct 776 ms 66228 KB Output is correct
73 Correct 353 ms 69200 KB Output is correct
74 Correct 381 ms 69104 KB Output is correct
75 Correct 352 ms 69056 KB Output is correct
76 Correct 352 ms 69156 KB Output is correct
77 Correct 845 ms 66576 KB Output is correct
78 Correct 362 ms 69256 KB Output is correct
79 Correct 421 ms 59176 KB Output is correct
80 Correct 443 ms 58012 KB Output is correct
81 Correct 428 ms 59140 KB Output is correct
82 Correct 476 ms 59056 KB Output is correct
83 Correct 448 ms 58428 KB Output is correct
84 Correct 460 ms 58552 KB Output is correct
85 Correct 398 ms 59648 KB Output is correct
86 Correct 435 ms 59144 KB Output is correct
87 Correct 428 ms 58356 KB Output is correct
88 Correct 639 ms 65660 KB Output is correct
89 Correct 454 ms 58964 KB Output is correct
90 Correct 304 ms 83664 KB Output is correct
91 Correct 345 ms 83624 KB Output is correct
92 Runtime error 773 ms 134684 KB Execution killed with signal 6
93 Halted 0 ms 0 KB -