답안 #568709

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
568709	2022-05-26T05:55:49 Z	maomao90	Reconstruction Project (JOI22_reconstruction)	C++17	7 / 100	243 ms	47412 KB

reconstruction

// 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> 
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 SZ(_a) (int) _a.size()
#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 MAXM = 100005;
const int MAXN = 505;
const int MAXQ = 1000005;

int n, m;
iii edges[MAXM];
int q;
ii qry[MAXQ];
vii vw[MAXN];
int lft[MAXM], rht[MAXM];
ll ans[MAXQ];

int rp[MAXN], rnk[MAXN];
void init() {
    REP (i, 1, n + 1) {
        rnk[i] = 1;
        rp[i] = i;
    }
}
int findp(int i) {
    if (rp[i] == i) return i;
    return rp[i] = findp(rp[i]);
}
bool join(int a, int b) {
    int pa = findp(a), pb = findp(b);
    if (pa == pb) return 0;
    if (rnk[pa] < rnk[pb]) swap(pa, pb);
    if (rnk[pa] == rnk[pb]) rnk[pa]++;
    rp[pb] = pa;
    return 1;
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n >> m;
    REP (i, 0, m) {
        int a, b, w; cin >> a >> b >> w;
        edges[i] = {a, b, w};
        vw[a].pb({w, i});
    }
    cin >> q;
    REP (i, 0, q) {
        cin >> qry[i].FI;
        qry[i].SE = i;
    }
    viii ev;
    REP (i, 1, n) {
        sort(ALL(vw[i]));
        lft[vw[i][0].SE] = 1;
        REP (j, 0, SZ(vw[i]) - 1) {
            int mid = vw[i][j].FI + vw[i][j + 1].FI + 1 >> 1;
            rht[vw[i][j].SE] = mid;
            lft[vw[i][j + 1].SE] = mid;
        }
        rht[vw[i].back().SE] = INF;
        REP (j, 0, SZ(vw[i])) {
            ev.pb({lft[vw[i][j].SE], vw[i][j].FI, 1});
            ev.pb({vw[i][j].FI, 2 * -vw[i][j].FI, -2});
            ev.pb({rht[vw[i][j].SE], vw[i][j].FI, 1});
        }
    }
    sort(ALL(ev));
    int j = 0;
    ll res = 0;
    int minus = 0;
    REP (i, 0, q) {
        auto [x, id] = qry[i];
        while (j < SZ(ev) && get<0>(ev[j]) <= x) {
            auto [a, b, c] = ev[j];
            res += b;
            minus += c;
            j++;
        }
        ans[id] = res - (ll) x * minus;
    }
    REP (i, 0, q) {
        cout << ans[i] << '\n';
    }
    return 0;
}

Compilation message

reconstruction.cpp: In function 'int main()':
reconstruction.cpp:88:53: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   88 |             int mid = vw[i][j].FI + vw[i][j + 1].FI + 1 >> 1;

Subtask #1
0 / 3.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	340 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	340 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #3
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	356 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	243 ms	43508 KB	Output is correct
5	Correct	236 ms	45064 KB	Output is correct
6	Correct	237 ms	44976 KB	Output is correct
7	Correct	233 ms	46908 KB	Output is correct
8	Correct	238 ms	47284 KB	Output is correct
9	Correct	240 ms	47412 KB	Output is correct
10	Correct	236 ms	45280 KB	Output is correct
11	Correct	241 ms	47212 KB	Output is correct