oj.uz

답안 #293304

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
293304 2020-09-07T20:55:11 Z crossing0ver Aesthetic (NOI20_aesthetic) C++17
51 / 100
 654 ms 74832 KB 
#include<bits/stdc++.h>
#define int long long
#define all(x) (x).begin(),(x).end()
#define pii pair<int,int>
#define ll long long
#define pb push_back
#define vi vector<int>
#define se second
#define fi first
using namespace std;
const int N = 3e5+5;
vector<pii> adj[N];
int n,m;
int A[N],B[N],W[N],NUM[N][2],MX[N],par[N],good[N],sub[N],id[N];
ll D[N],FROM_N[N],H[N];
set<pii> path;

ll t[4*N];
void upd(int v,int tl,int tr,int l,int r,ll val) {
    if(l > tr || r < tl) return;
    if (l <= tl && r >= tr)  {
            t[v] = val;
            return;
    }
    t[v*2] = min(t[v*2],t[v]);
    t[v*2+1] = min(t[v*2+1],t[v]);
    int tm = (tl + tr)/2;
    upd(v*2,tl,tm,l,r,val);
    upd(v*2+1,tm+1,tr,l,r,val);
    //t[v] = min(t[v*2],t[v*2+1]);
}
void down(int v,int tl,int tr) {
    if (tl == tr) H[tl] = t[v];
    else {
            int tm = (tl + tr)/2;
            t[v*2] = min(t[v*2],t[v]);
        t[v*2+1] = min(t[v*2+1],t[v]);
        down(v*2,tl,tm);
        down(v*2+1,tm+1,tr);
    }
}
void dijkstra(int s) {
    priority_queue<pair<ll,int>,vector<pair<ll,int> >,greater<pair<ll,int> > > pq;
        pq.push({0,s});
        vector<bool> vis(n+1);
        vector<ll> d(n+1);
        for (int i = 1; i <= n; i++)
            d[i] = 10000000000000000;
        d[s] = 0;
        par[s] = 0;
        id[s] = 0;
        while(!pq.empty()) {
            auto i1 = pq.top();
            pq.pop();
            int v = i1.se;
            if (vis[v]) continue;
            ll dis = i1.fi;
            vis[v] = 1;
            for (auto i : adj[v])
                if (!vis[i.fi] && d[i.fi] > dis + i.se) {
                    d[i.fi] = dis + i.se;
                    id[i.fi] = id[v] + 1;
                    par[i.fi] = v;
                    pq.push({d[i.fi],i.fi});
                }
        }/*1 2 3
2 3 5
1 3 4*/
        if (s == n)
        for (int i = 1; i <= n; i++)
            FROM_N[i] = d[i];
        else {
                for (int i = 1; i <= n; i++)
                    D[i] = d[i];
               int j = n;
                good[1] = 1;
            while(j != 1) {
                good[j] = 1;
                j = par[j];
            }
            for (int i = 2; i <= n; i++) {
                        if (good[i])
                    path.insert({i,par[i]}),
                    path.insert({par[i],i});
                }
            vector<pair<ll,int> > g;
            for (int i =1 ; i <= n; i++) {
                g.pb({d[i],i});
            }
        sort(all(g));
        for (auto i1 : g) {
            int v = i1.se;
            if (!good[v])
                sub[v] = sub [ par[v] ];
            else sub[v] = v;
        }
        }
}
main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
            int a,b,w;
        cin >> a >> b >> w;
        A[i] = a, B[i] = b;
        W[i] = w;
        NUM[i][0] = adj[a].size();
        NUM[i][1] = adj[b].size();
        adj[a].pb({b,w});
        adj[b].pb({a,w});
        MX[i] = w;
    }
    dijkstra(n);
    dijkstra(1);
    for (int i = 1; i < 4*N; i++)
        t[i] = 10000000000000000;
   // cout << FROM_N[1];exit(0);
    for (int i = m-2; i >= 0; i--)
        MX[i] = max(MX[i],MX[i+1]);
    ll ans = D[n];
   // cout << D[n];exit(0);
    /*for (int i = 0; i < m; i++) {
        int a = A[i], b = B[i];
        adj[a][NUM[i][0]].se += MX[i+1];
        adj[b][NUM[i][1]].se += MX[i+1];
        // dijkstra

        priority_queue<pair<ll,int>,vector<pair<ll,int> >,greater<pair<ll,int> > > pq;
        pq.push({0,1});
        vector<bool> vis(n+1);
        vector<ll> d(n+1);
        for (int i = 1; i <= n; i++)
            d[i] = 10000000000000000;
        d[1] = 0;
        while(!pq.empty()) {
            auto i1 = pq.top();
            pq.pop();
            int v = i1.se;
            if (vis[v]) continue;
            ll dis = i1.fi;
            if (v == n) {
                ans = max(ans,dis);
                break;
            }
            vis[v] = 1;
            for (auto i : adj[v])
                if (!vis[i.fi] && d[i.fi] > dis + i.se) {
                    d[i.fi] = dis + i.se;
                    pq.push({d[i.fi],i.fi});
                }

        }
        // replace
        adj[a][NUM[i][0]].se -= MX[i+1];
        adj[b][NUM[i][1]].se -= MX[i+1];
    }*/
    vector<pair<ll,pii> > q;
    for (int i = 0; i < m; i++) {
        int a = A[i], b = B[i];
        if (path.count({a,b}) || sub[a] == sub[b]) continue;
        if (id[sub[a]] > id[sub[b]]) swap(a,b);
        ll dis = D[a] + FROM_N[b] + W[i];
        a = sub[a];
        b = sub[b];
        if (id[a] > id[b]) swap(a,b);
      //  if (id[sub])
      q.pb({dis,{id[a],id[b]-1}});
     //   upd(1,0,id[n],id[a],id[b]-1,dis);
    }
    sort(q.rbegin(),q.rend());
    for (auto i1 : q) {
        int a = i1.se.fi;
        int b = i1.se.se;
        ll val = i1.fi;
        upd(1,0,id[n],a,b,val);
    }
    down(1,0,id[n]);
    for (int i = 0; i < m; i++) {
        int a = A[i], b = B[i];
        if (path.count({a,b}) == 0) continue;
        if (id[a] > id[b]) swap(a,b);
        if (H[id[a]] !=  10000000000000000)
        ans = max(ans, min(H[id[a]],D[n] + MX[i+1]));
        else ans = max(ans,D[n] + MX[i+1]);
      /*  ll C = D[n];
        C += MX[i+1];
        //adj[a][NUM[i][0]].se += MX[i+1];
        //adj[b][NUM[i][1]].se += MX[i+1];
        // dijkstra
        for (int i = 0; i < m; i++) {
            int x = A[i], y = B[i];
            if (id[sub[x]] > id[sub[y]]) swap(x,y);

            if (x == a && y == b ) continue;
            if (id[sub[x]] > id[a] || id[sub[y]] < id[b]) continue;
            C = min(C,D[x] + FROM_N[y] + W[i]);
        }
        ans = max(ans,C);

*/
        }
        // replace
        //adj[a][NUM[i][0]].se -= MX[i+1];
        //adj[b][NUM[i][1]].se -= MX[i+1];

    cout << ans;



}

