oj.uz

Submission #133979

# Submission time Handle Problem Language Result Execution time Memory
133979 2019-07-21T20:22:19 Z Benq Two Transportations (JOI19_transportations) C++14
100 / 100
 1778 ms 90024 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 2000;
const ld PI = 4*atan((ld)1);

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

template<class A, class B> A operator+=(A& l, const B& r) { return l = l+r; }
template<class A, class B> A operator-=(A& l, const B& r) { return l = l-r; }
template<class A, class B> A operator*=(A& l, const B& r) { return l = l*r; }
template<class A, class B> A operator/=(A& l, const B& r) { return l = l/r; }

#include "Azer.h"

namespace {
    int N; vpi adj[MX]; // constant
    bool done[MX]; vi dist; // fill these
    vi turn;

    int lastDist = 0, cturn = 0, step;
    int BES; pi bes;

    void genBes() {
        bes = {MOD,MOD};
        F0R(i,N) if (!done[i]) ckmin(bes,{dist[i],i});
        BES = min(511,bes.f-lastDist);
    }

    int received = 0, bits = 0;
    void process(bool t) { received = 2*received+t; bits ++; }
    void sendInt(int bits, int x) {
        if (x >= (1<<bits)) {
            cerr << "ERROR " << bits << " " << x << " " << step << endl;
            assert(x<(1<<bits));
        }
        F0Rd(i,bits) SendA((x>>i)&1);
    }

    void run0() {
        genBes(); sendInt(9,BES);
        step = 2;
    }

    void goNext() {
        // cerr << "AA " << cturn << " " << bes.f << " " << bes.s << endl;
        done[bes.s] = 1; dist[bes.s] = bes.f;
        trav(i,adj[bes.s]) ckmin(dist[i.f],bes.f+i.s);

        lastDist = bes.f; cturn ++;
        if (cturn == sz(turn)) return;
        // cerr << "AA " << turn[cturn] << endl;
        if (turn[cturn] == 0) run0();
        else step = 1;
    }

    void run1(bool t) {
        process(t);
        if (bits == 9) {
            int r = received; received = bits = 0;
            genBes();
            if (r > BES) {
                SendA(0); sendInt(9,BES); sendInt(11,bes.s);
                goNext();
            } else {
                bes.f = r+lastDist;
                SendA(1); step = 3;
            }
        }
    }

    bool receiving = 0;
    vi v;

    void run2(bool t) {
        if (!receiving) {
            if (t == 0) receiving = true;
            else {
                sendInt(11,bes.s);
                goNext();
            }
            return;
        }
        process(t);
        if (sz(v) == 0) {
            if (bits == 9) {
                v.pb(received); received = bits = 0;
            }
        } else {
            if (bits == 11) {
                v.pb(received); received = bits = receiving = 0;
                bes = {lastDist+v[0],v[1]}; v.clear();
                goNext();
            }
        }
    }

    void run3(bool t) {
        process(t);
        if (bits == 11) {
            bes.s = received; received = bits = 0;
            goNext();
        }
    }
}  // namespace


void ReceiveA(bool t) {
    // cerr << "HA Azer " << t << " " << cturn << " " << step << endl;
    switch (step) {
        case 1:
            run1(t);
            break;
        case 2:
            run2(t);
            break;
        case 3:
            run3(t);
            break;
        default:
            exit(5);
    }
}

void InitA(int _N, int A, vi U, vi V, vi C) {
    N = _N;
    F0R(i,A) {
        adj[U[i]].pb({V[i],C[i]});
        adj[V[i]].pb({U[i],C[i]});
    }
    dist.resz(N); F0R(i,N) dist[i] = MOD;
    srand(5);
    F0R(i,N) turn.pb(rand()&1);
    bes = {0,0}; goNext();
}

vi Answer() {
    return dist;
}

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 100001;
const ld PI = 4*atan((ld)1);

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

template<class A, class B> A operator+=(A& l, const B& r) { return l = l+r; }
template<class A, class B> A operator-=(A& l, const B& r) { return l = l-r; }
template<class A, class B> A operator*=(A& l, const B& r) { return l = l*r; }
template<class A, class B> A operator/=(A& l, const B& r) { return l = l/r; }

