oj.uz

Submission #446463

# Submission time Handle Problem Language Result Execution time Memory
446463 2021-07-22T03:39:00 Z stat0r1c Robot (JOI21_ho_t4) C++11
34 / 100
 1472 ms 2097156 KB 
#include <bits/stdc++.h>
/* #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> */
using namespace std;
// using namespace __gnu_pbds;
using ll = long long;
using ull = unsigned ll;
template<typename T> using vt = vector<T>;
using vi = vt<int>;
using vvi = vt<vi>;
using ii = pair<int, int>;
using vii = vt<ii>;
/* template<typename T>
using indexed_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>; */
/* struct chash {
    static ull hash_f(ull x) {x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31);}
    size_t operator()(ull x) const {static const ull RANDOM = chrono::steady_clock::now().time_since_epoch().count();return hash_f(x + RANDOM);}
};
struct iihash {
    template <class T1, class T2>
    size_t operator () (const pair<T1,T2> &p) const {auto h1 = hash<T1>{}(p.first);auto h2 = hash<T2>{}(p.second);return h1 ^ h2;}
};
template<class T1, class T2, class T3> using ii_umap = gp_hash_table<pair<T1,T2>,T3,iihash>;
template<class T1, class T2> using f_umap = gp_hash_table<T1,T2,chash>;
template<class T1, class T2> using o_umap = gp_hash_table<T1,T2>; */
#define sqr(x) (x)*(x)
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define debug(x) cerr << #x << " -> " << x << '\n'
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define eb emplace_back
const int inf = 1e9 + 7;
const ll infll = 1e18 + 10;
template <typename T> inline T fgcd(T a, T b) {while(b) swap(b, a %= b); return a;}
ll fpow(ll a, ll b) {ll o = 1; for(;b;b >>= 1) {if(b & 1) o = o * a;a = a * a;} return o;}
ll fpow(ll a, ll b, ll m) {ll o = 1; a %= m; for(;b;b >>= 1) {if(b & 1) o = o * a % m;a = a * a % m;} return o;}
template<class T> void uniq(vt<T> &a) {sort(all(a));a.resize(unique(all(a)) - a.begin());}
using iii = pair<int, pair<ii, int>>;
using pli = pair<pair<ll, ll>, pair<ii, int>>;
int n,m,x,y,c,p,pos,l;
ll ans = -1,du,e;
int main() {
    scanf("%d%d", &n, &m);
    vt<map<int, ll>> price(n + 1);
    vt<vt<bitset<200001>>> visEdge(n + 1, vt<bitset<200001>>(2));
    vt<vt<iii>> a(n + 1);
    for(int i = 1; i <= m; i++) {
        scanf("%d%d%d%d", &x, &y, &c, &p);
        price[x][c] += p;
        price[y][c] += p;
        a[x].eb(y, mp(mp(c, p), i));
        a[y].eb(x, mp(mp(c, p), i));
    }
    priority_queue<pli, vt<pli>, greater<pli>> pq;
    pq.push({{0, 0}, mp(mp(1, 0), 0)});
    while(!pq.empty()) {
        p = pq.top().S.S;
        tie(x, c) = pq.top().S.F;
        tie(du, e) = pq.top().F;
        pq.pop();
        /* debug(x);
        debug(c);
        debug(du); */
        if(visEdge[x][c != 0][p]) continue;
        if(x == n) {
            ans = du;
            break;
        }
        visEdge[x][c != 0][p] = 1;
        for(auto v : a[x]) {
            if(v.F != 1) {
                pos = v.S.S;
                tie(y, l) = v.S.F;
                ll k = price[x][y] - (c == y ? e : 0) - l;
                /* debug(x);
                debug(k);
                debug(price[x][v.S.F]);
                debug(c);
                debug(v.F);
                debug(v.S.F);
                debug(v.S.S); */
                pq.push({{du + k, 0}, mp(mp(v.F, 0), 0)});
                pq.push({{du + l, l}, mp(mp(v.F, y), pos)});
            }
        }
    }
    printf("%lld", ans);
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:47:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp:52:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |         scanf("%d%d%d%d", &x, &y, &c, &p);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 716 KB Output is correct
3 Correct 1 ms 716 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 3 ms 3532 KB Output is correct
6 Correct 1 ms 844 KB Output is correct
7 Correct 3 ms 4300 KB Output is correct
8 Correct 2 ms 3148 KB Output is correct
9 Correct 965 ms 115416 KB Output is correct
10 Correct 645 ms 82572 KB Output is correct
11 Correct 165 ms 115348 KB Output is correct
12 Correct 322 ms 82396 KB Output is correct
13 Correct 1472 ms 181004 KB Output is correct
14 Correct 1456 ms 181076 KB Output is correct
15 Correct 31 ms 49476 KB Output is correct
16 Correct 35 ms 49832 KB Output is correct
17 Correct 28 ms 40372 KB Output is correct
18 Correct 25 ms 45232 KB Output is correct
19 Correct 10 ms 7624 KB Output is correct
20 Correct 30 ms 49500 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1035 ms 1290752 KB Output is correct
2 Correct 622 ms 794664 KB Output is correct
3 Correct 544 ms 846772 KB Output is correct
4 Correct 726 ms 1244348 KB Output is correct
5 Runtime error 1387 ms 2097156 KB Execution killed with signal 9
6 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 716 KB Output is correct
3 Correct 1 ms 716 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 3 ms 3532 KB Output is correct
6 Correct 1 ms 844 KB Output is correct
7 Correct 3 ms 4300 KB Output is correct
8 Correct 2 ms 3148 KB Output is correct
9 Correct 965 ms 115416 KB Output is correct
10 Correct 645 ms 82572 KB Output is correct
11 Correct 165 ms 115348 KB Output is correct
12 Correct 322 ms 82396 KB Output is correct
13 Correct 1472 ms 181004 KB Output is correct
14 Correct 1456 ms 181076 KB Output is correct
15 Correct 31 ms 49476 KB Output is correct
16 Correct 35 ms 49832 KB Output is correct
17 Correct 28 ms 40372 KB Output is correct
18 Correct 25 ms 45232 KB Output is correct
19 Correct 10 ms 7624 KB Output is correct
20 Correct 30 ms 49500 KB Output is correct
21 Correct 1035 ms 1290752 KB Output is correct
22 Correct 622 ms 794664 KB Output is correct
23 Correct 544 ms 846772 KB Output is correct
24 Correct 726 ms 1244348 KB Output is correct
25 Runtime error 1387 ms 2097156 KB Execution killed with signal 9
26 Halted 0 ms 0 KB -