oj.uz

Submission #642244

# Submission time Handle Problem Language Result Execution time Memory
642244 2022-09-19T03:02:17 Z Ez0zIOVgTsSgT Robot (JOI21_ho_t4) C++14
100 / 100
 735 ms 84556 KB 
#include<bits/stdc++.h>
using namespace std;

void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << h; if(sizeof...(t)) cerr << ", ";
    DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL

#define FOR(i,a,b) for(int i = (a) ; i<(b) ; i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for(int i = (b)-1 ; i>=(a) ; i--)
#define R0F(i,a) ROF(i,0,a)
#define each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"
#define fi first
#define se second

using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;

void setIO(string NAME = "") {
    cin.tie(0)->sync_with_stdio(0);
    if(sz(NAME)) {
        freopen((NAME + ".inp").c_str(),"r",stdin);
        freopen((NAME + ".out").c_str(),"w",stdout);
    }
}

tcT> bool ckmin(T&a, const T&b) {
    return b < a ? a=b,1 : 0; }
tcT> bool ckmax(T&a, const T&b) {
    return b > a ? a=b,1 : 0; }

const int MOD = 1e9 + 7;

const ll INF = 1e18;
const int MX = 1e5+5;

struct Edge {
    int to, c;
    ll p;
};

struct Dat {
    ll curdist;
    int u, c;
    bool operator<(const Dat&rhs) const {
        return curdist > rhs.curdist;
    }
};

map<int,V<Edge>> adj[MX];
ll dist[MX];
map<int,ll> dist2[MX], psum[MX];
int N, M;

void solve() {
    cin >> N >> M;
    F0R(i, M) {
        int u, v, c;
        ll p;
        cin >> u >> v >> c >> p;
        adj[u][c].pb({v, c, p});
        adj[v][c].pb({u, c, p});
        psum[u][c] += p;
        psum[v][c] += p;
    }
    memset(dist, 0x3f, sizeof dist);
    dist[1] = 0;
    priority_queue<Dat> pq;
    pq.push({0, 1, 0});
    while(!pq.empty()) {
        ll du = pq.top().curdist;
        int u = pq.top().u, c = pq.top().c;
        pq.pop();
        if(c) {
            if(dist2[u][c] != du) continue;
            each(ed, adj[u][c]) {
                int v = ed.to, col = ed.c;
                ll dv = du + psum[u][col] - ed.p;
                // not flip color c
                if(ckmin(dist[v], dv)) {
                    pq.push({dist[v], v, 0});
                }
            }
        }
        else {
            if(dist[u] != du) continue;
            each(edmp, adj[u]) {
                each(ed, edmp.se) {
                    //CASE 1 : not change this color
                    int v = ed.to;
                    ll dv = du + psum[u][ed.c] - ed.p;
                    if(ckmin(dist[v], dv)) {
                        pq.push({dist[v], v, 0});
                    }
                    //CASE 2 != 1
                    dv = du + ed.p;
                    if(ckmin(dist[v], dv)) {
                        pq.push({dist[v], v, 0});
                    }
                    //CASE 3
                    dv = du;
                    if(dist2[v].find(ed.c) == dist2[v].end() || dv < dist2[v][ed.c]) {
                        dist2[v][ed.c] = dv;
                        pq.push({dv, v, ed.c});
                    }
                }
            }
        }
    }
    ll ans = dist[N];
    if(ans >= INF) ans = -1;
    cout << ans << nl;
}

int main() {
    setIO();

    int t=1;
    //cin>>t;
    while(t-->0) {
        solve();
    }

    return 0;
}

Compilation message

