oj.uz

답안 #647578

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
647578 2022-10-03T08:33:32 Z baojiaopisu 다리 (APIO19_bridges) C++14
100 / 100
 2769 ms 9964 KB 
#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
	void add(X &x, const Y &y) {
		x = (x + y);
		if(x >= MOD) x -= MOD;
	}

template<class X, class Y> 
	void sub(X &x, const Y &y) {
		x = (x - y);
		if(x < 0) x += MOD;
	}

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 1e5 + 10;

int par[N], ans[N], weight[N];
struct T {
    int u, v, pu, pv;
};
struct Edges {
    int u, v, w, id;

    bool operator < (const Edges & temp) const {
        return w > temp.w;
    }
} ed[N], e[N];
struct Q {
    int t, b, u, w;
} query[N];
int ec[N];
vector<T> line;
bool change[N];
int n, m;

int find_par(int u) {
    if(par[u] < 0) return u;
    return find_par(par[u]);
}

bool merge(int u, int v, int r) {
    u = find_par(u), v = find_par(v);
    if(u == v) return false;
    if(par[u] > par[v]) swap(u, v);
    if(!r) line.pb({u, v, par[u], par[v]});
    par[u] += par[v];
    par[v] = u;
    return true;
}
    
void RollBack() {
    while(line.size()) {
        int u = line.back().u, v = line.back().v;
        par[u] = line.back().pu;
        par[v] = line.back().pv;
        line.pop_back();
    }
}

void solsqrt(int L, int R) {
    sort(ed + 1, ed + 1 + m);
    for(int i = 1; i <= m; i++) change[i] = false;
    for(int i = 1; i <= n; i++) par[i] = -1;
    
    struct Data {
        int u, w, id;
    
        bool operator < (const Data & temp) const {
            return w > temp.w;
        }
    };
    vector<Data> q;

    for(int i = L; i <= R; i++) {
        if(query[i].t == 1) change[query[i].b] = true;
        else q.pb({query[i].u, query[i].w, i});
    }

    sort(all(q));
    int cnt = 0, cntc = 0;
    for(int i = 1; i <= m; i++) {
        if(!change[ed[i].id]) {
            e[++cnt] = ed[i];
        } else {
            ec[++cntc] = i;
        }
    }

    int iter = 1;
    for(auto x : q) {
        while(iter <= cnt && e[iter].w >= x.w) {
            merge(e[iter].u, e[iter].v, 1);
            ++iter;
        }

        for(int i = L; i <= x.id; i++) {
            if(query[i].t == 1) {
                weight[query[i].b] = query[i].w;
            }
        }

        for(int i = 1; i <= cntc; i++) {
            int w = (!weight[ed[ec[i]].id] ? ed[ec[i]].w : weight[ed[ec[i]].id]);
            if(w >= x.w) {
                merge(ed[ec[i]].u, ed[ec[i]].v, 0);
            }
        }

        ans[x.id] = -par[find_par(x.u)];
        RollBack();

        for(int i = L; i <= x.id; i++) {
            if(query[i].t == 1) {
                weight[query[i].b] = 0;
            }
        }
    }

    for(int i = L; i <= R; i++) {
        if(query[i].t == 1) {
            weight[query[i].b] = query[i].w;
        }
    }

    for(int i = 1; i <= m; i++) {
        if(weight[ed[i].id]) ed[i].w = weight[ed[i].id];
    }

    for(int i = L; i <= R; i++) {
        if(query[i].t == 1) {
            weight[query[i].b] = 0;
        }
    }
}

