oj.uz

Submission #284937

# Submission time Handle Problem Language Result Execution time Memory
284937 2020-08-28T08:14:33 Z 3zp Aesthetic (NOI20_aesthetic) C++14
51 / 100
 848 ms 79056 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){
    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);
        else 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:23:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   23 | main(){
      |      ^
Aesthetic.cpp: In function 'int main()':
Aesthetic.cpp:89: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]
   89 |     for(ll i = 0; i < W.size(); i++){
      |                   ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23936 KB Output is correct
2 Correct 17 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 17 ms 23936 KB Output is correct
6 Correct 18 ms 23936 KB Output is correct
7 Correct 16 ms 23936 KB Output is correct
8 Correct 17 ms 23936 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23936 KB Output is correct
2 Correct 17 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 17 ms 23936 KB Output is correct
6 Correct 18 ms 23936 KB Output is correct
7 Correct 16 ms 23936 KB Output is correct
8 Correct 17 ms 23936 KB Output is correct
9 Correct 22 ms 24224 KB Output is correct
10 Correct 22 ms 24192 KB Output is correct
11 Correct 18 ms 24224 KB Output is correct
12 Correct 19 ms 24192 KB Output is correct
13 Correct 18 ms 24192 KB Output is correct
14 Correct 19 ms 24192 KB Output is correct
15 Correct 18 ms 24192 KB Output is correct
16 Correct 19 ms 24192 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 782 ms 74972 KB Output is correct
2 Correct 757 ms 74840 KB Output is correct
3 Correct 772 ms 73600 KB Output is correct
4 Correct 784 ms 74972 KB Output is correct
5 Correct 760 ms 73824 KB Output is correct
6 Correct 831 ms 76164 KB Output is correct
7 Correct 817 ms 75984 KB Output is correct
8 Correct 802 ms 75224 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 814 ms 75104 KB Output is correct
2 Correct 809 ms 75524 KB Output is correct
3 Correct 813 ms 74120 KB Output is correct
4 Correct 792 ms 76880 KB Output is correct
5 Correct 826 ms 75748 KB Output is correct
6 Correct 823 ms 77016 KB Output is correct
7 Correct 795 ms 75512 KB Output is correct
8 Correct 806 ms 74840 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 848 ms 70488 KB Output is correct
2 Correct 296 ms 72344 KB Output is correct
3 Correct 401 ms 65028 KB Output is correct
4 Correct 396 ms 63716 KB Output is correct
5 Correct 450 ms 63460 KB Output is correct
6 Correct 384 ms 64740 KB Output is correct
7 Correct 369 ms 63076 KB Output is correct
8 Correct 373 ms 63460 KB Output is correct
9 Correct 371 ms 62768 KB Output is correct
10 Correct 390 ms 65780 KB Output is correct
11 Correct 386 ms 63332 KB Output is correct
12 Correct 829 ms 72352 KB Output is correct
13 Correct 407 ms 63716 KB Output is correct
14 Correct 290 ms 79056 KB Output is correct
15 Correct 235 ms 71932 KB Output is correct
16 Correct 842 ms 73168 KB Output is correct
17 Correct 798 ms 70860 KB Output is correct
18 Correct 779 ms 72600 KB Output is correct
19 Correct 303 ms 72588 KB Output is correct
20 Correct 297 ms 72640 KB Output is correct
21 Correct 304 ms 72540 KB Output is correct
22 Correct 294 ms 72540 KB Output is correct

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 848 ms 70488 KB Output is correct
2 Correct 296 ms 72344 KB Output is correct
3 Correct 401 ms 65028 KB Output is correct
4 Correct 396 ms 63716 KB Output is correct
5 Correct 450 ms 63460 KB Output is correct
6 Correct 384 ms 64740 KB Output is correct
7 Correct 369 ms 63076 KB Output is correct
8 Correct 373 ms 63460 KB Output is correct
9 Correct 371 ms 62768 KB Output is correct
10 Correct 390 ms 65780 KB Output is correct
11 Correct 386 ms 63332 KB Output is correct
12 Correct 829 ms 72352 KB Output is correct
13 Correct 407 ms 63716 KB Output is correct
14 Correct 290 ms 79056 KB Output is correct
15 Correct 235 ms 71932 KB Output is correct
16 Correct 842 ms 73168 KB Output is correct
17 Correct 798 ms 70860 KB Output is correct
18 Correct 779 ms 72600 KB Output is correct
19 Correct 303 ms 72588 KB Output is correct
20 Correct 297 ms 72640 KB Output is correct
21 Correct 304 ms 72540 KB Output is correct
22 Correct 294 ms 72540 KB Output is correct
23 Incorrect 649 ms 71004 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23936 KB Output is correct
2 Correct 17 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 17 ms 23936 KB Output is correct
6 Correct 18 ms 23936 KB Output is correct
7 Correct 16 ms 23936 KB Output is correct
8 Correct 17 ms 23936 KB Output is correct
9 Correct 22 ms 24224 KB Output is correct
10 Correct 22 ms 24192 KB Output is correct
11 Correct 18 ms 24224 KB Output is correct
12 Correct 19 ms 24192 KB Output is correct
13 Correct 18 ms 24192 KB Output is correct
14 Correct 19 ms 24192 KB Output is correct
15 Correct 18 ms 24192 KB Output is correct
16 Correct 19 ms 24192 KB Output is correct
17 Correct 782 ms 74972 KB Output is correct
18 Correct 757 ms 74840 KB Output is correct
19 Correct 772 ms 73600 KB Output is correct
20 Correct 784 ms 74972 KB Output is correct
21 Correct 760 ms 73824 KB Output is correct
22 Correct 831 ms 76164 KB Output is correct
23 Correct 817 ms 75984 KB Output is correct
24 Correct 802 ms 75224 KB Output is correct
25 Correct 814 ms 75104 KB Output is correct
26 Correct 809 ms 75524 KB Output is correct
27 Correct 813 ms 74120 KB Output is correct
28 Correct 792 ms 76880 KB Output is correct
29 Correct 826 ms 75748 KB Output is correct
30 Correct 823 ms 77016 KB Output is correct
31 Correct 795 ms 75512 KB Output is correct
32 Correct 806 ms 74840 KB Output is correct
33 Correct 848 ms 70488 KB Output is correct
34 Correct 296 ms 72344 KB Output is correct
35 Correct 401 ms 65028 KB Output is correct
36 Correct 396 ms 63716 KB Output is correct
37 Correct 450 ms 63460 KB Output is correct
38 Correct 384 ms 64740 KB Output is correct
39 Correct 369 ms 63076 KB Output is correct
40 Correct 373 ms 63460 KB Output is correct
41 Correct 371 ms 62768 KB Output is correct
42 Correct 390 ms 65780 KB Output is correct
43 Correct 386 ms 63332 KB Output is correct
44 Correct 829 ms 72352 KB Output is correct
45 Correct 407 ms 63716 KB Output is correct
46 Correct 290 ms 79056 KB Output is correct
47 Correct 235 ms 71932 KB Output is correct
48 Correct 842 ms 73168 KB Output is correct
49 Correct 798 ms 70860 KB Output is correct
50 Correct 779 ms 72600 KB Output is correct
51 Correct 303 ms 72588 KB Output is correct
52 Correct 297 ms 72640 KB Output is correct
53 Correct 304 ms 72540 KB Output is correct
54 Correct 294 ms 72540 KB Output is correct
55 Incorrect 649 ms 71004 KB Output isn't correct
56 Halted 0 ms 0 KB -