oj.uz

Submission #124657

# Submission time Handle Problem Language Result Execution time Memory
124657 2019-07-03T16:39:53 Z Benq Bridges (APIO19_bridges) C++14
100 / 100
 2170 ms 12324 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 200005;
const ld PI = 4*atan((ld)1);

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) { 
        re(first); re(rest...); 
    }

    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) { 
        pr(first); pr(rest...); 
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    void ps() { pr("\n"); }
    template<class Arg> void ps(const Arg& first) { 
        pr(first); ps(); // no space at end of line
    }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) { 
        pr(first," "); ps(rest...); // print w/ spaces
    }
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

template<class T> T invGeneral(T a, T b) {
    a %= b; if (a == 0) return b == 1 ? 0 : -1;
    T x = invGeneral(b,a); 
    return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}

template<class T> struct modular {
    T val; 
    explicit operator T() const { return val; }
    modular() { val = 0; }
    template<class U> modular(const U& v) {
        val = (-MOD <= v && v <= MOD) ? v : v % MOD;
        if (val < 0) val += MOD;
    }
    friend ostream& operator<<(ostream& os, const modular& a) { return os << a.val; }
    friend bool operator==(const modular& a, const modular& b) { return a.val == b.val; }
    friend bool operator!=(const modular& a, const modular& b) { return !(a == b); }

    modular operator-() const { return modular(-val); }
    modular& operator+=(const modular& m) { if ((val += m.val) >= MOD) val -= MOD; return *this; }
    modular& operator-=(const modular& m) { if ((val -= m.val) < 0) val += MOD; return *this; }
    modular& operator*=(const modular& m) { val = (ll)val*m.val%MOD; return *this; }
    friend modular exp(modular a, ll p) {
        modular ans = 1; for (; p; p /= 2, a *= a) if (p&1) ans *= a;
        return ans;
    }
    friend modular inv(const modular& a) { 
        auto i = invGeneral(a.val,MOD); assert(i != -1);
        return i;
    } // equivalent to return exp(b,MOD-2) if MOD is prime
    modular& operator/=(const modular& m) { return (*this) *= inv(m); }
    
    friend modular operator+(modular a, const modular& b) { return a += b; }
    friend modular operator-(modular a, const modular& b) { return a -= b; }
    friend modular operator*(modular a, const modular& b) { return a *= b; }
    
    friend modular operator/(modular a, const modular& b) { return a /= b; }
};

typedef modular<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;

const int BLOCK = 500;

struct DSU {
    int sz[50001], par[50001];
    void init() {
        FOR(i,1,50001) sz[i] = 1, par[i] = i;
    }
    int get(int x) {
        return par[x]==x?x:par[x]=get(par[x]);
    }
    void unite(int a, int b) {
        a = get(a), b = get(b);
        if (a == b) return;
        if (sz[a] < sz[b]) swap(a,b);
        par[b] = a; sz[a] += sz[b];
    }
};

DSU D;
int n,m,q,w[100000],st[100000];
pi ed[100000];
vi adj[50001];
vector<array<int,4>> ev;
vector<array<int,3>> query;
vi del;
int vis[50001],ans[100000];

void process(int x) {
    D.unite(ed[x].f,ed[x].s);
}

void addEdge(int x) {
    int a = D.get(ed[x].f), b = D.get(ed[x].s);
    adj[a].pb(b), adj[b].pb(a); del.pb(a), del.pb(b);
}

int tmp, tot;

void dfs(int x) {
    vis[x] = tmp; tot += D.sz[x];
    trav(t,adj[x]) if (vis[t] != tmp) dfs(t);
}

void solve(int lo, int hi) {
    D.init();
    vector<array<int,3>> qt, bad;
    while (sz(query) && query.back()[1] <= hi) {
        qt.pb(query.back()); query.pop_back();
    }
    // ps(ev); 
    sort(all(qt));
    int ind = 0;
    while (sz(qt)) {
        int w = qt.back()[0], i = qt.back()[1], s = qt.back()[2]; qt.pop_back();
        for (;ind < sz(ev) && ev[ind][0] >= w; ind++) {
            if (hi < ev[ind][2] || ev[ind][3] < lo) continue;
            if (ev[ind][2] <= lo && hi <= ev[ind][3]) process(ev[ind][1]);
            else bad.pb({ev[ind][1],ev[ind][2],ev[ind][3]});
        }
        trav(z,bad) if (z[1] <= i && i <= z[2]) addEdge(z[0]);
        tmp ++; tot = 0;
        dfs(D.get(s)); ans[i] = tot;
        trav(t,del) adj[t].clear();
        del.clear();
    }
}