Main.cpp: In function 'void setIO(std::string)':
Main.cpp:39:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |         freopen((NAME + ".inp").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:40:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |         freopen((NAME + ".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15188 KB Output is correct
2 Correct 8 ms 15128 KB Output is correct
3 Correct 7 ms 15188 KB Output is correct
4 Correct 8 ms 15188 KB Output is correct
5 Correct 10 ms 15224 KB Output is correct
6 Correct 8 ms 15144 KB Output is correct
7 Correct 10 ms 15384 KB Output is correct
8 Correct 10 ms 15236 KB Output is correct
9 Correct 11 ms 15828 KB Output is correct
10 Correct 12 ms 15700 KB Output is correct
11 Correct 9 ms 15572 KB Output is correct
12 Correct 9 ms 15500 KB Output is correct
13 Correct 9 ms 15572 KB Output is correct
14 Correct 9 ms 15572 KB Output is correct
15 Correct 9 ms 15448 KB Output is correct
16 Correct 9 ms 15444 KB Output is correct
17 Correct 9 ms 15572 KB Output is correct
18 Correct 8 ms 15316 KB Output is correct
19 Correct 12 ms 15476 KB Output is correct
20 Correct 10 ms 15444 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 35000 KB Output is correct
2 Correct 65 ms 25240 KB Output is correct
3 Correct 183 ms 32172 KB Output is correct
4 Correct 122 ms 28240 KB Output is correct
5 Correct 722 ms 82600 KB Output is correct
6 Correct 594 ms 72136 KB Output is correct
7 Correct 290 ms 56264 KB Output is correct
8 Correct 346 ms 50776 KB Output is correct
9 Correct 363 ms 50920 KB Output is correct
10 Correct 329 ms 48188 KB Output is correct
11 Correct 122 ms 32732 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15188 KB Output is correct
2 Correct 8 ms 15128 KB Output is correct
3 Correct 7 ms 15188 KB Output is correct
4 Correct 8 ms 15188 KB Output is correct
5 Correct 10 ms 15224 KB Output is correct
6 Correct 8 ms 15144 KB Output is correct
7 Correct 10 ms 15384 KB Output is correct
8 Correct 10 ms 15236 KB Output is correct
9 Correct 11 ms 15828 KB Output is correct
10 Correct 12 ms 15700 KB Output is correct
11 Correct 9 ms 15572 KB Output is correct
12 Correct 9 ms 15500 KB Output is correct
13 Correct 9 ms 15572 KB Output is correct
14 Correct 9 ms 15572 KB Output is correct
15 Correct 9 ms 15448 KB Output is correct
16 Correct 9 ms 15444 KB Output is correct
17 Correct 9 ms 15572 KB Output is correct
18 Correct 8 ms 15316 KB Output is correct
19 Correct 12 ms 15476 KB Output is correct
20 Correct 10 ms 15444 KB Output is correct
21 Correct 179 ms 35000 KB Output is correct
22 Correct 65 ms 25240 KB Output is correct
23 Correct 183 ms 32172 KB Output is correct
24 Correct 122 ms 28240 KB Output is correct
25 Correct 722 ms 82600 KB Output is correct
26 Correct 594 ms 72136 KB Output is correct
27 Correct 290 ms 56264 KB Output is correct
28 Correct 346 ms 50776 KB Output is correct
29 Correct 363 ms 50920 KB Output is correct
30 Correct 329 ms 48188 KB Output is correct
31 Correct 122 ms 32732 KB Output is correct
32 Correct 116 ms 29096 KB Output is correct
33 Correct 176 ms 29832 KB Output is correct
34 Correct 340 ms 50624 KB Output is correct
35 Correct 264 ms 41860 KB Output is correct
36 Correct 246 ms 46908 KB Output is correct
37 Correct 290 ms 49192 KB Output is correct
38 Correct 296 ms 55676 KB Output is correct
39 Correct 121 ms 32496 KB Output is correct
40 Correct 377 ms 52160 KB Output is correct
41 Correct 396 ms 52352 KB Output is correct
42 Correct 423 ms 60808 KB Output is correct
43 Correct 210 ms 37592 KB Output is correct
44 Correct 371 ms 43300 KB Output is correct
45 Correct 299 ms 47548 KB Output is correct
46 Correct 260 ms 47860 KB Output is correct
47 Correct 278 ms 49108 KB Output is correct
48 Correct 735 ms 84556 KB Output is correct