oj.uz

답안 #521832

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
521832 2022-02-03T09:23:33 Z XEMPLI5 다리 (APIO19_bridges) C++17
100 / 100
 2068 ms 158872 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define gc getchar_unlocked
#define fo(i, n) for (int i = 0; i < n; i++)
#define rfo(i, n) for (int i = n - 1; i >= 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define RREP(i, a, b) for (int i = a; i >= b; i--)
#define ll long long
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define pi(x) printf("%d\n", x)
#define pl(x) printf("%lld\n", x)
#define ps(s) printf("%s\n", s)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define deb3(x, y, z) cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
 
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
 
int mpow(int base, int exp);
void dfs(int u, int par);
 
const int mod = 1'000'000'007;
const int N = 3e5, M = N;
 
vi g[N];
int a[N], ans[N];
vi par, sz;
int n = 0;
 
stack<int> stck;
void reset()
{
    fo(i, n)
    {
        par[i] = i;
        sz[i] = 1;
    }
}
 
int find(int a)
{
    while (a != par[a])
    {
        a = par[a];
    }
    return a;
}
 
void onion(int a, int b)
{
    a = find(a);
    b = find(b);
    if (a == b)
        return;
    if (sz[a] > sz[b])
        swap(a, b);
    stck.push(a);
    sz[b] += sz[a];
    par[a] = par[b];
}
 
void rollback(int siz)
{
    while (stck.size() > siz)
    {
        int k = stck.top();
        stck.pop();
        sz[par[k]] -= sz[k];
        par[k] = k;
    }
}
 
void solve()
{
    int m, q;
    cin >> n >> m;
    vi u(m), v(m), d(m);
    fo(i, m)
    {
        cin >> u[i] >> v[i] >> d[i];
        u[i]--;
        v[i]--;
    }
    cin >> q;
    vi b(q), r(q), s(q), w(q), ty(q);
    fo(i, q)
    {
        int t;
        cin >> t;
        if (t == 1)
        {
            cin >> b[i] >> r[i];
            b[i]--;
            ty[i] = 1;
        }
        else
        {
            cin >> s[i] >> w[i];
            s[i]--;
            ty[i] = 2;
        }
    }
    par.resize(n);
    sz.resize(n);
    vvi tojoin(q);
    vi ans(q);
    int bs = 1000;
    vi changed(m);
    for (int j = 0; j < q; j += bs)
    {
        reset();
        vi ask, update, nochange;
        fo(i, m) changed[i] = false;
        for (int i = j; i < min(j + bs, q); i++)
        {
            if (ty[i] == 1)
            {
                changed[b[i]] = true;
                update.pb(i);
            }
            else
            {
                ask.pb(i);
            }
        }
        fo(k, m) if (!changed[k]) nochange.pb(k);
        for (int i = j; i < min(j + bs, q); i++)
        {
            if (ty[i] == 1)
            {
                d[b[i]] = r[i];
            }
            else
            {
                tojoin[i].clear();
                for (auto e : update)
                    if (d[b[e]] >= w[i])
                        tojoin[i].pb(b[e]);
            }
        }
        sort(all(ask), [&](int a, int b)
             { return w[a] > w[b]; });
        sort(all(nochange), [&](int a, int b)
             { return d[a] > d[b]; });
        int ptr = 0;
        for (auto e : ask)
        {
            while (ptr < nochange.size() && d[nochange[ptr]] >= w[e])
            {
                onion(u[nochange[ptr]], v[nochange[ptr]]);
                ptr++;
            }
            int prv = stck.size();
            for (auto f : tojoin[e])
                onion(u[f], v[f]);
            ans[e] = sz[find(s[e])];
            rollback(prv);
        }
    }
    fo(i, q) if (ty[i] == 2) cout << ans[i] << '\n';
    return;
}
 
int main()
{
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    srand(chrono::high_resolution_clock::now().time_since_epoch().count());
 
    int t = 1;
    int cs = 0;
    while (t - cs)
    {
        solve();
        cs++;
    }
 
    return 0;
}
 
int mpow(int base, int exp)
{
    base %= mod;
    int result = 1;
    while (exp > 0)
    {
        if (exp & 1)
            result = ((ll)result * base) % mod;
        base = ((ll)base * base) % mod;
        exp >>= 1;
    }
    return result;
}
 