int main() {
    setIO(); re(n,m);
    F0R(i,m) re(ed[i],w[i]);
    re(q);
    F0R(i,q) {
        ans[i] = -1;
        int t; re(t);
        if (t == 1) {
            int b,r; re(b,r); b--;
            ev.pb({w[b],b,st[b],i}); 
            w[b] = r; st[b] = i+1;
        } else {
            int s,w; re(s,w);
            query.pb({w,i,s});
        }
    }
    F0R(b,m) ev.pb({w[b],b,st[b],q-1}); 
    sort(all(ev)); reverse(all(ev)); reverse(all(query));
    for (int lo = 0; lo < q; lo += BLOCK) solve(lo,min(lo+BLOCK,q)-1);
    F0R(i,q) if (ans[i] != -1) ps(ans[i]);
}


/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?), set tle
    * do smth instead of nothing and stay organized
*/

Compilation message

bridges.cpp: In function 'void io::setIn(std::__cxx11::string)':
bridges.cpp:113:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
bridges.cpp: In function 'void io::setOut(std::__cxx11::string)':
bridges.cpp:114:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1912 KB Output is correct
2 Correct 4 ms 1912 KB Output is correct
3 Correct 38 ms 2424 KB Output is correct
4 Correct 10 ms 2360 KB Output is correct
5 Correct 24 ms 2424 KB Output is correct
6 Correct 21 ms 2424 KB Output is correct
7 Correct 25 ms 2424 KB Output is correct
8 Correct 22 ms 2424 KB Output is correct
9 Correct 34 ms 2424 KB Output is correct
10 Correct 25 ms 2392 KB Output is correct
11 Correct 22 ms 2296 KB Output is correct
12 Correct 25 ms 2424 KB Output is correct
13 Correct 29 ms 2512 KB Output is correct
14 Correct 26 ms 2428 KB Output is correct
15 Correct 25 ms 2424 KB Output is correct
16 Correct 27 ms 2428 KB Output is correct
17 Correct 26 ms 2296 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1391 ms 7464 KB Output is correct
2 Correct 1336 ms 7340 KB Output is correct
3 Correct 1375 ms 7244 KB Output is correct
4 Correct 1312 ms 7240 KB Output is correct
5 Correct 1288 ms 7356 KB Output is correct
6 Correct 1878 ms 6300 KB Output is correct
7 Correct 1794 ms 8788 KB Output is correct
8 Correct 1741 ms 8800 KB Output is correct
9 Correct 64 ms 5248 KB Output is correct
10 Correct 1112 ms 8724 KB Output is correct
11 Correct 1060 ms 8692 KB Output is correct
12 Correct 924 ms 9356 KB Output is correct
13 Correct 1266 ms 9852 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1081 ms 6184 KB Output is correct
2 Correct 762 ms 4788 KB Output is correct
3 Correct 1150 ms 6228 KB Output is correct
4 Correct 1022 ms 6096 KB Output is correct
5 Correct 64 ms 4072 KB Output is correct
6 Correct 1074 ms 6036 KB Output is correct
7 Correct 903 ms 6256 KB Output is correct
8 Correct 810 ms 6184 KB Output is correct
9 Correct 596 ms 6152 KB Output is correct
10 Correct 528 ms 6036 KB Output is correct
11 Correct 821 ms 6272 KB Output is correct
12 Correct 743 ms 6336 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1264 ms 7984 KB Output is correct
2 Correct 64 ms 3944 KB Output is correct
3 Correct 120 ms 5164 KB Output is correct
4 Correct 83 ms 5164 KB Output is correct
5 Correct 929 ms 8104 KB Output is correct
6 Correct 1239 ms 8064 KB Output is correct
7 Correct 915 ms 8000 KB Output is correct
8 Correct 786 ms 6380 KB Output is correct
9 Correct 771 ms 6428 KB Output is correct
10 Correct 783 ms 6504 KB Output is correct
11 Correct 1160 ms 7236 KB Output is correct
12 Correct 1130 ms 7192 KB Output is correct
13 Correct 1169 ms 7368 KB Output is correct
14 Correct 808 ms 8168 KB Output is correct
15 Correct 902 ms 8160 KB Output is correct
16 Correct 1426 ms 8044 KB Output is correct
17 Correct 1429 ms 7956 KB Output is correct
18 Correct 1342 ms 8044 KB Output is correct
19 Correct 1375 ms 8032 KB Output is correct
20 Correct 1298 ms 7804 KB Output is correct
21 Correct 1276 ms 7648 KB Output is correct
22 Correct 1320 ms 7972 KB Output is correct
23 Correct 1069 ms 7532 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1391 ms 7464 KB Output is correct
2 Correct 1336 ms 7340 KB Output is correct
3 Correct 1375 ms 7244 KB Output is correct
4 Correct 1312 ms 7240 KB Output is correct
5 Correct 1288 ms 7356 KB Output is correct
6 Correct 1878 ms 6300 KB Output is correct
7 Correct 1794 ms 8788 KB Output is correct
8 Correct 1741 ms 8800 KB Output is correct
9 Correct 64 ms 5248 KB Output is correct
10 Correct 1112 ms 8724 KB Output is correct
11 Correct 1060 ms 8692 KB Output is correct
12 Correct 924 ms 9356 KB Output is correct
13 Correct 1266 ms 9852 KB Output is correct
14 Correct 1081 ms 6184 KB Output is correct
15 Correct 762 ms 4788 KB Output is correct
16 Correct 1150 ms 6228 KB Output is correct
17 Correct 1022 ms 6096 KB Output is correct
18 Correct 64 ms 4072 KB Output is correct
19 Correct 1074 ms 6036 KB Output is correct
20 Correct 903 ms 6256 KB Output is correct
21 Correct 810 ms 6184 KB Output is correct
22 Correct 596 ms 6152 KB Output is correct
23 Correct 528 ms 6036 KB Output is correct
24 Correct 821 ms 6272 KB Output is correct
25 Correct 743 ms 6336 KB Output is correct
26 Correct 1361 ms 9588 KB Output is correct
27 Correct 1690 ms 9540 KB Output is correct
28 Correct 1499 ms 9736 KB Output is correct
29 Correct 1160 ms 9844 KB Output is correct
30 Correct 1766 ms 9664 KB Output is correct
31 Correct 1800 ms 9736 KB Output is correct
32 Correct 1754 ms 9736 KB Output is correct
33 Correct 1576 ms 9728 KB Output is correct
34 Correct 1510 ms 9712 KB Output is correct
35 Correct 1547 ms 9836 KB Output is correct
36 Correct 1227 ms 9648 KB Output is correct
37 Correct 1255 ms 9804 KB Output is correct
38 Correct 1222 ms 9692 KB Output is correct
39 Correct 893 ms 9196 KB Output is correct
40 Correct 893 ms 9236 KB Output is correct
41 Correct 875 ms 9324 KB Output is correct
42 Correct 1084 ms 9976 KB Output is correct
43 Correct 1073 ms 9976 KB Output is correct
44 Correct 1097 ms 9908 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1912 KB Output is correct
2 Correct 4 ms 1912 KB Output is correct
3 Correct 38 ms 2424 KB Output is correct
4 Correct 10 ms 2360 KB Output is correct
5 Correct 24 ms 2424 KB Output is correct
6 Correct 21 ms 2424 KB Output is correct
7 Correct 25 ms 2424 KB Output is correct
8 Correct 22 ms 2424 KB Output is correct
9 Correct 34 ms 2424 KB Output is correct
10 Correct 25 ms 2392 KB Output is correct
11 Correct 22 ms 2296 KB Output is correct
12 Correct 25 ms 2424 KB Output is correct
13 Correct 29 ms 2512 KB Output is correct
14 Correct 26 ms 2428 KB Output is correct
15 Correct 25 ms 2424 KB Output is correct
16 Correct 27 ms 2428 KB Output is correct
17 Correct 26 ms 2296 KB Output is correct
18 Correct 1391 ms 7464 KB Output is correct
19 Correct 1336 ms 7340 KB Output is correct
20 Correct 1375 ms 7244 KB Output is correct
21 Correct 1312 ms 7240 KB Output is correct
22 Correct 1288 ms 7356 KB Output is correct
23 Correct 1878 ms 6300 KB Output is correct
24 Correct 1794 ms 8788 KB Output is correct
25 Correct 1741 ms 8800 KB Output is correct
26 Correct 64 ms 5248 KB Output is correct
27 Correct 1112 ms 8724 KB Output is correct
28 Correct 1060 ms 8692 KB Output is correct
29 Correct 924 ms 9356 KB Output is correct
30 Correct 1266 ms 9852 KB Output is correct
31 Correct 1081 ms 6184 KB Output is correct
32 Correct 762 ms 4788 KB Output is correct
33 Correct 1150 ms 6228 KB Output is correct
34 Correct 1022 ms 6096 KB Output is correct
35 Correct 64 ms 4072 KB Output is correct
36 Correct 1074 ms 6036 KB Output is correct
37 Correct 903 ms 6256 KB Output is correct
38 Correct 810 ms 6184 KB Output is correct
39 Correct 596 ms 6152 KB Output is correct
40 Correct 528 ms 6036 KB Output is correct
41 Correct 821 ms 6272 KB Output is correct
42 Correct 743 ms 6336 KB Output is correct
43 Correct 1264 ms 7984 KB Output is correct
44 Correct 64 ms 3944 KB Output is correct
45 Correct 120 ms 5164 KB Output is correct
46 Correct 83 ms 5164 KB Output is correct
47 Correct 929 ms 8104 KB Output is correct
48 Correct 1239 ms 8064 KB Output is correct
49 Correct 915 ms 8000 KB Output is correct
50 Correct 786 ms 6380 KB Output is correct
51 Correct 771 ms 6428 KB Output is correct
52 Correct 783 ms 6504 KB Output is correct
53 Correct 1160 ms 7236 KB Output is correct
54 Correct 1130 ms 7192 KB Output is correct
55 Correct 1169 ms 7368 KB Output is correct
56 Correct 808 ms 8168 KB Output is correct
57 Correct 902 ms 8160 KB Output is correct
58 Correct 1426 ms 8044 KB Output is correct
59 Correct 1429 ms 7956 KB Output is correct
60 Correct 1342 ms 8044 KB Output is correct
61 Correct 1375 ms 8032 KB Output is correct
62 Correct 1298 ms 7804 KB Output is correct
63 Correct 1276 ms 7648 KB Output is correct
64 Correct 1320 ms 7972 KB Output is correct
65 Correct 1069 ms 7532 KB Output is correct
66 Correct 1361 ms 9588 KB Output is correct
67 Correct 1690 ms 9540 KB Output is correct
68 Correct 1499 ms 9736 KB Output is correct
69 Correct 1160 ms 9844 KB Output is correct
70 Correct 1766 ms 9664 KB Output is correct
71 Correct 1800 ms 9736 KB Output is correct
72 Correct 1754 ms 9736 KB Output is correct
73 Correct 1576 ms 9728 KB Output is correct
74 Correct 1510 ms 9712 KB Output is correct
75 Correct 1547 ms 9836 KB Output is correct
76 Correct 1227 ms 9648 KB Output is correct
77 Correct 1255 ms 9804 KB Output is correct
78 Correct 1222 ms 9692 KB Output is correct
79 Correct 893 ms 9196 KB Output is correct
80 Correct 893 ms 9236 KB Output is correct
81 Correct 875 ms 9324 KB Output is correct
82 Correct 1084 ms 9976 KB Output is correct
83 Correct 1073 ms 9976 KB Output is correct
84 Correct 1097 ms 9908 KB Output is correct
85 Correct 2009 ms 12196 KB Output is correct
86 Correct 158 ms 7412 KB Output is correct
87 Correct 132 ms 7276 KB Output is correct
88 Correct 1558 ms 10640 KB Output is correct
89 Correct 1943 ms 12216 KB Output is correct
90 Correct 1582 ms 10420 KB Output is correct
91 Correct 1578 ms 9664 KB Output is correct
92 Correct 1499 ms 9672 KB Output is correct
93 Correct 1928 ms 8796 KB Output is correct
94 Correct 1880 ms 11092 KB Output is correct
95 Correct 1895 ms 11132 KB Output is correct
96 Correct 2094 ms 10052 KB Output is correct
97 Correct 1107 ms 10388 KB Output is correct
98 Correct 1359 ms 10108 KB Output is correct
99 Correct 2041 ms 12040 KB Output is correct
100 Correct 2086 ms 12324 KB Output is correct
101 Correct 2094 ms 12216 KB Output is correct
102 Correct 2093 ms 12224 KB Output is correct
103 Correct 2123 ms 11420 KB Output is correct
104 Correct 2170 ms 11336 KB Output is correct
105 Correct 1821 ms 10928 KB Output is correct
106 Correct 1596 ms 10456 KB Output is correct
107 Correct 1535 ms 10884 KB Output is correct
108 Correct 2151 ms 11784 KB Output is correct
109 Correct 1882 ms 8784 KB Output is correct