Compilation message

Aesthetic.cpp:99:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   99 | main() {
      |      ^

Subtask #1
5.0 / 5.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 605 ms 66448 KB Output is correct
2 Correct 591 ms 66332 KB Output is correct
3 Correct 620 ms 66496 KB Output is correct
4 Correct 643 ms 66504 KB Output is correct
5 Correct 622 ms 66736 KB Output is correct
6 Correct 632 ms 67640 KB Output is correct
7 Correct 605 ms 67088 KB Output is correct
8 Correct 619 ms 67708 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 654 ms 67860 KB Output is correct
2 Correct 651 ms 67032 KB Output is correct
3 Correct 607 ms 65656 KB Output is correct
4 Correct 595 ms 66008 KB Output is correct
5 Correct 617 ms 66704 KB Output is correct
6 Correct 615 ms 66332 KB Output is correct
7 Correct 599 ms 66544 KB Output is correct
8 Correct 632 ms 67344 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 486 ms 59328 KB Output is correct
2 Correct 268 ms 61160 KB Output is correct
3 Correct 295 ms 52548 KB Output is correct
4 Correct 310 ms 53188 KB Output is correct
5 Correct 331 ms 55876 KB Output is correct
6 Correct 301 ms 53692 KB Output is correct
7 Correct 292 ms 52412 KB Output is correct
8 Correct 294 ms 53180 KB Output is correct
9 Correct 295 ms 52548 KB Output is correct
10 Correct 299 ms 52928 KB Output is correct
11 Correct 314 ms 53680 KB Output is correct
12 Correct 519 ms 59688 KB Output is correct
13 Correct 289 ms 52552 KB Output is correct
14 Correct 321 ms 74832 KB Output is correct
15 Correct 339 ms 74744 KB Output is correct
16 Correct 506 ms 59560 KB Output is correct
17 Correct 483 ms 58456 KB Output is correct
18 Correct 471 ms 59108 KB Output is correct
19 Correct 256 ms 61356 KB Output is correct
20 Correct 258 ms 61236 KB Output is correct
21 Correct 263 ms 61192 KB Output is correct
22 Correct 257 ms 61204 KB Output is correct

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 486 ms 59328 KB Output is correct
2 Correct 268 ms 61160 KB Output is correct
3 Correct 295 ms 52548 KB Output is correct
4 Correct 310 ms 53188 KB Output is correct
5 Correct 331 ms 55876 KB Output is correct
6 Correct 301 ms 53692 KB Output is correct
7 Correct 292 ms 52412 KB Output is correct
8 Correct 294 ms 53180 KB Output is correct
9 Correct 295 ms 52548 KB Output is correct
10 Correct 299 ms 52928 KB Output is correct
11 Correct 314 ms 53680 KB Output is correct
12 Correct 519 ms 59688 KB Output is correct
13 Correct 289 ms 52552 KB Output is correct
14 Correct 321 ms 74832 KB Output is correct
15 Correct 339 ms 74744 KB Output is correct
16 Correct 506 ms 59560 KB Output is correct
17 Correct 483 ms 58456 KB Output is correct
18 Correct 471 ms 59108 KB Output is correct
19 Correct 256 ms 61356 KB Output is correct
20 Correct 258 ms 61236 KB Output is correct
21 Correct 263 ms 61192 KB Output is correct
22 Correct 257 ms 61204 KB Output is correct
23 Incorrect 540 ms 61936 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 16896 KB Output is correct
2 Correct 10 ms 16896 KB Output is correct
3 Correct 10 ms 16896 KB Output is correct
4 Correct 10 ms 16896 KB Output is correct
5 Correct 11 ms 16896 KB Output is correct
6 Correct 10 ms 16868 KB Output is correct
7 Correct 11 ms 16896 KB Output is correct
8 Correct 11 ms 16896 KB Output is correct
9 Correct 12 ms 17152 KB Output is correct
10 Correct 12 ms 17152 KB Output is correct
11 Correct 12 ms 17148 KB Output is correct
12 Correct 12 ms 17152 KB Output is correct
13 Correct 12 ms 17152 KB Output is correct
14 Correct 12 ms 17152 KB Output is correct
15 Correct 12 ms 17152 KB Output is correct
16 Correct 12 ms 17152 KB Output is correct
17 Correct 605 ms 66448 KB Output is correct
18 Correct 591 ms 66332 KB Output is correct
19 Correct 620 ms 66496 KB Output is correct
20 Correct 643 ms 66504 KB Output is correct
21 Correct 622 ms 66736 KB Output is correct
22 Correct 632 ms 67640 KB Output is correct
23 Correct 605 ms 67088 KB Output is correct
24 Correct 619 ms 67708 KB Output is correct
25 Correct 654 ms 67860 KB Output is correct
26 Correct 651 ms 67032 KB Output is correct
27 Correct 607 ms 65656 KB Output is correct
28 Correct 595 ms 66008 KB Output is correct
29 Correct 617 ms 66704 KB Output is correct
30 Correct 615 ms 66332 KB Output is correct
31 Correct 599 ms 66544 KB Output is correct
32 Correct 632 ms 67344 KB Output is correct
33 Correct 486 ms 59328 KB Output is correct
34 Correct 268 ms 61160 KB Output is correct
35 Correct 295 ms 52548 KB Output is correct
36 Correct 310 ms 53188 KB Output is correct
37 Correct 331 ms 55876 KB Output is correct
38 Correct 301 ms 53692 KB Output is correct
39 Correct 292 ms 52412 KB Output is correct
40 Correct 294 ms 53180 KB Output is correct
41 Correct 295 ms 52548 KB Output is correct
42 Correct 299 ms 52928 KB Output is correct
43 Correct 314 ms 53680 KB Output is correct
44 Correct 519 ms 59688 KB Output is correct
45 Correct 289 ms 52552 KB Output is correct
46 Correct 321 ms 74832 KB Output is correct
47 Correct 339 ms 74744 KB Output is correct
48 Correct 506 ms 59560 KB Output is correct
49 Correct 483 ms 58456 KB Output is correct
50 Correct 471 ms 59108 KB Output is correct
51 Correct 256 ms 61356 KB Output is correct
52 Correct 258 ms 61236 KB Output is correct
53 Correct 263 ms 61192 KB Output is correct
54 Correct 257 ms 61204 KB Output is correct
55 Incorrect 540 ms 61936 KB Output isn't correct
56 Halted 0 ms 0 KB -