답안 #1087924

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1087924 2024-09-13T14:16:35 Z vladilius Reconstruction Project (JOI22_reconstruction) C++17
31 / 100
5000 ms 425404 KB
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define pb push_back
#define ff first
#define ss second
#define ins insert
#define arr3 array<int, 3>
const int inf = 1e9 + 5;

struct dsu{
    vector<int> sz, p;
    int n;
    void init(int ns){
        n = ns;
        sz.resize(n + 1);
        p.resize(n + 1);
        for (int i = 1; i <= n; i++){
            p[i] = i;
            sz[i] = 1;
        }
    }
    int get(int v){
        if (p[v] != v){
            p[v] = get(p[v]);
        }
        return p[v];
    }
    void unite(int x, int y){
        x = get(x); y = get(y);
        if (x == y) return;
        if (sz[x] > sz[y]) swap(x, y);
        p[x] = y;
        sz[y] += sz[x];
    }
    bool same(int x, int y){
        return get(x) == get(y);
    }
    void clear(){
        for (int i = 1; i <= n; i++){
            p[i] = i;
            sz[i] = 1;
        }
    }
};

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n, m; cin>>n>>m;
    vector<arr3> ed;
    for (int i = 1; i <= m; i++){
        int a, b, w; cin>>a>>b>>w;
        ed.pb({a, b, w});
    }
    
    int q; cin>>q;
    vector<int> x(q + 1);
    vector<ll> out(q + 1);
    for (int i = 1; i <= q; i++){
        cin>>x[i];
    }
    
    auto cmp = [&](arr3& x, arr3& y){
        return x[2] < y[2];
    };
    sort(ed.begin(), ed.end(), cmp);
    vector<int> ws;
    for (int i = 0; i < m; i++) ws.pb(ed[i][2]);
    
    vector<int> :: iterator it, it1, it2;
    dsu T[m];
    for (int i = 0; i < m; i++) T[i].init(n);
    
    vector<ll> p1(q + 2);
    vector<int> p2(q + 2);
    
    for (int i = m - 1; i >= 0; i--){
        auto [a, b, w] = ed[i];
        
        auto check = [&](int x){
            int ww = w + 2 * (x - w);
            it = upper_bound(ws.begin(), ws.end(), ww); it--;
            int j = (int) (it - ws.begin());
            return T[j].same(a, b);
        };
        
        int l = w, r = inf;
        while (l + 1 < r){
            int m = (l + r) / 2;
            if (check(m)){
                r = m - 1;
            }
            else {
                l = m;
            }
        }
        if (!check(r)) l = r;
        if (check(l)) continue;
    
        it1 = lower_bound(x.begin() + 1, x.end(), w);
        it2 = upper_bound(x.begin() + 1, x.end(), l);
        l = (int) (it1 - x.begin()); r = (int)(it2 - x.begin());
        p1[l] -= w; p1[r] += w;
        p2[l]++; p2[r]--;

        for (int j = i; j < m; j++){
            if (T[j].same(a, b)) continue;
            T[j].unite(a, b);
        }
    }
    
    for (int i = 0; i < m; i++) T[i].clear();
    
    for (int i = 0; i < m; i++){
        auto [a, b, w] = ed[i];
        
        auto check = [&](int x){
            int ww = 2 * x + 1 - w;
            it = lower_bound(ws.begin(), ws.end(), ww);
            int j = (int) (it - ws.begin());
            return T[j].same(a, b);
        };
        
        int l = 0, r = w - 1;
        while (l + 1 < r){
            int m = (l + r) / 2;
            if (check(m)){
                l = m + 1;
            }
            else {
                r = m;
            }
        }
        if (!check(l)) r = l;
        if (check(r)) continue;
        
        it1 = lower_bound(x.begin() + 1, x.end(), r);
        it2 = lower_bound(x.begin() + 1, x.end(), w);
        l = (int) (it1 - x.begin()); r = (int)(it2 - x.begin());
        p1[l] += w; p1[r] -= w;
        p2[l]--; p2[r]++;

        for (int j = i; j >= 0; j--){
            if (T[j].same(a, b)) continue;
            T[j].unite(a, b);
        }
    }
    
    ll s1 = 0; int s2 = 0;
    for (int i = 1; i <= q; i++){
        s1 += p1[i];
        s2 += p2[i];
        cout<<1LL * x[i] * s2 + s1<<"\n";
    }
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Execution timed out 5109 ms 401864 KB Time limit exceeded
21 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Execution timed out 5107 ms 425404 KB Time limit exceeded
5 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 145 ms 40132 KB Output is correct
21 Correct 138 ms 40272 KB Output is correct
22 Correct 141 ms 40020 KB Output is correct
23 Correct 142 ms 40116 KB Output is correct
24 Correct 144 ms 40124 KB Output is correct
25 Correct 139 ms 40016 KB Output is correct
26 Correct 139 ms 40272 KB Output is correct
27 Correct 142 ms 40020 KB Output is correct
28 Correct 140 ms 40132 KB Output is correct
29 Correct 138 ms 40136 KB Output is correct
30 Correct 139 ms 40120 KB Output is correct
31 Correct 157 ms 40016 KB Output is correct
32 Correct 134 ms 40788 KB Output is correct
33 Correct 138 ms 39764 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Execution timed out 5109 ms 401864 KB Time limit exceeded
21 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Execution timed out 5109 ms 401864 KB Time limit exceeded
21 Halted 0 ms 0 KB -