oj.uz

답안 #285007

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
285007 2020-08-28T08:52:03 Z 3zp Aesthetic (NOI20_aesthetic) C++14
51 / 100
 891 ms 81628 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;
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);
        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];
        if(a == b) continue;
        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:19:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   19 | main(){
      |      ^
Aesthetic.cpp: In function 'int main()':
Aesthetic.cpp:85: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]
   85 |     for(ll i = 0; i < W.size(); i++){
      |                   ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23936 KB Output is correct
2 Correct 20 ms 23936 KB Output is correct
3 Correct 19 ms 23936 KB Output is correct
4 Correct 18 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 17 ms 23936 KB Output is correct
8 Correct 19 ms 23936 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23936 KB Output is correct
2 Correct 20 ms 23936 KB Output is correct
3 Correct 19 ms 23936 KB Output is correct
4 Correct 18 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 17 ms 23936 KB Output is correct
8 Correct 19 ms 23936 KB Output is correct
9 Correct 19 ms 24192 KB Output is correct
10 Correct 19 ms 24188 KB Output is correct
11 Correct 19 ms 24192 KB Output is correct
12 Correct 19 ms 24192 KB Output is correct
13 Correct 19 ms 24192 KB Output is correct
14 Correct 22 ms 24184 KB Output is correct
15 Correct 20 ms 24192 KB Output is correct
16 Correct 20 ms 24192 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 830 ms 75344 KB Output is correct
2 Correct 824 ms 75180 KB Output is correct
3 Correct 780 ms 73828 KB Output is correct
4 Correct 793 ms 75248 KB Output is correct
5 Correct 748 ms 73936 KB Output is correct
6 Correct 826 ms 76520 KB Output is correct
7 Correct 807 ms 76248 KB Output is correct
8 Correct 778 ms 75576 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 768 ms 75484 KB Output is correct
2 Correct 775 ms 75752 KB Output is correct
3 Correct 767 ms 74448 KB Output is correct
4 Correct 791 ms 77036 KB Output is correct
5 Correct 840 ms 75908 KB Output is correct
6 Correct 772 ms 77272 KB Output is correct
7 Correct 790 ms 75976 KB Output is correct
8 Correct 781 ms 75124 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 837 ms 70832 KB Output is correct
2 Correct 292 ms 75228 KB Output is correct
3 Correct 398 ms 67208 KB Output is correct
4 Correct 384 ms 66020 KB Output is correct
5 Correct 397 ms 65740 KB Output is correct
6 Correct 393 ms 67052 KB Output is correct
7 Correct 373 ms 65384 KB Output is correct
8 Correct 382 ms 65888 KB Output is correct
9 Correct 428 ms 65160 KB Output is correct
10 Correct 407 ms 68068 KB Output is correct
11 Correct 387 ms 65532 KB Output is correct
12 Correct 891 ms 74768 KB Output is correct
13 Correct 437 ms 65768 KB Output is correct
14 Correct 284 ms 81628 KB Output is correct
15 Correct 198 ms 74460 KB Output is correct
16 Correct 773 ms 75868 KB Output is correct
17 Correct 772 ms 73576 KB Output is correct
18 Correct 814 ms 74980 KB Output is correct
19 Correct 298 ms 75484 KB Output is correct
20 Correct 298 ms 75388 KB Output is correct
21 Correct 296 ms 75316 KB Output is correct
22 Correct 291 ms 75360 KB Output is correct

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 837 ms 70832 KB Output is correct
2 Correct 292 ms 75228 KB Output is correct
3 Correct 398 ms 67208 KB Output is correct
4 Correct 384 ms 66020 KB Output is correct
5 Correct 397 ms 65740 KB Output is correct
6 Correct 393 ms 67052 KB Output is correct
7 Correct 373 ms 65384 KB Output is correct
8 Correct 382 ms 65888 KB Output is correct
9 Correct 428 ms 65160 KB Output is correct
10 Correct 407 ms 68068 KB Output is correct
11 Correct 387 ms 65532 KB Output is correct
12 Correct 891 ms 74768 KB Output is correct
13 Correct 437 ms 65768 KB Output is correct
14 Correct 284 ms 81628 KB Output is correct
15 Correct 198 ms 74460 KB Output is correct
16 Correct 773 ms 75868 KB Output is correct
17 Correct 772 ms 73576 KB Output is correct
18 Correct 814 ms 74980 KB Output is correct
19 Correct 298 ms 75484 KB Output is correct
20 Correct 298 ms 75388 KB Output is correct
21 Correct 296 ms 75316 KB Output is correct
22 Correct 291 ms 75360 KB Output is correct
23 Incorrect 630 ms 73448 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23936 KB Output is correct
2 Correct 20 ms 23936 KB Output is correct
3 Correct 19 ms 23936 KB Output is correct
4 Correct 18 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 17 ms 23936 KB Output is correct
8 Correct 19 ms 23936 KB Output is correct
9 Correct 19 ms 24192 KB Output is correct
10 Correct 19 ms 24188 KB Output is correct
11 Correct 19 ms 24192 KB Output is correct
12 Correct 19 ms 24192 KB Output is correct
13 Correct 19 ms 24192 KB Output is correct
14 Correct 22 ms 24184 KB Output is correct
15 Correct 20 ms 24192 KB Output is correct
16 Correct 20 ms 24192 KB Output is correct
17 Correct 830 ms 75344 KB Output is correct
18 Correct 824 ms 75180 KB Output is correct
19 Correct 780 ms 73828 KB Output is correct
20 Correct 793 ms 75248 KB Output is correct
21 Correct 748 ms 73936 KB Output is correct
22 Correct 826 ms 76520 KB Output is correct
23 Correct 807 ms 76248 KB Output is correct
24 Correct 778 ms 75576 KB Output is correct
25 Correct 768 ms 75484 KB Output is correct
26 Correct 775 ms 75752 KB Output is correct
27 Correct 767 ms 74448 KB Output is correct
28 Correct 791 ms 77036 KB Output is correct
29 Correct 840 ms 75908 KB Output is correct
30 Correct 772 ms 77272 KB Output is correct
31 Correct 790 ms 75976 KB Output is correct
32 Correct 781 ms 75124 KB Output is correct
33 Correct 837 ms 70832 KB Output is correct
34 Correct 292 ms 75228 KB Output is correct
35 Correct 398 ms 67208 KB Output is correct
36 Correct 384 ms 66020 KB Output is correct
37 Correct 397 ms 65740 KB Output is correct
38 Correct 393 ms 67052 KB Output is correct
39 Correct 373 ms 65384 KB Output is correct
40 Correct 382 ms 65888 KB Output is correct
41 Correct 428 ms 65160 KB Output is correct
42 Correct 407 ms 68068 KB Output is correct
43 Correct 387 ms 65532 KB Output is correct
44 Correct 891 ms 74768 KB Output is correct
45 Correct 437 ms 65768 KB Output is correct
46 Correct 284 ms 81628 KB Output is correct
47 Correct 198 ms 74460 KB Output is correct
48 Correct 773 ms 75868 KB Output is correct
49 Correct 772 ms 73576 KB Output is correct
50 Correct 814 ms 74980 KB Output is correct
51 Correct 298 ms 75484 KB Output is correct
52 Correct 298 ms 75388 KB Output is correct
53 Correct 296 ms 75316 KB Output is correct
54 Correct 291 ms 75360 KB Output is correct
55 Incorrect 630 ms 73448 KB Output isn't correct
56 Halted 0 ms 0 KB -