oj.uz

답안 #284941

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
284941 2020-08-28T08:17:49 Z 3zp Aesthetic (NOI20_aesthetic) C++14
51 / 100
 866 ms 77188 KB 
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 500009;
vector<pair<ll, pair<ll, ll > > > v[N];
vector<ll> T[N];
ll d1[N],dn[N], f[N], g[N],ea[N],eb[N],ec[N], par[N],path[N],wh[N];
multiset<pair<ll,ll> > S;
/*
00000111111

*/
void ad(ll x){
    if(g[x] == 1)cout<<1/0;
    g[x] = 1;
    for(auto E : v[x]){
        ll y = E.first, l = E.second.first,  u= E.second.second;
        auto it= S.find({dn[y] + l + d1[x], u});
        if(g[y] == 1 && it != S.end()) S.erase(it);
        if(g[y] == 0) S.insert({dn[x] + l + d1[y], u});
    }
}
ll A = 0;
main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    ll n, m;
    cin >> n >> m;
    for(ll i = 0; i < m; i++){
        cin>>ea[i]>>eb[i]>>ec[i];
    }
    for(ll i = m-1; i >= 0; i--){
        ll a = ea[i], b = eb[i], c = ec[i];

        v[a].push_back({b, {c,A}});
        v[b].push_back({a, {c,A}});
        A = max(A, c);
    }
    for(ll i = 1; i <= n; i++){
        d1[i] = 1e18;
        dn[i] = 1e18;
    }
    d1[1] = 0;
    dn[n] = 0;
    priority_queue<pair<ll, ll> > q;
    q.push({0, 1});
    while(q.size()){
        ll x = q.top().second;
        q.pop();
        if(f[x]) continue;
        f[x] = 1;
        for(auto E: v[x]){
            ll y = E.first, l = E.second.first;
            if(!f[y] && d1[y] > d1[x] + l){
                d1[y] = d1[x] + l;
                par[y] = x;
                q.push({-d1[y], y});
            }
        }
    }
    q.push({0, n});
    for(ll i = 1; i <= n; i++)
        f[i] = 0;
    while(q.size()){
        ll x = q.top().second;
        q.pop();
        if(f[x]) continue;
        f[x] = 1;
        for(auto E: v[x]){
            ll y = E.first, l = E.second.first;
            if(!f[y] && dn[y] > dn[x] + l){
                dn[y] = dn[x] + l;
                q.push({-dn[y], y});
            }
        }
    }
    vector<pair<ll,ll> > W;
    ll ans = d1[n];
    ll X = n;
    while(1){
        path[X] = 1;
        if(X == 1) break;
        X = par[X];
    }

    for(ll i = 1; i <= n; i++){
        W.push_back({d1[i], i});
    }
    sort(W.begin(), W.end());
    for(ll i = 0; i < W.size(); i++){
        ll x = W[i].second;
        if(path[x]) wh[x] = x;
        else wh[x] = wh[par[x]];
        T[wh[x]].push_back(x);
    }
    ll x = n;
    while(1){
        for(ll y : T[x])
            ad(y);
        if(x == 1) break;
        x = par[x];
        if(S.size() == 0) continue;
        ll U = S.begin()->first + S.begin()->second;
        auto it = S.begin();
        it++;
        if(it != S.end()) U = min(U, it->first);
        ans = max(ans, U);
    }
    cout<<ans<<endl;
}

Compilation message

Aesthetic.cpp: In function 'void ad(long long int)':
Aesthetic.cpp:14:25: warning: division by zero [-Wdiv-by-zero]
   14 |     if(g[x] == 1)cout<<1/0;
      |                        ~^~
