Submission #1188772

#	Time	Username	Problem	Language	Result	Execution time	Memory
1188772		hoa208	Robot (JOI21_ho_t4)	C++20	0 / 100	103 ms	23984 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORD(i, b, a) for (int i = (b), _a = (a); i >= _a; i--)
#define pa pair<ll, ll>
#define fi first
#define se second
#define bit(mask, j) ((mask >> j) & 1)
#define t_test int t;cin >> t;while(t--)
const   ll mod = 1e9 + 7;
const   ll INF = 1e18;
inline  void adm(ll &x){if(x>=mod)x%=mod;else if(x<0)x+=mod;}
//--------------------------------------------------------------------
const ll N = 1e5 + 10;
const ll M = 2e5 + 10;
ll n, m;
pa a[M];
vector<pa> g[N];
ll dx[M], timer, d[N][3], par[N];
ll color[M];
void DJK() {
    priority_queue<pair<pa, pa>, vector<pair<pa, pa>>, greater<pair<pa, pa>>> q;
    q.push({{0, 1}, {0, 0}});
    memset(d, 0x3f, sizeof d);
    d[1][0] = 0;
    while(!q.empty()) {
        ll u = q.top().fi.se, t = q.top().se.fi, par = q.top().se.se;
        ll du = q.top().fi.fi;
        q.pop();
        if(du != d[u][(t != 0)]) continue;
        if(u == n) {
            cout << du;
            exit(0);
        }
        timer++;
        for(auto e : g[u]) {
            ll v = e.fi, c = a[e.se].fi, p = a[e.se].se;
            if(v == par) continue;
            if(dx[c] < timer) {
                color[c] = p;
                dx[c] = timer;
            }
            else color[c] += p;
        }
        if(t == 0) { // da bi thay doi
            for(auto e : g[u]) {
                ll v = e.fi, c = a[e.se].fi, p = a[e.se].se;
                if(d[v][0] > d[u][0] + p) {
                    d[v][0] = d[u][0] + p;
                    q.push({{d[v][0], v},{0, u}});
                }
                if(d[v][1] > d[u][0] + color[c] - p) {
                    d[v][1] = d[u][0] + color[c] - p;
                    q.push({{d[v][1], v},{c, u}});
                }
            }
        }
        else {
            for(auto e : g[u]) {
                ll v = e.fi, c = a[e.se].fi, p = a[e.se].se;
                if(d[v][0] > d[u][1] + p) {
                    d[v][0] = d[u][1] + p;
                    q.push({{d[v][0], v},{0, u}});
                }
                if(t != c && d[v][1] > d[u][1] + color[c] - p) {
                    d[v][1] = d[u][1] + color[c] - p;
                    q.push({{d[v][1], v},{c, u}});
                }
            }
        }
        
    }
}
void hbmt() {
    cin >> n >> m;
    FOR(i, 1, m) {
        ll u, v, c, p;
        cin >> u >> v >> c >> p;
        a[i] = {c, p};
        g[u].push_back({v, i});
        g[v].push_back({u, i});
    }
    DJK();
    cout << -1;

}

int main() {
    
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    
    if(fopen("hbmt.inp", "r")) {
        freopen("hbmt.inp", "r", stdin);
        freopen("hbmt.out", "w", stdout);
    }
    
    // t_test 
    hbmt();
    return 0;
}

Compilation message (stderr)

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

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