oj.uz

Submission #124660

# Submission time Handle Problem Language Result Execution time Memory
124660 2019-07-03T16:41:37 Z Benq Bridges (APIO19_bridges) C++14
100 / 100
 2080 ms 8588 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 = 600;

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 3 ms 1984 KB Output is correct
2 Correct 3 ms 1916 KB Output is correct
3 Correct 39 ms 2468 KB Output is correct
4 Correct 9 ms 2308 KB Output is correct
5 Correct 25 ms 2572 KB Output is correct
6 Correct 22 ms 2472 KB Output is correct
7 Correct 25 ms 2300 KB Output is correct
8 Correct 22 ms 2392 KB Output is correct
9 Correct 34 ms 2424 KB Output is correct
10 Correct 23 ms 2296 KB Output is correct
11 Correct 22 ms 2296 KB Output is correct
12 Correct 25 ms 2424 KB Output is correct
13 Correct 30 ms 2424 KB Output is correct
14 Correct 27 ms 2500 KB Output is correct
15 Correct 26 ms 2424 KB Output is correct
16 Correct 27 ms 2300 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 1349 ms 7580 KB Output is correct
2 Correct 1326 ms 7592 KB Output is correct
3 Correct 1337 ms 7576 KB Output is correct
4 Correct 1334 ms 7580 KB Output is correct
5 Correct 1299 ms 7556 KB Output is correct
6 Correct 2029 ms 6704 KB Output is correct
7 Correct 1928 ms 6716 KB Output is correct
8 Correct 1857 ms 6528 KB Output is correct
9 Correct 61 ms 3992 KB Output is correct
10 Correct 1200 ms 6952 KB Output is correct
11 Correct 1127 ms 6984 KB Output is correct
12 Correct 888 ms 6760 KB Output is correct
13 Correct 1235 ms 7144 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1067 ms 5980 KB Output is correct
2 Correct 843 ms 4460 KB Output is correct
3 Correct 1200 ms 6044 KB Output is correct
4 Correct 1042 ms 6052 KB Output is correct
5 Correct 67 ms 3792 KB Output is correct
6 Correct 1145 ms 6012 KB Output is correct
7 Correct 903 ms 5936 KB Output is correct
8 Correct 798 ms 5924 KB Output is correct
9 Correct 564 ms 6116 KB Output is correct
10 Correct 511 ms 5900 KB Output is correct
11 Correct 815 ms 6144 KB Output is correct
12 Correct 714 ms 6140 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1049 ms 7884 KB Output is correct
2 Correct 63 ms 3820 KB Output is correct
3 Correct 110 ms 5164 KB Output is correct
4 Correct 79 ms 5036 KB Output is correct
5 Correct 812 ms 8072 KB Output is correct
6 Correct 1066 ms 7864 KB Output is correct
7 Correct 798 ms 7872 KB Output is correct
8 Correct 695 ms 6380 KB Output is correct
9 Correct 668 ms 6396 KB Output is correct
10 Correct 692 ms 6376 KB Output is correct
11 Correct 1028 ms 7148 KB Output is correct
12 Correct 1018 ms 7092 KB Output is correct
13 Correct 975 ms 7196 KB Output is correct
14 Correct 714 ms 8128 KB Output is correct
15 Correct 745 ms 7936 KB Output is correct
16 Correct 1169 ms 8024 KB Output is correct
17 Correct 1184 ms 7852 KB Output is correct
18 Correct 1152 ms 7872 KB Output is correct
19 Correct 1207 ms 7860 KB Output is correct
20 Correct 1075 ms 7604 KB Output is correct
21 Correct 1114 ms 7568 KB Output is correct
22 Correct 1102 ms 7948 KB Output is correct
23 Correct 909 ms 7460 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1349 ms 7580 KB Output is correct
2 Correct 1326 ms 7592 KB Output is correct
3 Correct 1337 ms 7576 KB Output is correct
4 Correct 1334 ms 7580 KB Output is correct
5 Correct 1299 ms 7556 KB Output is correct
6 Correct 2029 ms 6704 KB Output is correct
7 Correct 1928 ms 6716 KB Output is correct
8 Correct 1857 ms 6528 KB Output is correct
9 Correct 61 ms 3992 KB Output is correct
10 Correct 1200 ms 6952 KB Output is correct
11 Correct 1127 ms 6984 KB Output is correct
12 Correct 888 ms 6760 KB Output is correct
13 Correct 1235 ms 7144 KB Output is correct
14 Correct 1067 ms 5980 KB Output is correct
15 Correct 843 ms 4460 KB Output is correct
16 Correct 1200 ms 6044 KB Output is correct
17 Correct 1042 ms 6052 KB Output is correct
18 Correct 67 ms 3792 KB Output is correct
19 Correct 1145 ms 6012 KB Output is correct
20 Correct 903 ms 5936 KB Output is correct
21 Correct 798 ms 5924 KB Output is correct
22 Correct 564 ms 6116 KB Output is correct
23 Correct 511 ms 5900 KB Output is correct
24 Correct 815 ms 6144 KB Output is correct
25 Correct 714 ms 6140 KB Output is correct
26 Correct 1340 ms 7004 KB Output is correct
27 Correct 1686 ms 7000 KB Output is correct
28 Correct 1432 ms 7080 KB Output is correct
29 Correct 1036 ms 6800 KB Output is correct
30 Correct 1779 ms 6964 KB Output is correct
31 Correct 1801 ms 6940 KB Output is correct
32 Correct 1745 ms 6988 KB Output is correct
33 Correct 1494 ms 7004 KB Output is correct
34 Correct 1522 ms 6988 KB Output is correct
35 Correct 1503 ms 6980 KB Output is correct
36 Correct 1151 ms 6888 KB Output is correct
37 Correct 1138 ms 6816 KB Output is correct
38 Correct 1083 ms 6868 KB Output is correct
39 Correct 783 ms 6536 KB Output is correct
40 Correct 805 ms 6496 KB Output is correct
41 Correct 818 ms 6508 KB Output is correct
42 Correct 1002 ms 7168 KB Output is correct
43 Correct 984 ms 7340 KB Output is correct
44 Correct 981 ms 7212 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1984 KB Output is correct
2 Correct 3 ms 1916 KB Output is correct
3 Correct 39 ms 2468 KB Output is correct
4 Correct 9 ms 2308 KB Output is correct
5 Correct 25 ms 2572 KB Output is correct
6 Correct 22 ms 2472 KB Output is correct
7 Correct 25 ms 2300 KB Output is correct
8 Correct 22 ms 2392 KB Output is correct
9 Correct 34 ms 2424 KB Output is correct
10 Correct 23 ms 2296 KB Output is correct
11 Correct 22 ms 2296 KB Output is correct
12 Correct 25 ms 2424 KB Output is correct
13 Correct 30 ms 2424 KB Output is correct
14 Correct 27 ms 2500 KB Output is correct
15 Correct 26 ms 2424 KB Output is correct
16 Correct 27 ms 2300 KB Output is correct
17 Correct 26 ms 2296 KB Output is correct
18 Correct 1349 ms 7580 KB Output is correct
19 Correct 1326 ms 7592 KB Output is correct
20 Correct 1337 ms 7576 KB Output is correct
21 Correct 1334 ms 7580 KB Output is correct
22 Correct 1299 ms 7556 KB Output is correct
23 Correct 2029 ms 6704 KB Output is correct
24 Correct 1928 ms 6716 KB Output is correct
25 Correct 1857 ms 6528 KB Output is correct
26 Correct 61 ms 3992 KB Output is correct
27 Correct 1200 ms 6952 KB Output is correct
28 Correct 1127 ms 6984 KB Output is correct
29 Correct 888 ms 6760 KB Output is correct
30 Correct 1235 ms 7144 KB Output is correct
31 Correct 1067 ms 5980 KB Output is correct
32 Correct 843 ms 4460 KB Output is correct
33 Correct 1200 ms 6044 KB Output is correct
34 Correct 1042 ms 6052 KB Output is correct
35 Correct 67 ms 3792 KB Output is correct
36 Correct 1145 ms 6012 KB Output is correct
37 Correct 903 ms 5936 KB Output is correct
38 Correct 798 ms 5924 KB Output is correct
39 Correct 564 ms 6116 KB Output is correct
40 Correct 511 ms 5900 KB Output is correct
41 Correct 815 ms 6144 KB Output is correct
42 Correct 714 ms 6140 KB Output is correct
43 Correct 1049 ms 7884 KB Output is correct
44 Correct 63 ms 3820 KB Output is correct
45 Correct 110 ms 5164 KB Output is correct
46 Correct 79 ms 5036 KB Output is correct
47 Correct 812 ms 8072 KB Output is correct
48 Correct 1066 ms 7864 KB Output is correct
49 Correct 798 ms 7872 KB Output is correct
50 Correct 695 ms 6380 KB Output is correct
51 Correct 668 ms 6396 KB Output is correct
52 Correct 692 ms 6376 KB Output is correct
53 Correct 1028 ms 7148 KB Output is correct
54 Correct 1018 ms 7092 KB Output is correct
55 Correct 975 ms 7196 KB Output is correct
56 Correct 714 ms 8128 KB Output is correct
57 Correct 745 ms 7936 KB Output is correct
58 Correct 1169 ms 8024 KB Output is correct
59 Correct 1184 ms 7852 KB Output is correct
60 Correct 1152 ms 7872 KB Output is correct
61 Correct 1207 ms 7860 KB Output is correct
62 Correct 1075 ms 7604 KB Output is correct
63 Correct 1114 ms 7568 KB Output is correct
64 Correct 1102 ms 7948 KB Output is correct
65 Correct 909 ms 7460 KB Output is correct
66 Correct 1340 ms 7004 KB Output is correct
67 Correct 1686 ms 7000 KB Output is correct
68 Correct 1432 ms 7080 KB Output is correct
69 Correct 1036 ms 6800 KB Output is correct
70 Correct 1779 ms 6964 KB Output is correct
71 Correct 1801 ms 6940 KB Output is correct
72 Correct 1745 ms 6988 KB Output is correct
73 Correct 1494 ms 7004 KB Output is correct
74 Correct 1522 ms 6988 KB Output is correct
75 Correct 1503 ms 6980 KB Output is correct
76 Correct 1151 ms 6888 KB Output is correct
77 Correct 1138 ms 6816 KB Output is correct
78 Correct 1083 ms 6868 KB Output is correct
79 Correct 783 ms 6536 KB Output is correct
80 Correct 805 ms 6496 KB Output is correct
81 Correct 818 ms 6508 KB Output is correct
82 Correct 1002 ms 7168 KB Output is correct
83 Correct 984 ms 7340 KB Output is correct
84 Correct 981 ms 7212 KB Output is correct
85 Correct 1770 ms 8568 KB Output is correct
86 Correct 150 ms 5616 KB Output is correct
87 Correct 139 ms 5356 KB Output is correct
88 Correct 1458 ms 8292 KB Output is correct
89 Correct 1741 ms 8444 KB Output is correct
90 Correct 1457 ms 8108 KB Output is correct
91 Correct 1495 ms 6864 KB Output is correct
92 Correct 1489 ms 6936 KB Output is correct
93 Correct 1946 ms 6404 KB Output is correct
94 Correct 1854 ms 7900 KB Output is correct
95 Correct 1791 ms 7776 KB Output is correct
96 Correct 1972 ms 6944 KB Output is correct
97 Correct 967 ms 8112 KB Output is correct
98 Correct 1228 ms 7992 KB Output is correct
99 Correct 1855 ms 8364 KB Output is correct
100 Correct 1829 ms 8588 KB Output is correct
101 Correct 1908 ms 8436 KB Output is correct
102 Correct 1893 ms 8488 KB Output is correct
103 Correct 2080 ms 8044 KB Output is correct
104 Correct 2068 ms 8036 KB Output is correct
105 Correct 1685 ms 7552 KB Output is correct
106 Correct 1439 ms 7348 KB Output is correct
107 Correct 1344 ms 7656 KB Output is correct
108 Correct 1989 ms 8156 KB Output is correct
109 Correct 1813 ms 6800 KB Output is correct