void ipgraph(int n, int m)
{
    int u, v;
    while (m--)
    {
        cin >> u >> v;
        u--, v--;
        g[u].pb(v);
        g[v].pb(u);
    }
}
 
void dfs(int u, int par)
{
    for (int v : g[u])
    {
        if (v == par)
            continue;
        dfs(v, u);
    }
}

Compilation message

bridges.cpp: In function 'void rollback(int)':
bridges.cpp:83:24: warning: comparison of integer expressions of different signedness: 'std::stack<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   83 |     while (stck.size() > siz)
      |            ~~~~~~~~~~~~^~~~~
bridges.cpp: In function 'void solve()':
bridges.cpp:167:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  167 |             while (ptr < nochange.size() && d[nochange[ptr]] >= w[e])
      |                    ~~~~^~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7244 KB Output is correct
2 Correct 4 ms 7360 KB Output is correct
3 Correct 41 ms 14532 KB Output is correct
4 Correct 7 ms 7884 KB Output is correct
5 Correct 42 ms 15300 KB Output is correct
6 Correct 33 ms 15440 KB Output is correct
7 Correct 38 ms 15428 KB Output is correct
8 Correct 42 ms 13840 KB Output is correct
9 Correct 53 ms 19908 KB Output is correct
10 Correct 43 ms 14672 KB Output is correct
11 Correct 43 ms 14532 KB Output is correct
12 Correct 51 ms 16964 KB Output is correct
13 Correct 49 ms 15172 KB Output is correct
14 Correct 45 ms 14276 KB Output is correct
15 Correct 54 ms 15152 KB Output is correct
16 Correct 47 ms 18032 KB Output is correct
17 Correct 46 ms 17056 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1290 ms 100904 KB Output is correct
2 Correct 1301 ms 100812 KB Output is correct
3 Correct 1304 ms 101196 KB Output is correct
4 Correct 1354 ms 100752 KB Output is correct
5 Correct 1347 ms 101296 KB Output is correct
6 Correct 1911 ms 158872 KB Output is correct
7 Correct 1918 ms 155528 KB Output is correct
8 Correct 1902 ms 155268 KB Output is correct
9 Correct 37 ms 12352 KB Output is correct
10 Correct 1096 ms 126736 KB Output is correct
11 Correct 1025 ms 125796 KB Output is correct
12 Correct 1104 ms 81064 KB Output is correct
13 Correct 1105 ms 73892 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1074 ms 93900 KB Output is correct
2 Correct 851 ms 108976 KB Output is correct
3 Correct 1290 ms 121956 KB Output is correct
4 Correct 1066 ms 93408 KB Output is correct
5 Correct 38 ms 12356 KB Output is correct
6 Correct 1249 ms 113248 KB Output is correct
7 Correct 997 ms 85472 KB Output is correct
8 Correct 852 ms 69528 KB Output is correct
9 Correct 705 ms 61592 KB Output is correct
10 Correct 626 ms 50076 KB Output is correct
11 Correct 727 ms 58820 KB Output is correct
12 Correct 633 ms 48552 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1432 ms 35596 KB Output is correct
2 Correct 37 ms 12396 KB Output is correct
3 Correct 154 ms 10692 KB Output is correct
4 Correct 72 ms 10532 KB Output is correct
5 Correct 694 ms 35636 KB Output is correct
6 Correct 1368 ms 35520 KB Output is correct
7 Correct 687 ms 35524 KB Output is correct
8 Correct 681 ms 34324 KB Output is correct
9 Correct 705 ms 34476 KB Output is correct
10 Correct 680 ms 34476 KB Output is correct
11 Correct 1049 ms 35328 KB Output is correct
12 Correct 1029 ms 35432 KB Output is correct
13 Correct 1071 ms 35552 KB Output is correct
14 Correct 623 ms 35580 KB Output is correct
15 Correct 664 ms 35572 KB Output is correct
16 Correct 1389 ms 35840 KB Output is correct
17 Correct 1426 ms 35696 KB Output is correct
18 Correct 1398 ms 35888 KB Output is correct
19 Correct 1386 ms 35968 KB Output is correct
20 Correct 1181 ms 35736 KB Output is correct
21 Correct 1166 ms 35764 KB Output is correct
22 Correct 1339 ms 35372 KB Output is correct
23 Correct 785 ms 33420 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1290 ms 100904 KB Output is correct
2 Correct 1301 ms 100812 KB Output is correct
3 Correct 1304 ms 101196 KB Output is correct
4 Correct 1354 ms 100752 KB Output is correct
5 Correct 1347 ms 101296 KB Output is correct
6 Correct 1911 ms 158872 KB Output is correct
7 Correct 1918 ms 155528 KB Output is correct
8 Correct 1902 ms 155268 KB Output is correct
9 Correct 37 ms 12352 KB Output is correct
10 Correct 1096 ms 126736 KB Output is correct
11 Correct 1025 ms 125796 KB Output is correct
12 Correct 1104 ms 81064 KB Output is correct
13 Correct 1105 ms 73892 KB Output is correct
14 Correct 1074 ms 93900 KB Output is correct
15 Correct 851 ms 108976 KB Output is correct
16 Correct 1290 ms 121956 KB Output is correct
17 Correct 1066 ms 93408 KB Output is correct
18 Correct 38 ms 12356 KB Output is correct
19 Correct 1249 ms 113248 KB Output is correct
20 Correct 997 ms 85472 KB Output is correct
21 Correct 852 ms 69528 KB Output is correct
22 Correct 705 ms 61592 KB Output is correct
23 Correct 626 ms 50076 KB Output is correct
24 Correct 727 ms 58820 KB Output is correct
25 Correct 633 ms 48552 KB Output is correct
26 Correct 1382 ms 101056 KB Output is correct
27 Correct 1694 ms 130292 KB Output is correct
28 Correct 1386 ms 99280 KB Output is correct
29 Correct 950 ms 56296 KB Output is correct
30 Correct 1562 ms 116784 KB Output is correct
31 Correct 1597 ms 119292 KB Output is correct
32 Correct 1612 ms 119716 KB Output is correct
33 Correct 1375 ms 99552 KB Output is correct
34 Correct 1381 ms 99668 KB Output is correct
35 Correct 1382 ms 99976 KB Output is correct
36 Correct 1039 ms 63272 KB Output is correct
37 Correct 1020 ms 62048 KB Output is correct
38 Correct 992 ms 60520 KB Output is correct
39 Correct 810 ms 46660 KB Output is correct
40 Correct 807 ms 45860 KB Output is correct
41 Correct 800 ms 45340 KB Output is correct
42 Correct 794 ms 44144 KB Output is correct
43 Correct 782 ms 43524 KB Output is correct
44 Correct 766 ms 42888 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7244 KB Output is correct
2 Correct 4 ms 7360 KB Output is correct
3 Correct 41 ms 14532 KB Output is correct
4 Correct 7 ms 7884 KB Output is correct
5 Correct 42 ms 15300 KB Output is correct
6 Correct 33 ms 15440 KB Output is correct
7 Correct 38 ms 15428 KB Output is correct
8 Correct 42 ms 13840 KB Output is correct
9 Correct 53 ms 19908 KB Output is correct
10 Correct 43 ms 14672 KB Output is correct
11 Correct 43 ms 14532 KB Output is correct
12 Correct 51 ms 16964 KB Output is correct
13 Correct 49 ms 15172 KB Output is correct
14 Correct 45 ms 14276 KB Output is correct
15 Correct 54 ms 15152 KB Output is correct
16 Correct 47 ms 18032 KB Output is correct
17 Correct 46 ms 17056 KB Output is correct
18 Correct 1290 ms 100904 KB Output is correct
19 Correct 1301 ms 100812 KB Output is correct
20 Correct 1304 ms 101196 KB Output is correct
21 Correct 1354 ms 100752 KB Output is correct
22 Correct 1347 ms 101296 KB Output is correct
23 Correct 1911 ms 158872 KB Output is correct
24 Correct 1918 ms 155528 KB Output is correct
25 Correct 1902 ms 155268 KB Output is correct
26 Correct 37 ms 12352 KB Output is correct
27 Correct 1096 ms 126736 KB Output is correct
28 Correct 1025 ms 125796 KB Output is correct
29 Correct 1104 ms 81064 KB Output is correct
30 Correct 1105 ms 73892 KB Output is correct
31 Correct 1074 ms 93900 KB Output is correct
32 Correct 851 ms 108976 KB Output is correct
33 Correct 1290 ms 121956 KB Output is correct
34 Correct 1066 ms 93408 KB Output is correct
35 Correct 38 ms 12356 KB Output is correct
36 Correct 1249 ms 113248 KB Output is correct
37 Correct 997 ms 85472 KB Output is correct
38 Correct 852 ms 69528 KB Output is correct
39 Correct 705 ms 61592 KB Output is correct
40 Correct 626 ms 50076 KB Output is correct
41 Correct 727 ms 58820 KB Output is correct
42 Correct 633 ms 48552 KB Output is correct
43 Correct 1432 ms 35596 KB Output is correct
44 Correct 37 ms 12396 KB Output is correct
45 Correct 154 ms 10692 KB Output is correct
46 Correct 72 ms 10532 KB Output is correct
47 Correct 694 ms 35636 KB Output is correct
48 Correct 1368 ms 35520 KB Output is correct
49 Correct 687 ms 35524 KB Output is correct
50 Correct 681 ms 34324 KB Output is correct
51 Correct 705 ms 34476 KB Output is correct
52 Correct 680 ms 34476 KB Output is correct
53 Correct 1049 ms 35328 KB Output is correct
54 Correct 1029 ms 35432 KB Output is correct
55 Correct 1071 ms 35552 KB Output is correct
56 Correct 623 ms 35580 KB Output is correct
57 Correct 664 ms 35572 KB Output is correct
58 Correct 1389 ms 35840 KB Output is correct
59 Correct 1426 ms 35696 KB Output is correct
60 Correct 1398 ms 35888 KB Output is correct
61 Correct 1386 ms 35968 KB Output is correct
62 Correct 1181 ms 35736 KB Output is correct
63 Correct 1166 ms 35764 KB Output is correct
64 Correct 1339 ms 35372 KB Output is correct
65 Correct 785 ms 33420 KB Output is correct
66 Correct 1382 ms 101056 KB Output is correct
67 Correct 1694 ms 130292 KB Output is correct
68 Correct 1386 ms 99280 KB Output is correct
69 Correct 950 ms 56296 KB Output is correct
70 Correct 1562 ms 116784 KB Output is correct
71 Correct 1597 ms 119292 KB Output is correct
72 Correct 1612 ms 119716 KB Output is correct
73 Correct 1375 ms 99552 KB Output is correct
74 Correct 1381 ms 99668 KB Output is correct
75 Correct 1382 ms 99976 KB Output is correct
76 Correct 1039 ms 63272 KB Output is correct
77 Correct 1020 ms 62048 KB Output is correct
78 Correct 992 ms 60520 KB Output is correct
79 Correct 810 ms 46660 KB Output is correct
80 Correct 807 ms 45860 KB Output is correct
81 Correct 800 ms 45340 KB Output is correct
82 Correct 794 ms 44144 KB Output is correct
83 Correct 782 ms 43524 KB Output is correct
84 Correct 766 ms 42888 KB Output is correct
85 Correct 1923 ms 102068 KB Output is correct
86 Correct 181 ms 16668 KB Output is correct
87 Correct 119 ms 20996 KB Output is correct
88 Correct 1169 ms 115512 KB Output is correct
89 Correct 1863 ms 100708 KB Output is correct
90 Correct 1168 ms 124288 KB Output is correct
91 Correct 1414 ms 100864 KB Output is correct
92 Correct 1393 ms 100788 KB Output is correct
93 Correct 1990 ms 138532 KB Output is correct
94 Correct 1646 ms 101864 KB Output is correct
95 Correct 1604 ms 101572 KB Output is correct
96 Correct 1904 ms 142628 KB Output is correct
97 Correct 855 ms 68192 KB Output is correct
98 Correct 895 ms 64896 KB Output is correct
99 Correct 1898 ms 103228 KB Output is correct
100 Correct 1881 ms 102048 KB Output is correct
101 Correct 1930 ms 102156 KB Output is correct
102 Correct 1928 ms 102272 KB Output is correct
103 Correct 2068 ms 147788 KB Output is correct
104 Correct 2047 ms 147424 KB Output is correct
105 Correct 1530 ms 75040 KB Output is correct
106 Correct 1234 ms 55212 KB Output is correct
107 Correct 1426 ms 81776 KB Output is correct
108 Correct 1957 ms 137008 KB Output is correct
109 Correct 1397 ms 140320 KB Output is correct