Submission #965067

#	Time	Username	Problem	Language	Result	Execution time	Memory
965067		gaga999	Reconstruction Project (JOI22_reconstruction)	C++17	100 / 100	337 ms	29112 KiB

reconstruction

// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define size(x) (int)x.size()
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef __int128_t lll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

const int N = 505, M = 1e5 + 5;
struct E
{
    int a, b, w;
    bool operator<(const E &rh) const { return w < rh.w; }
    inline void ini() { rd(a, b, w); }
} eg[M];
vector<pii> e[N];
vector<E> qy;
int ln;

int dfs(int u, int t, int fa)
{
    for (pii v : e[u])
    {
        if (v.F == fa)
            continue;
        if (v.F == t)
            return v.S;
        if (int tp = dfs(v.F, t, u))
            return eg[tp].w < eg[v.S].w ? tp : v.S;
    }
    return 0;
}

signed main()
{
    int n, m, q, x;
    rd(n, m);
    for (int i = 1; i <= m; i++)
        eg[i].ini();
    sort(eg + 1, eg + m + 1);
    for (int i = 1; i <= m; i++)
    {
        if (int tp = dfs(eg[i].a, eg[i].b, -1))
        {
            e[eg[tp].a].erase(find(iter(e[eg[tp].a]), pii(eg[tp].b, tp)));
            e[eg[tp].b].erase(find(iter(e[eg[tp].b]), pii(eg[tp].a, tp)));
            qy.pb(E{-2, eg[i].w + eg[tp].w, (eg[i].w + eg[tp].w + 1) >> 1});
        }
        else
            qy.pb(E{-1, eg[i].w, -INF});
        qy.pb(E{2, -(eg[i].w << 1), eg[i].w});
        e[eg[i].a].pb(eg[i].b, i);
        e[eg[i].b].pb(eg[i].a, i);
    }
    sort(iter(qy));
    rd(q);
    llt sum = 0, num = 0;
    while (q--)
    {
        rd(x);
        while (ln < size(qy) && qy[ln].w <= x)
            num += qy[ln].a, sum += qy[ln].b, ln++;
        prt(sum + x * num), putchar('\n');
    }
}

• Subtask 1: 3 / 3
• Subtask 2: 4 / 4
• Subtask 3: 7 / 7
• Subtask 4: 28 / 28
• Subtask 5: 35 / 35
• Subtask 6: 23 / 23