oj.uz

답안 #459627

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
459627 2021-08-08T21:02:15 Z nickmet2004 Aesthetic (NOI20_aesthetic) C++11
73 / 100
 857 ms 134764 KB 
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 3e5 + 10;
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];
multiset<pair<ll , ll>> S;
vector<ll> B[N] , T[N];
void q(ll 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;
    priority_queue<pair<ll , ll> > pq;
    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:26:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   26 | main (){
      | ^~~~
Aesthetic.cpp: In function 'int main()':
Aesthetic.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |     scanf("%lld%lld" , &n , &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
Aesthetic.cpp:29:36: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |     for(int i  =0; i <m; ++i) scanf("%lld%lld%lld" , &au[i] , &av[i], &aw[i]);
      |                               ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 21452 KB Output is correct
2 Correct 14 ms 21548 KB Output is correct
3 Correct 14 ms 21544 KB Output is correct
4 Correct 14 ms 21476 KB Output is correct
5 Correct 14 ms 21452 KB Output is correct
6 Correct 14 ms 21428 KB Output is correct
7 Correct 14 ms 21484 KB Output is correct
8 Correct 14 ms 21464 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 21452 KB Output is correct
2 Correct 14 ms 21548 KB Output is correct
3 Correct 14 ms 21544 KB Output is correct
4 Correct 14 ms 21476 KB Output is correct
5 Correct 14 ms 21452 KB Output is correct
6 Correct 14 ms 21428 KB Output is correct
7 Correct 14 ms 21484 KB Output is correct
8 Correct 14 ms 21464 KB Output is correct
9 Correct 15 ms 21708 KB Output is correct
10 Correct 15 ms 21772 KB Output is correct
11 Correct 15 ms 21708 KB Output is correct
12 Correct 15 ms 21824 KB Output is correct
13 Correct 14 ms 21764 KB Output is correct
14 Correct 15 ms 21744 KB Output is correct
15 Correct 15 ms 21708 KB Output is correct
16 Correct 15 ms 21764 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 733 ms 70064 KB Output is correct
2 Correct 734 ms 69828 KB Output is correct
3 Correct 718 ms 69684 KB Output is correct
4 Correct 719 ms 69948 KB Output is correct
5 Correct 705 ms 70196 KB Output is correct
6 Correct 743 ms 71388 KB Output is correct
7 Correct 730 ms 70704 KB Output is correct
8 Correct 734 ms 71432 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 724 ms 71716 KB Output is correct
2 Correct 724 ms 70600 KB Output is correct
3 Correct 717 ms 68876 KB Output is correct
4 Correct 734 ms 70984 KB Output is correct
5 Correct 724 ms 70692 KB Output is correct
6 Correct 727 ms 71472 KB Output is correct
7 Correct 727 ms 70636 KB Output is correct
8 Correct 742 ms 70928 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 547 ms 64840 KB Output is correct
2 Correct 300 ms 68956 KB Output is correct
3 Correct 278 ms 59904 KB Output is correct
4 Correct 270 ms 58788 KB Output is correct
5 Correct 257 ms 58448 KB Output is correct
6 Correct 267 ms 59708 KB Output is correct
7 Correct 261 ms 58120 KB Output is correct
8 Correct 259 ms 58556 KB Output is correct
9 Correct 249 ms 57508 KB Output is correct
10 Correct 288 ms 60728 KB Output is correct
11 Correct 257 ms 58172 KB Output is correct
12 Correct 648 ms 65672 KB Output is correct
13 Correct 277 ms 58424 KB Output is correct
14 Correct 235 ms 80868 KB Output is correct
15 Correct 179 ms 70836 KB Output is correct
16 Correct 501 ms 64672 KB Output is correct
17 Correct 570 ms 64652 KB Output is correct
18 Correct 469 ms 63024 KB Output is correct
19 Correct 302 ms 69188 KB Output is correct
20 Correct 300 ms 69104 KB Output is correct
21 Correct 309 ms 68972 KB Output is correct
22 Correct 293 ms 69096 KB Output is correct

Subtask #6
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 547 ms 64840 KB Output is correct
2 Correct 300 ms 68956 KB Output is correct
3 Correct 278 ms 59904 KB Output is correct
4 Correct 270 ms 58788 KB Output is correct
5 Correct 257 ms 58448 KB Output is correct
6 Correct 267 ms 59708 KB Output is correct
7 Correct 261 ms 58120 KB Output is correct
8 Correct 259 ms 58556 KB Output is correct
9 Correct 249 ms 57508 KB Output is correct
10 Correct 288 ms 60728 KB Output is correct
11 Correct 257 ms 58172 KB Output is correct
12 Correct 648 ms 65672 KB Output is correct
13 Correct 277 ms 58424 KB Output is correct
14 Correct 235 ms 80868 KB Output is correct
15 Correct 179 ms 70836 KB Output is correct
16 Correct 501 ms 64672 KB Output is correct
17 Correct 570 ms 64652 KB Output is correct
18 Correct 469 ms 63024 KB Output is correct
19 Correct 302 ms 69188 KB Output is correct
20 Correct 300 ms 69104 KB Output is correct
21 Correct 309 ms 68972 KB Output is correct
22 Correct 293 ms 69096 KB Output is correct
23 Correct 784 ms 66120 KB Output is correct
24 Correct 388 ms 69072 KB Output is correct
25 Correct 420 ms 58936 KB Output is correct
26 Correct 403 ms 58528 KB Output is correct
27 Correct 372 ms 58248 KB Output is correct
28 Correct 432 ms 60040 KB Output is correct
29 Correct 457 ms 58752 KB Output is correct
30 Correct 381 ms 59456 KB Output is correct
31 Correct 412 ms 60052 KB Output is correct
32 Correct 403 ms 58080 KB Output is correct
33 Correct 427 ms 59592 KB Output is correct
34 Correct 714 ms 66212 KB Output is correct
35 Correct 418 ms 58796 KB Output is correct
36 Correct 279 ms 83948 KB Output is correct
37 Correct 286 ms 83976 KB Output is correct
38 Correct 711 ms 65756 KB Output is correct
39 Correct 729 ms 65464 KB Output is correct
40 Correct 788 ms 66428 KB Output is correct
41 Correct 371 ms 69572 KB Output is correct
42 Correct 355 ms 69456 KB Output is correct
43 Correct 353 ms 69348 KB Output is correct
44 Correct 353 ms 69412 KB Output is correct

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 21452 KB Output is correct
2 Correct 14 ms 21548 KB Output is correct
3 Correct 14 ms 21544 KB Output is correct
4 Correct 14 ms 21476 KB Output is correct
5 Correct 14 ms 21452 KB Output is correct
6 Correct 14 ms 21428 KB Output is correct
7 Correct 14 ms 21484 KB Output is correct
8 Correct 14 ms 21464 KB Output is correct
9 Correct 15 ms 21708 KB Output is correct
10 Correct 15 ms 21772 KB Output is correct
11 Correct 15 ms 21708 KB Output is correct
12 Correct 15 ms 21824 KB Output is correct
13 Correct 14 ms 21764 KB Output is correct
14 Correct 15 ms 21744 KB Output is correct
15 Correct 15 ms 21708 KB Output is correct
16 Correct 15 ms 21764 KB Output is correct
17 Correct 733 ms 70064 KB Output is correct
18 Correct 734 ms 69828 KB Output is correct
19 Correct 718 ms 69684 KB Output is correct
20 Correct 719 ms 69948 KB Output is correct
21 Correct 705 ms 70196 KB Output is correct
22 Correct 743 ms 71388 KB Output is correct
23 Correct 730 ms 70704 KB Output is correct
24 Correct 734 ms 71432 KB Output is correct
25 Correct 724 ms 71716 KB Output is correct
26 Correct 724 ms 70600 KB Output is correct
27 Correct 717 ms 68876 KB Output is correct
28 Correct 734 ms 70984 KB Output is correct
29 Correct 724 ms 70692 KB Output is correct
30 Correct 727 ms 71472 KB Output is correct
31 Correct 727 ms 70636 KB Output is correct
32 Correct 742 ms 70928 KB Output is correct
33 Correct 547 ms 64840 KB Output is correct
34 Correct 300 ms 68956 KB Output is correct
35 Correct 278 ms 59904 KB Output is correct
36 Correct 270 ms 58788 KB Output is correct
37 Correct 257 ms 58448 KB Output is correct
38 Correct 267 ms 59708 KB Output is correct
39 Correct 261 ms 58120 KB Output is correct
40 Correct 259 ms 58556 KB Output is correct
41 Correct 249 ms 57508 KB Output is correct
42 Correct 288 ms 60728 KB Output is correct
43 Correct 257 ms 58172 KB Output is correct
44 Correct 648 ms 65672 KB Output is correct
45 Correct 277 ms 58424 KB Output is correct
46 Correct 235 ms 80868 KB Output is correct
47 Correct 179 ms 70836 KB Output is correct
48 Correct 501 ms 64672 KB Output is correct
49 Correct 570 ms 64652 KB Output is correct
50 Correct 469 ms 63024 KB Output is correct
51 Correct 302 ms 69188 KB Output is correct
52 Correct 300 ms 69104 KB Output is correct
53 Correct 309 ms 68972 KB Output is correct
54 Correct 293 ms 69096 KB Output is correct
55 Correct 784 ms 66120 KB Output is correct
56 Correct 388 ms 69072 KB Output is correct
57 Correct 420 ms 58936 KB Output is correct
58 Correct 403 ms 58528 KB Output is correct
59 Correct 372 ms 58248 KB Output is correct
60 Correct 432 ms 60040 KB Output is correct
61 Correct 457 ms 58752 KB Output is correct
62 Correct 381 ms 59456 KB Output is correct
63 Correct 412 ms 60052 KB Output is correct
64 Correct 403 ms 58080 KB Output is correct
65 Correct 427 ms 59592 KB Output is correct
66 Correct 714 ms 66212 KB Output is correct
67 Correct 418 ms 58796 KB Output is correct
68 Correct 279 ms 83948 KB Output is correct
69 Correct 286 ms 83976 KB Output is correct
70 Correct 711 ms 65756 KB Output is correct
71 Correct 729 ms 65464 KB Output is correct
72 Correct 788 ms 66428 KB Output is correct
73 Correct 371 ms 69572 KB Output is correct
74 Correct 355 ms 69456 KB Output is correct
75 Correct 353 ms 69348 KB Output is correct
76 Correct 353 ms 69412 KB Output is correct
77 Correct 857 ms 66808 KB Output is correct
78 Correct 365 ms 69428 KB Output is correct
79 Correct 448 ms 59484 KB Output is correct
80 Correct 453 ms 58180 KB Output is correct
81 Correct 431 ms 59376 KB Output is correct
82 Correct 488 ms 59192 KB Output is correct
83 Correct 450 ms 58560 KB Output is correct
84 Correct 478 ms 58816 KB Output is correct
85 Correct 401 ms 59708 KB Output is correct
86 Correct 459 ms 59260 KB Output is correct
87 Correct 437 ms 58712 KB Output is correct
88 Correct 646 ms 65976 KB Output is correct
89 Correct 452 ms 59204 KB Output is correct
90 Correct 291 ms 84056 KB Output is correct
91 Correct 313 ms 83924 KB Output is correct
92 Runtime error 826 ms 134764 KB Execution killed with signal 6
93 Halted 0 ms 0 KB -