Submission #1263325

#	Time	Username	Problem	Language	Result	Execution time	Memory
1263325		nlamih	Robot (JOI21_ho_t4)	C++20	0 / 100	3056 ms	46728 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 = 1e18+7;
const int Maxn = 1e5+2;
const int di[] = {0, 0, -1, 1};
const int dj[] = {-1, 1, 0, 0};

map<int,ll>del[Maxn],cost[Maxn];
ll dist[Maxn];
vector<iii>g[Maxn];
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 u=1;u<=n;u++){
        for(iii x:g[u]){
            int c=x.se.fi,p=x.se.se;
            cost[u][c]+=1LL*p;
        }
    }
    for(int i=1;i<=n;i++) dist[i]=INF;
    priority_queue<iii,vector<iii>,greater<iii>>q;
    q.push({0,{1,0}});
    dist[1]=0;
    while(!q.empty()){
        int u=q.top().se.fi,col=q.top().se.se;
        ll val=q.top().fi;
        q.pop();
        if (col>0){
            if (del[u][col]<val) continue;
            for(iii x:g[u]){
                int c=x.se.fi;
                if (c!=col) continue;
                int v=x.fi,p=x.se.se;
                ll ex=del[u][col]+cost[u][col]-1LL*p;
                if (dist[v]>ex){
                    dist[v]>ex;
                    q.push({dist[v],{v,0}});
                }
            }
        }
        else{
            if (dist[u]<val) continue;
            for(iii x:g[u]){
                int c=x.se.fi,v=x.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 otl=dist[u]+1LL*p;
                if (dist[v]>otl){
                    dist[v]=otl;
                    q.push({dist[v],{v,0}});
                }
                if (!del[v][c] || dist[u]<del[v][c]){
                    del[v][c]=dist[u];
                    q.push({del[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();
    }
}

Compilation message (stderr)

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

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