oj.uz

Submission #459620

# Submission time Handle Problem Language Result Execution time Memory
459620 2021-08-08T20:50:08 Z nickmet2004 Aesthetic (NOI20_aesthetic) C++11
73 / 100
 908 ms 134580 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;
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);
        u = par[u];
        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);
    }
    //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 12 ms 21452 KB Output is correct
2 Correct 12 ms 21452 KB Output is correct
3 Correct 12 ms 21440 KB Output is correct
4 Correct 12 ms 21552 KB Output is correct
5 Correct 12 ms 21532 KB Output is correct
6 Correct 12 ms 21440 KB Output is correct
7 Correct 12 ms 21452 KB Output is correct
8 Correct 12 ms 21544 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 21452 KB Output is correct
2 Correct 12 ms 21452 KB Output is correct
3 Correct 12 ms 21440 KB Output is correct
4 Correct 12 ms 21552 KB Output is correct
5 Correct 12 ms 21532 KB Output is correct
6 Correct 12 ms 21440 KB Output is correct
7 Correct 12 ms 21452 KB Output is correct
8 Correct 12 ms 21544 KB Output is correct
9 Correct 14 ms 21836 KB Output is correct
10 Correct 14 ms 21836 KB Output is correct
11 Correct 13 ms 21780 KB Output is correct
12 Correct 14 ms 21732 KB Output is correct
13 Correct 13 ms 21712 KB Output is correct
14 Correct 13 ms 21784 KB Output is correct
15 Correct 14 ms 21708 KB Output is correct
16 Correct 13 ms 21800 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 724 ms 70088 KB Output is correct
2 Correct 720 ms 69620 KB Output is correct
3 Correct 723 ms 69836 KB Output is correct
4 Correct 718 ms 69848 KB Output is correct
5 Correct 695 ms 70196 KB Output is correct
6 Correct 752 ms 71368 KB Output is correct
7 Correct 714 ms 70656 KB Output is correct
8 Correct 734 ms 71528 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 755 ms 71712 KB Output is correct
2 Correct 747 ms 70672 KB Output is correct
3 Correct 734 ms 68868 KB Output is correct
4 Correct 748 ms 70872 KB Output is correct
5 Correct 689 ms 70680 KB Output is correct
6 Correct 701 ms 71492 KB Output is correct
7 Correct 721 ms 70636 KB Output is correct
8 Correct 703 ms 70936 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 541 ms 64908 KB Output is correct
2 Correct 297 ms 68856 KB Output is correct
3 Correct 290 ms 59796 KB Output is correct
4 Correct 274 ms 58804 KB Output is correct
5 Correct 293 ms 58424 KB Output is correct
6 Correct 288 ms 59656 KB Output is correct
7 Correct 243 ms 58184 KB Output is correct
8 Correct 256 ms 58680 KB Output is correct
9 Correct 252 ms 57492 KB Output is correct
10 Correct 299 ms 60696 KB Output is correct
11 Correct 249 ms 58196 KB Output is correct
12 Correct 599 ms 65632 KB Output is correct
13 Correct 261 ms 58552 KB Output is correct
14 Correct 251 ms 80892 KB Output is correct
15 Correct 176 ms 70724 KB Output is correct
16 Correct 536 ms 64712 KB Output is correct
17 Correct 559 ms 64716 KB Output is correct
18 Correct 473 ms 63112 KB Output is correct
19 Correct 296 ms 69092 KB Output is correct
20 Correct 307 ms 68988 KB Output is correct
21 Correct 303 ms 69060 KB Output is correct
22 Correct 297 ms 68940 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 541 ms 64908 KB Output is correct
2 Correct 297 ms 68856 KB Output is correct
3 Correct 290 ms 59796 KB Output is correct
4 Correct 274 ms 58804 KB Output is correct
5 Correct 293 ms 58424 KB Output is correct
6 Correct 288 ms 59656 KB Output is correct
7 Correct 243 ms 58184 KB Output is correct
8 Correct 256 ms 58680 KB Output is correct
9 Correct 252 ms 57492 KB Output is correct
10 Correct 299 ms 60696 KB Output is correct
11 Correct 249 ms 58196 KB Output is correct
12 Correct 599 ms 65632 KB Output is correct
13 Correct 261 ms 58552 KB Output is correct
14 Correct 251 ms 80892 KB Output is correct
15 Correct 176 ms 70724 KB Output is correct
16 Correct 536 ms 64712 KB Output is correct
17 Correct 559 ms 64716 KB Output is correct
18 Correct 473 ms 63112 KB Output is correct
19 Correct 296 ms 69092 KB Output is correct
20 Correct 307 ms 68988 KB Output is correct
21 Correct 303 ms 69060 KB Output is correct
22 Correct 297 ms 68940 KB Output is correct
23 Correct 735 ms 66112 KB Output is correct
24 Correct 358 ms 69316 KB Output is correct
25 Correct 370 ms 58976 KB Output is correct
26 Correct 371 ms 58620 KB Output is correct
27 Correct 381 ms 58296 KB Output is correct
28 Correct 445 ms 60092 KB Output is correct
29 Correct 456 ms 58752 KB Output is correct
30 Correct 407 ms 59240 KB Output is correct
31 Correct 435 ms 59756 KB Output is correct
32 Correct 388 ms 57684 KB Output is correct
33 Correct 490 ms 59416 KB Output is correct
34 Correct 768 ms 66088 KB Output is correct
35 Correct 395 ms 58388 KB Output is correct
36 Correct 276 ms 83652 KB Output is correct
37 Correct 304 ms 83696 KB Output is correct
38 Correct 644 ms 65464 KB Output is correct
39 Correct 725 ms 65112 KB Output is correct
40 Correct 763 ms 66268 KB Output is correct
41 Correct 356 ms 69188 KB Output is correct
42 Correct 361 ms 69248 KB Output is correct
43 Correct 352 ms 69260 KB Output is correct
44 Correct 352 ms 69292 KB Output is correct

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 21452 KB Output is correct
2 Correct 12 ms 21452 KB Output is correct
3 Correct 12 ms 21440 KB Output is correct
4 Correct 12 ms 21552 KB Output is correct
5 Correct 12 ms 21532 KB Output is correct
6 Correct 12 ms 21440 KB Output is correct
7 Correct 12 ms 21452 KB Output is correct
8 Correct 12 ms 21544 KB Output is correct
9 Correct 14 ms 21836 KB Output is correct
10 Correct 14 ms 21836 KB Output is correct
11 Correct 13 ms 21780 KB Output is correct
12 Correct 14 ms 21732 KB Output is correct
13 Correct 13 ms 21712 KB Output is correct
14 Correct 13 ms 21784 KB Output is correct
15 Correct 14 ms 21708 KB Output is correct
16 Correct 13 ms 21800 KB Output is correct
17 Correct 724 ms 70088 KB Output is correct
18 Correct 720 ms 69620 KB Output is correct
19 Correct 723 ms 69836 KB Output is correct
20 Correct 718 ms 69848 KB Output is correct
21 Correct 695 ms 70196 KB Output is correct
22 Correct 752 ms 71368 KB Output is correct
23 Correct 714 ms 70656 KB Output is correct
24 Correct 734 ms 71528 KB Output is correct
25 Correct 755 ms 71712 KB Output is correct
26 Correct 747 ms 70672 KB Output is correct
27 Correct 734 ms 68868 KB Output is correct
28 Correct 748 ms 70872 KB Output is correct
29 Correct 689 ms 70680 KB Output is correct
30 Correct 701 ms 71492 KB Output is correct
31 Correct 721 ms 70636 KB Output is correct
32 Correct 703 ms 70936 KB Output is correct
33 Correct 541 ms 64908 KB Output is correct
34 Correct 297 ms 68856 KB Output is correct
35 Correct 290 ms 59796 KB Output is correct
36 Correct 274 ms 58804 KB Output is correct
37 Correct 293 ms 58424 KB Output is correct
38 Correct 288 ms 59656 KB Output is correct
39 Correct 243 ms 58184 KB Output is correct
40 Correct 256 ms 58680 KB Output is correct
41 Correct 252 ms 57492 KB Output is correct
42 Correct 299 ms 60696 KB Output is correct
43 Correct 249 ms 58196 KB Output is correct
44 Correct 599 ms 65632 KB Output is correct
45 Correct 261 ms 58552 KB Output is correct
46 Correct 251 ms 80892 KB Output is correct
47 Correct 176 ms 70724 KB Output is correct
48 Correct 536 ms 64712 KB Output is correct
49 Correct 559 ms 64716 KB Output is correct
50 Correct 473 ms 63112 KB Output is correct
51 Correct 296 ms 69092 KB Output is correct
52 Correct 307 ms 68988 KB Output is correct
53 Correct 303 ms 69060 KB Output is correct
54 Correct 297 ms 68940 KB Output is correct
55 Correct 735 ms 66112 KB Output is correct
56 Correct 358 ms 69316 KB Output is correct
57 Correct 370 ms 58976 KB Output is correct
58 Correct 371 ms 58620 KB Output is correct
59 Correct 381 ms 58296 KB Output is correct
60 Correct 445 ms 60092 KB Output is correct
61 Correct 456 ms 58752 KB Output is correct
62 Correct 407 ms 59240 KB Output is correct
63 Correct 435 ms 59756 KB Output is correct
64 Correct 388 ms 57684 KB Output is correct
65 Correct 490 ms 59416 KB Output is correct
66 Correct 768 ms 66088 KB Output is correct
67 Correct 395 ms 58388 KB Output is correct
68 Correct 276 ms 83652 KB Output is correct
69 Correct 304 ms 83696 KB Output is correct
70 Correct 644 ms 65464 KB Output is correct
71 Correct 725 ms 65112 KB Output is correct
72 Correct 763 ms 66268 KB Output is correct
73 Correct 356 ms 69188 KB Output is correct
74 Correct 361 ms 69248 KB Output is correct
75 Correct 352 ms 69260 KB Output is correct
76 Correct 352 ms 69292 KB Output is correct
77 Correct 908 ms 66740 KB Output is correct
78 Correct 356 ms 69188 KB Output is correct
79 Correct 461 ms 59272 KB Output is correct
80 Correct 442 ms 57980 KB Output is correct
81 Correct 416 ms 59208 KB Output is correct
82 Correct 502 ms 59080 KB Output is correct
83 Correct 428 ms 58328 KB Output is correct
84 Correct 459 ms 58380 KB Output is correct
85 Correct 395 ms 59428 KB Output is correct
86 Correct 435 ms 58976 KB Output is correct
87 Correct 437 ms 58300 KB Output is correct
88 Correct 593 ms 65728 KB Output is correct
89 Correct 445 ms 58852 KB Output is correct
90 Correct 304 ms 83692 KB Output is correct
91 Correct 344 ms 83844 KB Output is correct
92 Runtime error 799 ms 134580 KB Execution killed with signal 6
93 Halted 0 ms 0 KB -