#include "Baijan.h"

namespace {
    int N; vpi adj[MX]; // constant
    bool done[MX]; vi dist; // fill these
    vi turn;

    int lastDist = 0, cturn = 0, step;
    int BES; pi bes;

    void genBes() {
        bes = {MOD,MOD};
        F0R(i,N) if (!done[i]) ckmin(bes,{dist[i],i});
        BES = min(511,bes.f-lastDist);
    }

    int received = 0, bits = 0;
    void process(bool t) { received = 2*received+t; bits ++; }
    void sendInt(int bits, int x) { assert(x<(1<<bits)); F0Rd(i,bits) SendB((x>>i)&1); }

    void run0() {
        genBes(); sendInt(9,BES);
        step = 2;
    }

    void goNext() {
        // cerr << "BB " << cturn << " " << bes.f << " " << bes.s << endl;
        done[bes.s] = 1; dist[bes.s] = bes.f;
        trav(i,adj[bes.s]) ckmin(dist[i.f],bes.f+i.s);

        lastDist = bes.f; cturn ++;
        if (cturn == sz(turn)) return;
        // cerr << "BB " << turn[cturn] << endl;
        if (turn[cturn] == 1) run0();
        else step = 1;
    }

    void run1(bool t) {
        process(t);
        if (bits == 9) {
            int r = received; received = bits = 0;
            genBes();
            if (r > BES) {
                SendB(0); sendInt(9,BES); sendInt(11,bes.s);
                goNext();
            } else {
                bes.f = r+lastDist;
                SendB(1); step = 3;
            }
        }
    }

    bool receiving = 0;
    vi v;

    void run2(bool t) {
        if (!receiving) {
            if (t == 0) receiving = true;
            else {
                sendInt(11,bes.s);
                goNext();
            }
            return;
        }
        process(t);
        if (sz(v) == 0) {
            if (bits == 9) {
                v.pb(received); received = bits = 0;
            }
        } else {
            if (bits == 11) {
                v.pb(received); received = bits = receiving = 0;
                bes = {lastDist+v[0],v[1]}; v.clear();
                goNext();
            }
        }
    }

    void run3(bool t) {
        process(t);
        if (bits == 11) {
            bes.s = received; received = bits = 0;
            goNext();
        }
    }
}  // namespace



void ReceiveB(bool t) {
    // cerr << "HA Baijan " << t << " " << cturn << " " << step << endl;
    switch (step) {
        case 1:
            run1(t);
            break;
        case 2:
            run2(t);
            break;
        case 3:
            run3(t);
            break;
        default:
            exit(5);
    }
}

