Submission #565099

#	Time	Username	Problem	Language	Result	Execution time	Memory
565099		maomao90	Two Transportations (JOI19_transportations)	C++17	0 / 100	377 ms	10328 KiB

Azer

// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
#include "Azer.h"
using namespace std;

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 200005;

namespace {
    const int NLOG = 10, CLOG = 8;
    int n, m;
    vii adj[MAXN];
    queue<bool> qu;
    int vis[MAXN];

    iii get() {
        int u = 0, v = 0, c = 0;
        REP (i, 0, NLOG) {
            u += qu.front() << i;
            qu.pop();
        }
        REP (i, 0, NLOG) {
            v += qu.front() << i;
            qu.pop();
        }
        REP (i, 0, CLOG) {
            c += qu.front() << i;
            qu.pop();
        }
        return {u, v, c};
    }
}

void InitA(int N, int A, vi U, vi V, vi C) {
    n = N; m = A;
    REP (i, 0, m) {
        adj[U[i]].pb({V[i], C[i]});
        adj[V[i]].pb({U[i], C[i]});
    }
}

void ReceiveA(bool x) {
    qu.push(x);
    if (qu.size() == NLOG * 2 + CLOG) {
        auto [u, v, c] = get();
        cerr << u << ' ' << v << ' ' << c << '\n';
        adj[u].pb({v, c});
        adj[v].pb({u, c});
    }
}

vi Answer() {
    vi dist(n, INF);
    dist[0] = 0;
    while (1) {
        int u = -1, d = INF;
        REP (i, 0, n) {
            if (vis[i]) continue;
            if (mnto(d, dist[i])) {
                u = i;
            }
        }
        if (u == -1) {
            break;
        }
        vis[u] = 1;
        for (auto [v, w] : adj[u]) {
            mnto(dist[v], d + w);
        }
    }
    return dist;
}

Baijan

// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
#include "Baijan.h"
using namespace std;

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 200005;

namespace {
    const int NLOG = 10, CLOG = 8;
    int n, m;
    vii adj[MAXN];

    void send(int u, int v, int c) {
        REP (i, 0, NLOG) {
            SendB(u >> i & 1);
        }
        REP (i, 0, NLOG) {
            SendB(v >> i & 1);
        }
        REP (i, 0, CLOG) {
            SendB(c >> i & 1);
        }
    }
}

void InitB(int N, int B, vi U, vi V, vi C) {
    n = N; m = B;
    REP (i, 0, m) {
        adj[U[i]].pb({V[i], C[i]});
        adj[V[i]].pb({U[i], C[i]});
    }
    REP (u, 0, n) {
        for (auto [v, c] : adj[u]) {
            if (v < u) continue;
            send(u, v, c);
        }
    }
}

void ReceiveB(bool y) {
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 8
• Subtask 3: 0 / 8
• Subtask 4: 0 / 38
• Subtask 5: 0 / 14
• Subtask 6: 0 / 10
• Subtask 7: 0 / 16