제출 #1273276

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1273276		nlhuy	Robot (JOI21_ho_t4)	C++20	0 / 100	376 ms	54712 KiB

Main

#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define fi first
#define se second
#define Task "test"

typedef pair<int,int>ii;
typedef pair<ll,ii>iii;

const int MOD = 1e9+7;
const ll INF = 1e17+7;
const int Maxn = 1e5+7;
const int di[] = {0, 0, -1, 1};
const int dj[] = {-1, 1, 0, 0};

vector<iii>g[Maxn];
ll dist[Maxn];
map<int,ll>cost[Maxn],dp[Maxn];


bool cmp(iii i,iii j){
    return i.se.fi<j.se.fi;
}
void run_case(){
    int n,m;
    cin>>n>>m;
    while(m--){
        int u,v,c,p;
        cin>>u>>v>>c>>p;
        g[u].push_back({v,{c,p}});
        g[v].push_back({u,{c,p}});
    }
    for(int i=1;i<=n;i++){
        sort(g[i].begin(),g[i].end(),cmp);
        for(iii x:g[i]){
            int c=x.se.fi,p=x.se.se;
            cost[i][c]+=1LL*p;
        }
    }
    for(int i=1;i<=n;i++) dist[i]=INF;
    dist[1]=0;
    priority_queue<iii,vector<iii>,greater<iii>>q;
    q.push({dist[1],{1,0}});
    while(!q.empty()){
        int col=q.top().se.se,u=q.top().se.fi;
        ll sum=q.top().fi;
        q.pop();
        if (col){
            if (dp[u][col]<sum) continue;
            int l=0,r=g[u].size()-1,pos=-1;
            while(l<=r){
                int mid=(l+r)/2;
                if (g[u][mid].se.fi==col) pos=mid,r=mid-1;
                else if (g[u][mid].se.fi>col) r=mid-1;
                else l=mid+1;
            }
            if (pos==-1) continue;
            for(int i=pos;i<g[u].size() && g[u][i].fi==col;i++){
                int v=g[u][i].fi,p=g[u][i].se.se;
                ll ex=dp[u][col]+cost[u][col]-1LL*p;
                if (dist[v]>ex){
                    dist[v]=ex;
                    q.push({dist[v],{v,0}});
                }
            }
        }
        else{
            if (dist[u]<sum) continue;
            for(iii x:g[u]){
                int v=x.fi,c=x.se.fi,p=x.se.se;
                ll ex=dist[u]+cost[u][c]-1LL*p;
                if (dist[v]>ex){
                    dist[v]=ex;
                    q.push({dist[v],{v,0}});
                }
                ll fee=dist[u]+1LL*p;
                if (dist[v]>fee){
                    dist[v]=fee;
                    q.push({dist[v],{v,0}});
                }
                if (!dp[v][c] || dp[v][c]>dist[u]){
                    dp[v][c]=dist[u];
                    q.push({dp[v][c],{v,c}});
                }
            }
        }
    }
    if (dist[n]==INF) cout<<-1;
    else cout<<dist[n];
}
int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    if (fopen(Task ".inp", "r"))
    {
        freopen(Task ".inp", "r", stdin);
        freopen(Task ".out", "w", stdout);
    }
    int t = 1;
    //cin >> t;
    while(t--){
        run_case();
    }
}

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

Main.cpp: In function 'int main()':
Main.cpp:97:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   97 |         freopen(Task ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:98:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   98 |         freopen(Task ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 34
• Subtask 2: 0 / 24
• Subtask 3: 0 / 42