제출 #1311864

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1311864		settop	Shortcut (IOI16_shortcut)	C++20	23 / 100	666 ms	432 KiB

shortcut

#include "shortcut.h"
#include<bits/stdc++.h>

using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define ll long long
#define fall(i,a,b) for(int i=a;i<=b;i++)
#define rfall(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
const ll inf=1e16;
typedef pair<ll,ll> pii;

ll dp[105],val[105];
vector<pii> g[105];

ll djk(int a,int n){
    fall(i,0,n-1) dp[i]=inf;
    dp[a]=0;
    priority_queue<pii,vector<pii>,greater<pii>> pq;

    pq.push({0,a});

    ll r=0;

    while(!pq.empty()){
        auto [d,x]=pq.top(); pq.pop();
        if(d!=dp[x]) continue;
        if(x!=a) r=max(r,d+val[x]);
        for(auto [u,j]:g[x]){
            if(dp[u]>dp[x]+j){
                dp[u]=dp[x]+j;
                pq.push({dp[u],u});
            }
        }
    }
    return r+val[a];
}

ll calc(int n){
    ll mx=0;
    fall(i,0,n-1){      
        mx=max(mx,djk(i,n));
    }
    return mx;
}

long long find_shortcut(int n, std::vector<int> l, std::vector<int> d, int c){
    fall(i,0,n-1) val[i]=d[i];
    fall(i,0,n-2){
        g[i].pb({i+1,l[i]});
        g[i+1].pb({i,l[i]});
    }

    ll ans=inf;

    fall(i,0,n-1)
        fall(j,i+1,n-1){
            g[i].pb({j,c}); g[j].pb({i,c});
            ans=min(ans,calc(n));
            g[i].pop_back(); g[j].pop_back();
        }
    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

shortcut.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
shortcut_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

• Subtask 1: 9 / 9
• Subtask 2: 14 / 14
• Subtask 3: 0 / 8
• Subtask 4: 0 / 7
• Subtask 5: 0 / 33
• Subtask 6: 0 / 22
• Subtask 7: 0 / 4
• Subtask 8: 0 / 3