void InitB(int _N, int A, vi U, vi V, vi C) {
    N = _N;
    F0R(i,A) {
        adj[U[i]].pb({V[i],C[i]});
        adj[V[i]].pb({U[i],C[i]});
    }
    dist.resz(N); F0R(i,N) dist[i] = MOD;
    srand(5);
    F0R(i,N) turn.pb(rand()&1);
    bes = {0,0}; goNext();
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1146 ms 6320 KB Output is correct
2 Correct 8 ms 5600 KB Output is correct
3 Correct 966 ms 6280 KB Output is correct
4 Correct 1264 ms 24736 KB Output is correct
5 Correct 82 ms 6248 KB Output is correct
6 Correct 1026 ms 8928 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 5856 KB Output is correct
2 Correct 1210 ms 6472 KB Output is correct
3 Correct 1114 ms 6424 KB Output is correct
4 Correct 1452 ms 59688 KB Output is correct
5 Correct 1452 ms 52624 KB Output is correct
6 Correct 134 ms 6008 KB Output is correct
7 Correct 1476 ms 52992 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 926 ms 6024 KB Output is correct
2 Correct 8 ms 5648 KB Output is correct
3 Correct 980 ms 6352 KB Output is correct
4 Correct 1082 ms 6264 KB Output is correct
5 Correct 1082 ms 6336 KB Output is correct
6 Correct 986 ms 6200 KB Output is correct
7 Correct 992 ms 6464 KB Output is correct
8 Correct 1084 ms 6176 KB Output is correct
9 Correct 864 ms 6216 KB Output is correct
10 Correct 1052 ms 6032 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 584 ms 6024 KB Output is correct
2 Correct 494 ms 5936 KB Output is correct
3 Correct 660 ms 28216 KB Output is correct
4 Correct 574 ms 6504 KB Output is correct
5 Correct 483 ms 21912 KB Output is correct
6 Correct 396 ms 6120 KB Output is correct
7 Correct 436 ms 6056 KB Output is correct
8 Correct 458 ms 6224 KB Output is correct
9 Correct 620 ms 40704 KB Output is correct
10 Correct 856 ms 40712 KB Output is correct
11 Correct 965 ms 65704 KB Output is correct
12 Correct 866 ms 58032 KB Output is correct
13 Correct 560 ms 6112 KB Output is correct
14 Correct 12 ms 5824 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 584 ms 6024 KB Output is correct
2 Correct 494 ms 5936 KB Output is correct
3 Correct 660 ms 28216 KB Output is correct
4 Correct 574 ms 6504 KB Output is correct
5 Correct 483 ms 21912 KB Output is correct
6 Correct 396 ms 6120 KB Output is correct
7 Correct 436 ms 6056 KB Output is correct
8 Correct 458 ms 6224 KB Output is correct
9 Correct 620 ms 40704 KB Output is correct
10 Correct 856 ms 40712 KB Output is correct
11 Correct 965 ms 65704 KB Output is correct
12 Correct 866 ms 58032 KB Output is correct
13 Correct 560 ms 6112 KB Output is correct
14 Correct 12 ms 5824 KB Output is correct
15 Correct 528 ms 6064 KB Output is correct
16 Correct 680 ms 6048 KB Output is correct
17 Correct 440 ms 5936 KB Output is correct
18 Correct 644 ms 22120 KB Output is correct
19 Correct 343 ms 6360 KB Output is correct
20 Correct 636 ms 22664 KB Output is correct
21 Correct 662 ms 6112 KB Output is correct
22 Correct 542 ms 6320 KB Output is correct
23 Correct 866 ms 48376 KB Output is correct
24 Correct 686 ms 48552 KB Output is correct
25 Correct 1298 ms 79536 KB Output is correct
26 Correct 1184 ms 69256 KB Output is correct
27 Correct 442 ms 6328 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 584 ms 6024 KB Output is correct
2 Correct 494 ms 5936 KB Output is correct
3 Correct 660 ms 28216 KB Output is correct
4 Correct 574 ms 6504 KB Output is correct
5 Correct 483 ms 21912 KB Output is correct
6 Correct 396 ms 6120 KB Output is correct
7 Correct 436 ms 6056 KB Output is correct
8 Correct 458 ms 6224 KB Output is correct
9 Correct 620 ms 40704 KB Output is correct
10 Correct 856 ms 40712 KB Output is correct
11 Correct 965 ms 65704 KB Output is correct
12 Correct 866 ms 58032 KB Output is correct
13 Correct 560 ms 6112 KB Output is correct
14 Correct 12 ms 5824 KB Output is correct
15 Correct 528 ms 6064 KB Output is correct
16 Correct 680 ms 6048 KB Output is correct
17 Correct 440 ms 5936 KB Output is correct
18 Correct 644 ms 22120 KB Output is correct
19 Correct 343 ms 6360 KB Output is correct
20 Correct 636 ms 22664 KB Output is correct
21 Correct 662 ms 6112 KB Output is correct
22 Correct 542 ms 6320 KB Output is correct
23 Correct 866 ms 48376 KB Output is correct
24 Correct 686 ms 48552 KB Output is correct
25 Correct 1298 ms 79536 KB Output is correct
26 Correct 1184 ms 69256 KB Output is correct
27 Correct 442 ms 6328 KB Output is correct
28 Correct 638 ms 6376 KB Output is correct
29 Correct 574 ms 6016 KB Output is correct
30 Correct 982 ms 46648 KB Output is correct
31 Correct 658 ms 6280 KB Output is correct
32 Correct 830 ms 41824 KB Output is correct
33 Correct 560 ms 6248 KB Output is correct
34 Correct 386 ms 6512 KB Output is correct
35 Correct 521 ms 6376 KB Output is correct
36 Correct 1032 ms 53920 KB Output is correct
37 Correct 858 ms 53696 KB Output is correct
38 Correct 1358 ms 90024 KB Output is correct
39 Correct 1120 ms 83024 KB Output is correct
40 Correct 612 ms 6400 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1146 ms 6320 KB Output is correct
2 Correct 8 ms 5600 KB Output is correct
3 Correct 966 ms 6280 KB Output is correct
4 Correct 1264 ms 24736 KB Output is correct
5 Correct 82 ms 6248 KB Output is correct
6 Correct 1026 ms 8928 KB Output is correct
7 Correct 12 ms 5856 KB Output is correct
8 Correct 1210 ms 6472 KB Output is correct
9 Correct 1114 ms 6424 KB Output is correct
10 Correct 1452 ms 59688 KB Output is correct
11 Correct 1452 ms 52624 KB Output is correct
12 Correct 134 ms 6008 KB Output is correct
13 Correct 1476 ms 52992 KB Output is correct
14 Correct 926 ms 6024 KB Output is correct
15 Correct 8 ms 5648 KB Output is correct
16 Correct 980 ms 6352 KB Output is correct
17 Correct 1082 ms 6264 KB Output is correct
18 Correct 1082 ms 6336 KB Output is correct
19 Correct 986 ms 6200 KB Output is correct
20 Correct 992 ms 6464 KB Output is correct
21 Correct 1084 ms 6176 KB Output is correct
22 Correct 864 ms 6216 KB Output is correct
23 Correct 1052 ms 6032 KB Output is correct
24 Correct 584 ms 6024 KB Output is correct
25 Correct 494 ms 5936 KB Output is correct
26 Correct 660 ms 28216 KB Output is correct
27 Correct 574 ms 6504 KB Output is correct
28 Correct 483 ms 21912 KB Output is correct
29 Correct 396 ms 6120 KB Output is correct
30 Correct 436 ms 6056 KB Output is correct
31 Correct 458 ms 6224 KB Output is correct
32 Correct 620 ms 40704 KB Output is correct
33 Correct 856 ms 40712 KB Output is correct
34 Correct 965 ms 65704 KB Output is correct
35 Correct 866 ms 58032 KB Output is correct
36 Correct 560 ms 6112 KB Output is correct
37 Correct 12 ms 5824 KB Output is correct
38 Correct 528 ms 6064 KB Output is correct
39 Correct 680 ms 6048 KB Output is correct
40 Correct 440 ms 5936 KB Output is correct
41 Correct 644 ms 22120 KB Output is correct
42 Correct 343 ms 6360 KB Output is correct
43 Correct 636 ms 22664 KB Output is correct
44 Correct 662 ms 6112 KB Output is correct
45 Correct 542 ms 6320 KB Output is correct
46 Correct 866 ms 48376 KB Output is correct
47 Correct 686 ms 48552 KB Output is correct
48 Correct 1298 ms 79536 KB Output is correct
49 Correct 1184 ms 69256 KB Output is correct
50 Correct 442 ms 6328 KB Output is correct
51 Correct 638 ms 6376 KB Output is correct
52 Correct 574 ms 6016 KB Output is correct
53 Correct 982 ms 46648 KB Output is correct
54 Correct 658 ms 6280 KB Output is correct
55 Correct 830 ms 41824 KB Output is correct
56 Correct 560 ms 6248 KB Output is correct
57 Correct 386 ms 6512 KB Output is correct
58 Correct 521 ms 6376 KB Output is correct
59 Correct 1032 ms 53920 KB Output is correct
60 Correct 858 ms 53696 KB Output is correct
61 Correct 1358 ms 90024 KB Output is correct
62 Correct 1120 ms 83024 KB Output is correct
63 Correct 612 ms 6400 KB Output is correct
64 Correct 1146 ms 6760 KB Output is correct
65 Correct 1000 ms 51392 KB Output is correct
66 Correct 1108 ms 45504 KB Output is correct
67 Correct 876 ms 6568 KB Output is correct
68 Correct 1128 ms 6464 KB Output is correct
69 Correct 1778 ms 87840 KB Output is correct
70 Correct 1569 ms 72512 KB Output is correct
71 Correct 1094 ms 13632 KB Output is correct
72 Correct 1212 ms 6968 KB Output is correct