Aesthetic.cpp: At global scope:
Aesthetic.cpp:24:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   24 | main(){
      |      ^
Aesthetic.cpp: In function 'int main()':
Aesthetic.cpp:90:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int>, std::allocator<std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |     for(ll i = 0; i < W.size(); i++){
      |                   ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 23936 KB Output is correct
2 Correct 16 ms 23936 KB Output is correct
3 Correct 16 ms 23936 KB Output is correct
4 Correct 16 ms 23936 KB Output is correct
5 Correct 16 ms 23936 KB Output is correct
6 Correct 16 ms 23936 KB Output is correct
7 Correct 16 ms 23936 KB Output is correct
8 Correct 16 ms 23936 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 23936 KB Output is correct
2 Correct 16 ms 23936 KB Output is correct
3 Correct 16 ms 23936 KB Output is correct
4 Correct 16 ms 23936 KB Output is correct
5 Correct 16 ms 23936 KB Output is correct
6 Correct 16 ms 23936 KB Output is correct
7 Correct 16 ms 23936 KB Output is correct
8 Correct 16 ms 23936 KB Output is correct
9 Correct 19 ms 24192 KB Output is correct
10 Correct 18 ms 24192 KB Output is correct
11 Correct 18 ms 24192 KB Output is correct
12 Correct 18 ms 24192 KB Output is correct
13 Correct 19 ms 24192 KB Output is correct
14 Correct 18 ms 24192 KB Output is correct
15 Correct 18 ms 24192 KB Output is correct
16 Correct 18 ms 24192 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 774 ms 74960 KB Output is correct
2 Correct 745 ms 75104 KB Output is correct
3 Correct 750 ms 73712 KB Output is correct
4 Correct 749 ms 74972 KB Output is correct
5 Correct 777 ms 73936 KB Output is correct
6 Correct 785 ms 76252 KB Output is correct
7 Correct 776 ms 75856 KB Output is correct
8 Correct 772 ms 75312 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 761 ms 75184 KB Output is correct
2 Correct 753 ms 75492 KB Output is correct
3 Correct 766 ms 74064 KB Output is correct
4 Correct 786 ms 76752 KB Output is correct
5 Correct 752 ms 75740 KB Output is correct
6 Correct 780 ms 77188 KB Output is correct
7 Correct 790 ms 75652 KB Output is correct
8 Correct 766 ms 74832 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 844 ms 70368 KB Output is correct
2 Correct 300 ms 70784 KB Output is correct
3 Correct 390 ms 63116 KB Output is correct
4 Correct 377 ms 62128 KB Output is correct
5 Correct 414 ms 61668 KB Output is correct
6 Correct 387 ms 63076 KB Output is correct
7 Correct 398 ms 61284 KB Output is correct
8 Correct 416 ms 61904 KB Output is correct
9 Correct 436 ms 61060 KB Output is correct
10 Correct 407 ms 63972 KB Output is correct
11 Correct 379 ms 61508 KB Output is correct
12 Correct 846 ms 70660 KB Output is correct
13 Correct 444 ms 61772 KB Output is correct
14 Correct 282 ms 77148 KB Output is correct
15 Correct 204 ms 70108 KB Output is correct
16 Correct 866 ms 71608 KB Output is correct
17 Correct 845 ms 69340 KB Output is correct
18 Correct 816 ms 70760 KB Output is correct
19 Correct 332 ms 70916 KB Output is correct
20 Correct 322 ms 71004 KB Output is correct
21 Correct 316 ms 70876 KB Output is correct
22 Correct 295 ms 70876 KB Output is correct

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 844 ms 70368 KB Output is correct
2 Correct 300 ms 70784 KB Output is correct
3 Correct 390 ms 63116 KB Output is correct
4 Correct 377 ms 62128 KB Output is correct
5 Correct 414 ms 61668 KB Output is correct
6 Correct 387 ms 63076 KB Output is correct
7 Correct 398 ms 61284 KB Output is correct
8 Correct 416 ms 61904 KB Output is correct
9 Correct 436 ms 61060 KB Output is correct
10 Correct 407 ms 63972 KB Output is correct
11 Correct 379 ms 61508 KB Output is correct
12 Correct 846 ms 70660 KB Output is correct
13 Correct 444 ms 61772 KB Output is correct
14 Correct 282 ms 77148 KB Output is correct
15 Correct 204 ms 70108 KB Output is correct
16 Correct 866 ms 71608 KB Output is correct
17 Correct 845 ms 69340 KB Output is correct
18 Correct 816 ms 70760 KB Output is correct
19 Correct 332 ms 70916 KB Output is correct
20 Correct 322 ms 71004 KB Output is correct
21 Correct 316 ms 70876 KB Output is correct
22 Correct 295 ms 70876 KB Output is correct
23 Incorrect 636 ms 69088 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 23936 KB Output is correct
2 Correct 16 ms 23936 KB Output is correct
3 Correct 16 ms 23936 KB Output is correct
4 Correct 16 ms 23936 KB Output is correct
5 Correct 16 ms 23936 KB Output is correct
6 Correct 16 ms 23936 KB Output is correct
7 Correct 16 ms 23936 KB Output is correct
8 Correct 16 ms 23936 KB Output is correct
9 Correct 19 ms 24192 KB Output is correct
10 Correct 18 ms 24192 KB Output is correct
11 Correct 18 ms 24192 KB Output is correct
12 Correct 18 ms 24192 KB Output is correct
13 Correct 19 ms 24192 KB Output is correct
14 Correct 18 ms 24192 KB Output is correct
15 Correct 18 ms 24192 KB Output is correct
16 Correct 18 ms 24192 KB Output is correct
17 Correct 774 ms 74960 KB Output is correct
18 Correct 745 ms 75104 KB Output is correct
19 Correct 750 ms 73712 KB Output is correct
20 Correct 749 ms 74972 KB Output is correct
21 Correct 777 ms 73936 KB Output is correct
22 Correct 785 ms 76252 KB Output is correct
23 Correct 776 ms 75856 KB Output is correct
24 Correct 772 ms 75312 KB Output is correct
25 Correct 761 ms 75184 KB Output is correct
26 Correct 753 ms 75492 KB Output is correct
27 Correct 766 ms 74064 KB Output is correct
28 Correct 786 ms 76752 KB Output is correct
29 Correct 752 ms 75740 KB Output is correct
30 Correct 780 ms 77188 KB Output is correct
31 Correct 790 ms 75652 KB Output is correct
32 Correct 766 ms 74832 KB Output is correct
33 Correct 844 ms 70368 KB Output is correct
34 Correct 300 ms 70784 KB Output is correct
35 Correct 390 ms 63116 KB Output is correct
36 Correct 377 ms 62128 KB Output is correct
37 Correct 414 ms 61668 KB Output is correct
38 Correct 387 ms 63076 KB Output is correct
39 Correct 398 ms 61284 KB Output is correct
40 Correct 416 ms 61904 KB Output is correct
41 Correct 436 ms 61060 KB Output is correct
42 Correct 407 ms 63972 KB Output is correct
43 Correct 379 ms 61508 KB Output is correct
44 Correct 846 ms 70660 KB Output is correct
45 Correct 444 ms 61772 KB Output is correct
46 Correct 282 ms 77148 KB Output is correct
47 Correct 204 ms 70108 KB Output is correct
48 Correct 866 ms 71608 KB Output is correct
49 Correct 845 ms 69340 KB Output is correct
50 Correct 816 ms 70760 KB Output is correct
51 Correct 332 ms 70916 KB Output is correct
52 Correct 322 ms 71004 KB Output is correct
53 Correct 316 ms 70876 KB Output is correct
54 Correct 295 ms 70876 KB Output is correct
55 Incorrect 636 ms 69088 KB Output isn't correct
56 Halted 0 ms 0 KB -