void solve() {
	cin >> n >> m;
	for(int i = 1; i <= m; i++) {
		int u, v, w; cin >> u >> v >> w;
		ed[i] = {u, v, w, i};
	}

	int q; cin >> q;
	for(int i = 1; i <= q; i++) {
		cin >> query[i].t;
		if(query[i].t == 1) cin >> query[i].b >> query[i].w;
		else cin >> query[i].u >> query[i].w;
	}

	int s = sqrt(q);
	for(int i = 1; i <= q; i += s) {
		solsqrt(i, min(i + s - 1, q));
	}

    for(int i = 1; i <= q; i++) {
        if(ans[i]) cout << ans[i] << '\n';        
    }
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int tc = 1, ddd = 0;
    // cin >> tc;
    while(tc--) {
        //ddd++;
        //cout << "Case #" << ddd << ": ";
        solve();
    }
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:217:17: warning: unused variable 'ddd' [-Wunused-variable]
  217 |     int tc = 1, ddd = 0;
      |                 ^~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 13 ms 736 KB Output is correct
4 Correct 5 ms 608 KB Output is correct
5 Correct 8 ms 724 KB Output is correct
6 Correct 8 ms 732 KB Output is correct
7 Correct 8 ms 604 KB Output is correct
8 Correct 9 ms 728 KB Output is correct
9 Correct 11 ms 628 KB Output is correct
10 Correct 10 ms 588 KB Output is correct
11 Correct 9 ms 704 KB Output is correct
12 Correct 12 ms 704 KB Output is correct
13 Correct 10 ms 736 KB Output is correct
14 Correct 10 ms 808 KB Output is correct
15 Correct 11 ms 732 KB Output is correct
16 Correct 10 ms 648 KB Output is correct
17 Correct 9 ms 604 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1352 ms 6556 KB Output is correct
2 Correct 1293 ms 6360 KB Output is correct
3 Correct 1371 ms 6476 KB Output is correct
4 Correct 1238 ms 6456 KB Output is correct
5 Correct 1312 ms 6608 KB Output is correct
6 Correct 1469 ms 6920 KB Output is correct
7 Correct 1433 ms 6616 KB Output is correct
8 Correct 1417 ms 6768 KB Output is correct
9 Correct 59 ms 3768 KB Output is correct
10 Correct 850 ms 6212 KB Output is correct
11 Correct 867 ms 6028 KB Output is correct
12 Correct 1080 ms 6752 KB Output is correct
13 Correct 1203 ms 6368 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 831 ms 5692 KB Output is correct
2 Correct 381 ms 4424 KB Output is correct
3 Correct 902 ms 5852 KB Output is correct
4 Correct 839 ms 5716 KB Output is correct
5 Correct 62 ms 3840 KB Output is correct
6 Correct 880 ms 5840 KB Output is correct
7 Correct 849 ms 5752 KB Output is correct
8 Correct 809 ms 5792 KB Output is correct
9 Correct 695 ms 5904 KB Output is correct
10 Correct 700 ms 6016 KB Output is correct
11 Correct 751 ms 5624 KB Output is correct
12 Correct 685 ms 5688 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1670 ms 7592 KB Output is correct
2 Correct 64 ms 3744 KB Output is correct
3 Correct 470 ms 5224 KB Output is correct
4 Correct 448 ms 5000 KB Output is correct
5 Correct 1495 ms 7448 KB Output is correct
6 Correct 1552 ms 7288 KB Output is correct
7 Correct 1539 ms 7300 KB Output is correct
8 Correct 672 ms 5388 KB Output is correct
9 Correct 646 ms 5704 KB Output is correct
10 Correct 668 ms 5644 KB Output is correct
11 Correct 1156 ms 6316 KB Output is correct
12 Correct 1073 ms 6272 KB Output is correct
13 Correct 1167 ms 6544 KB Output is correct
14 Correct 1529 ms 7348 KB Output is correct
15 Correct 1471 ms 7200 KB Output is correct
16 Correct 1617 ms 7256 KB Output is correct
17 Correct 1610 ms 7192 KB Output is correct
18 Correct 1591 ms 7024 KB Output is correct
19 Correct 1581 ms 7248 KB Output is correct
20 Correct 1342 ms 6688 KB Output is correct
21 Correct 1386 ms 7036 KB Output is correct
22 Correct 1588 ms 7188 KB Output is correct
23 Correct 1234 ms 6688 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1352 ms 6556 KB Output is correct
2 Correct 1293 ms 6360 KB Output is correct
3 Correct 1371 ms 6476 KB Output is correct
4 Correct 1238 ms 6456 KB Output is correct
5 Correct 1312 ms 6608 KB Output is correct
6 Correct 1469 ms 6920 KB Output is correct
7 Correct 1433 ms 6616 KB Output is correct
8 Correct 1417 ms 6768 KB Output is correct
9 Correct 59 ms 3768 KB Output is correct
10 Correct 850 ms 6212 KB Output is correct
11 Correct 867 ms 6028 KB Output is correct
12 Correct 1080 ms 6752 KB Output is correct
13 Correct 1203 ms 6368 KB Output is correct
14 Correct 831 ms 5692 KB Output is correct
15 Correct 381 ms 4424 KB Output is correct
16 Correct 902 ms 5852 KB Output is correct
17 Correct 839 ms 5716 KB Output is correct
18 Correct 62 ms 3840 KB Output is correct
19 Correct 880 ms 5840 KB Output is correct
20 Correct 849 ms 5752 KB Output is correct
21 Correct 809 ms 5792 KB Output is correct
22 Correct 695 ms 5904 KB Output is correct
23 Correct 700 ms 6016 KB Output is correct
24 Correct 751 ms 5624 KB Output is correct
25 Correct 685 ms 5688 KB Output is correct
26 Correct 1203 ms 5788 KB Output is correct
27 Correct 1320 ms 6048 KB Output is correct
28 Correct 1276 ms 5760 KB Output is correct
29 Correct 1128 ms 5924 KB Output is correct
30 Correct 1305 ms 5796 KB Output is correct
31 Correct 1298 ms 5788 KB Output is correct
32 Correct 1372 ms 5852 KB Output is correct
33 Correct 1203 ms 5816 KB Output is correct
34 Correct 1272 ms 5808 KB Output is correct
35 Correct 1239 ms 5840 KB Output is correct
36 Correct 1104 ms 5852 KB Output is correct
37 Correct 1104 ms 5796 KB Output is correct
38 Correct 1095 ms 5856 KB Output is correct
39 Correct 997 ms 6036 KB Output is correct
40 Correct 988 ms 5984 KB Output is correct
41 Correct 990 ms 5972 KB Output is correct
42 Correct 985 ms 5776 KB Output is correct
43 Correct 969 ms 5740 KB Output is correct
44 Correct 968 ms 5696 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 13 ms 736 KB Output is correct
4 Correct 5 ms 608 KB Output is correct
5 Correct 8 ms 724 KB Output is correct
6 Correct 8 ms 732 KB Output is correct
7 Correct 8 ms 604 KB Output is correct
8 Correct 9 ms 728 KB Output is correct
9 Correct 11 ms 628 KB Output is correct
10 Correct 10 ms 588 KB Output is correct
11 Correct 9 ms 704 KB Output is correct
12 Correct 12 ms 704 KB Output is correct
13 Correct 10 ms 736 KB Output is correct
14 Correct 10 ms 808 KB Output is correct
15 Correct 11 ms 732 KB Output is correct
16 Correct 10 ms 648 KB Output is correct
17 Correct 9 ms 604 KB Output is correct
18 Correct 1352 ms 6556 KB Output is correct
19 Correct 1293 ms 6360 KB Output is correct
20 Correct 1371 ms 6476 KB Output is correct
21 Correct 1238 ms 6456 KB Output is correct
22 Correct 1312 ms 6608 KB Output is correct
23 Correct 1469 ms 6920 KB Output is correct
24 Correct 1433 ms 6616 KB Output is correct
25 Correct 1417 ms 6768 KB Output is correct
26 Correct 59 ms 3768 KB Output is correct
27 Correct 850 ms 6212 KB Output is correct
28 Correct 867 ms 6028 KB Output is correct
29 Correct 1080 ms 6752 KB Output is correct
30 Correct 1203 ms 6368 KB Output is correct
31 Correct 831 ms 5692 KB Output is correct
32 Correct 381 ms 4424 KB Output is correct
33 Correct 902 ms 5852 KB Output is correct
34 Correct 839 ms 5716 KB Output is correct
35 Correct 62 ms 3840 KB Output is correct
36 Correct 880 ms 5840 KB Output is correct
37 Correct 849 ms 5752 KB Output is correct
38 Correct 809 ms 5792 KB Output is correct
39 Correct 695 ms 5904 KB Output is correct
40 Correct 700 ms 6016 KB Output is correct
41 Correct 751 ms 5624 KB Output is correct
42 Correct 685 ms 5688 KB Output is correct
43 Correct 1670 ms 7592 KB Output is correct
44 Correct 64 ms 3744 KB Output is correct
45 Correct 470 ms 5224 KB Output is correct
46 Correct 448 ms 5000 KB Output is correct
47 Correct 1495 ms 7448 KB Output is correct
48 Correct 1552 ms 7288 KB Output is correct
49 Correct 1539 ms 7300 KB Output is correct
50 Correct 672 ms 5388 KB Output is correct
51 Correct 646 ms 5704 KB Output is correct
52 Correct 668 ms 5644 KB Output is correct
53 Correct 1156 ms 6316 KB Output is correct
54 Correct 1073 ms 6272 KB Output is correct
55 Correct 1167 ms 6544 KB Output is correct
56 Correct 1529 ms 7348 KB Output is correct
57 Correct 1471 ms 7200 KB Output is correct
58 Correct 1617 ms 7256 KB Output is correct
59 Correct 1610 ms 7192 KB Output is correct
60 Correct 1591 ms 7024 KB Output is correct
61 Correct 1581 ms 7248 KB Output is correct
62 Correct 1342 ms 6688 KB Output is correct
63 Correct 1386 ms 7036 KB Output is correct
64 Correct 1588 ms 7188 KB Output is correct
65 Correct 1234 ms 6688 KB Output is correct
66 Correct 1203 ms 5788 KB Output is correct
67 Correct 1320 ms 6048 KB Output is correct
68 Correct 1276 ms 5760 KB Output is correct
69 Correct 1128 ms 5924 KB Output is correct
70 Correct 1305 ms 5796 KB Output is correct
71 Correct 1298 ms 5788 KB Output is correct
72 Correct 1372 ms 5852 KB Output is correct
73 Correct 1203 ms 5816 KB Output is correct
74 Correct 1272 ms 5808 KB Output is correct
75 Correct 1239 ms 5840 KB Output is correct
76 Correct 1104 ms 5852 KB Output is correct
77 Correct 1104 ms 5796 KB Output is correct
78 Correct 1095 ms 5856 KB Output is correct
79 Correct 997 ms 6036 KB Output is correct
80 Correct 988 ms 5984 KB Output is correct
81 Correct 990 ms 5972 KB Output is correct
82 Correct 985 ms 5776 KB Output is correct
83 Correct 969 ms 5740 KB Output is correct
84 Correct 968 ms 5696 KB Output is correct
85 Correct 2522 ms 7192 KB Output is correct
86 Correct 720 ms 4904 KB Output is correct
87 Correct 433 ms 5036 KB Output is correct
88 Correct 1714 ms 7092 KB Output is correct
89 Correct 2732 ms 6972 KB Output is correct
90 Correct 1901 ms 8460 KB Output is correct
91 Correct 1284 ms 7076 KB Output is correct
92 Correct 1298 ms 7256 KB Output is correct
93 Correct 1475 ms 7144 KB Output is correct
94 Correct 2125 ms 8520 KB Output is correct
95 Correct 1974 ms 8884 KB Output is correct
96 Correct 2096 ms 8668 KB Output is correct
97 Correct 1629 ms 8576 KB Output is correct
98 Correct 1609 ms 8172 KB Output is correct
99 Correct 2761 ms 9660 KB Output is correct
100 Correct 2745 ms 9964 KB Output is correct
101 Correct 2769 ms 9676 KB Output is correct
102 Correct 2762 ms 9856 KB Output is correct
103 Correct 2353 ms 8892 KB Output is correct
104 Correct 2201 ms 8868 KB Output is correct
105 Correct 2050 ms 8736 KB Output is correct
106 Correct 1711 ms 8492 KB Output is correct
107 Correct 1859 ms 9172 KB Output is correct
108 Correct 2405 ms 9444 KB Output is correct
109 Correct 1479 ms 7572 KB Output is correct