Submission #377180

#	Time	Username	Problem	Language	Result	Execution time	Memory
377180		Thistle	다리 (APIO19_bridges)	C++14	30 / 100	3096 ms	12556 KiB

bridges

#pragma GCC target ("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
#include<complex>
#include<time.h>
#include<cassert>
#include<functional>
#include<numeric>
#include<tuple>
using namespace std;
using ll = long long;
using ld = long double;
using H = pair<ll, ll>;
using P = pair<ll, H>;
using vi = vector<ll>;
#define all(a) (a).begin(),(a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define Q(i,j,k) mkp((i),mkp((j),(k)))
#define rng(i,s,n) for(ll i = (s) ; i < (n) ; i++)
#define rep(i,n) rng(i, 0, (n))
#define mkp make_pair
#define vec vector
#define pb emplace_back
#define siz(a) int((a).size())
#define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end())
#define getidx(b,i) (lower_bound(all((b)),(i))-(b).begin())
#define ssp(i,n) (i==(ll)(n)-1?"\n":" ")
#define ctoi(c) (int)((c)-'0')
#define itoc(c) (char)((c)+'0')
#define cyes printf("Yes\n")
#define cno printf("No\n")
#define cdf(n) for(int quetimes_=(n);quetimes_>0;quetimes_--)
#define gcj printf("Case #%lld: ",quetimes_+1)
#define readv(a,n) (a).resize((n),0);rep(i,(n)) (a)[i]=read()
#define found(a,x) (a.find(x)!=a.end())
constexpr ll mod = (ll)1e9 + 7;
constexpr ll Mod = 998244353;
constexpr ld EPS = 1e-10;
constexpr ll inf = (ll)3 * 1e18;
constexpr int Inf = (ll)15 * 1e8;
constexpr int dx[] = { -1,1,0,0 }, dy[] = { 0,0,-1,1 };
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
ll read() { ll u, k = scanf("%lld", &u); return u; }
string reads() { string s; cin >> s; return s; }
H readh(short g = 0) { H u; int k = scanf("%lld %lld", &u.fs, &u.sc); if (g == 1) u.fs--, u.sc--; if (g == 2) u.fs--; return u; }
bool ina(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }
bool ina(int t, int l, int r) { return l <= t && t < r; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll ppc(ll x) {
    int sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++;
    return sum;
}
template<typename T>
void fin(T x) { cout << x << endl; exit(0); }

template<typename T>
class csum {
    vec<T> v;
public:
    csum(vec<T>& a) :v(a) { build(); }
    csum() {}
    csum(int sz) { init(sz); }
    void init(int sz) { v = vector<T>(sz + 1, 0); }
    void init(vec<T>& a) { v = a; build(); }
    void build() {
        for (int i = 1; i < v.size(); i++) v[i] += v[i - 1];
    }
    void add(int l, int r, T x) {
        v[l] += x;
        v[r] -= x;
    }//[l,r)
    void add(int t, T x) {
        v[t] += x;
    }//[l,r)
    //[l,r]
    T a(int l, int r) {
        if (r < l) return 0;
        return v[r] - (l == 0 ? 0 : v[l - 1]);
    }
    //[l,r)
    T b(int l, int r) {
        return a(l, r - 1);
    }
    T a(pair<int, int>t) {
        return a(t.first, t.second);
    }
    T b(pair<int, int>t) {
        return b(t.first, t.second);
    }
T operator[](int x)const {
    return v[x];
}
};
template<ll mod>
class modint {
public:ll v;
      modint(ll v = 0) { s(v % mod + mod); }
      constexpr static int fn_ = (ll)5e3 + 5;
      static vector<modint>fact, comp;
      modint pow(ll x) const {
          modint b(v), c(1);
          while (x) {
              if (x & 1) c *= b;
              b *= b;
              x >>= 1;
          }
          return c;
      }
      inline modint& s(int vv) {
          v = vv < mod ? vv : vv - mod;
          return *this;
      }
      inline modint inv()const { return pow(mod - 2); }
      inline modint operator-()const { return modint() - *this; }
      inline modint& operator+=(const modint b) { return s(v + b.v); }
      inline modint& operator-=(const modint b) { return s(v + mod - b.v); }
      inline modint& operator*=(const modint b) { v = v * b.v % mod; return *this; }
      inline modint& operator/=(const modint b) { v = v * b.inv().v % mod; return *this; }
      inline modint operator+(const modint& b) const { return modint(v) += b; }
      inline modint operator-(const modint& b) const { return modint(v) -= b; }
      inline modint operator*(const modint& b) const { return modint(v) *= b; }
      inline modint operator/(const modint& b) const { return modint(v) /= b; }
      friend ostream& operator<<(ostream& os, const modint& m) {
          return os << m.v;
      }
      friend istream& operator>>(istream& is, modint& m) {
          int x; is >> x; m = modint(x);
          return is;
      }
      bool operator<(const modint& r)const { return v < r.v; }
      bool operator>(const modint& r)const { return v > r.v; }
      bool operator<=(const modint& r)const { return v <= r.v; }
      bool operator>=(const modint& r)const { return v >= r.v; }
      bool operator==(const modint& r)const { return v == r.v; }
      bool operator!=(const modint& r)const { return v != r.v; }
      explicit operator bool()const { return v; }
      explicit operator int()const { return v; }
      modint comb(modint k) {
          if (k > *this) return modint();
          if (fact.empty()) combinit();
          if (v >= fn_) {
              if (k > *this - k) k = *this - k;
              modint tmp(1);
              for (int i = v; i >= v - k.v + 1; i--) tmp *= modint(i);
              return tmp * comp[k.v];
          }
          return fact[v] * comp[k.v] * comp[v - k.v];
      }//nCk
      modint perm(modint k) {
          if (k > *this) return modint();
          if (fact.empty()) combinit();
          if (v >= fn_) {
              modint tmp(1);
              for (int i = v; i >= v - k.v + 1; i--) tmp *= modint(i);
              return tmp;
          }
          return fact[v] * comp[v - k.v];
      }//nPk
      static void combinit() {
          fact.assign(fn_, modint());
          fact[0] = 1;
          for (int i = 1; i < fn_; i++) fact[i] = fact[i - 1] * modint(i);
          comp.assign(fn_, modint());
          comp[fn_ - 1] = fact[fn_ - 1].inv();
          for (int i = fn_ - 2; i >= 0; i--) comp[i] = comp[i + 1] * modint(i + 1);
      }
};
using mint = modint<10007>; template<>vec<mint> mint::fact = vec<mint>(); template<>vec<mint> mint::comp = vec<mint>();
//--------------------------------------------------------------
//--------------------------------------------------------------

class unionfind {
    int n;
    vi pa, sz;
    vec<P> ope;
public:
    unionfind(int n) :n(n) {
        pa.assign(n, -1);
        rep(i, n) pa[i] = i;
        sz.assign(n, 1);
    }
    int root(int x) {
        if (x == pa[x]) return x;
        return root(pa[x]);
    }
    bool unite(int x, int y) {
        x = root(x); y = root(y);
        if (x == y) return 0;
        if (sz[x] > sz[y]) swap(x, y);
        ope.pb(Q(x, y, sz[y]));
        sz[y] += sz[x];
        pa[x] = y;
        return 1;
    }
    void rollback(int tm) {
        while (tm > 0) {
            P t = ope.back(); ope.pop_back();
            pa[t.xx] = t.xx;
            sz[t.yy] = t.zz;
            tm--;
        }
    }
    ll size(int x) {
        x = root(x);
        return sz[x];
    }
};

int n,m, q;
vec<P>e;
vec<P>qry;


signed main() {
    cin >> n >> m;
    rep(i, m) {
        int u, v; ll r; scanf("%d %d %lld", &u, &v, &r);
        u--; v--;
        e.pb(Q(u, v, r));
    }
    cin >> q;
    rep(i, q) {
        int u; ll v, r; scanf("%d %lld %lld", &u, &v, &r);
        v--;
        qry.pb(Q(u, v, r));
    }


    int buk = sqrt(q);
    vi ans(q);
    for (int st = 0; st < q; st += buk) {
        int ed = min(st + buk, q);

        vec<P>v;
        vec<bool>used(m, 1);
        rng(i, st, ed) {
            if (qry[i].xx == 2) {
                v.pb(Q(2, i, qry[i].zz));
            }
            else {
                used[qry[i].yy] = 0;
            }
        }
        vec<H>fix;
        rep(i, m) {
            if (used[i]) v.pb(Q(1, i, e[i].zz));
            else {
                fix.pb(H{ i,e[i].zz });
            }
        }
        sort(all(v), [&](P a, P b) {
            if(a.zz!=b.zz) return a.zz > b.zz;
            return a.xx < b.xx;
            });

        unionfind uf(n);
        for (auto g : v) {
            if (g.xx == 1) {
                uf.unite(e[g.yy].xx, e[g.yy].yy);
                continue;
            }
            int cnt = 0;
            int t = g.yy;
            ll cst = qry[t].zz;
            set<int>se;
            for (int i = t - 1; i >= st; i--) {
                if (qry[i].xx == 1&&!found(se,qry[i].yy)) {
                    se.insert(qry[i].yy);
                    if (qry[i].zz >= cst && uf.unite(e[qry[i].yy].xx, e[qry[i].yy].yy)) {
                        cnt++;
                    }
                }
            }
            for (auto g : fix) {
                if (!found(se, g.fs)) {
                    if (g.sc >= cst && uf.unite(e[g.fs].xx, e[g.fs].yy)) {
                        cnt++;
                    }
                }
            }
            ans[t] = uf.size(qry[t].yy);
            uf.rollback(cnt);
        }

        rng(i, st, ed) {
            if (qry[i].xx == 1) {
                e[qry[i].yy].zz = qry[i].zz;
            }
        }
    }
    rep(i, q) {
        if (qry[i].xx == 2) printf("%lld\n", ans[i]);
    }
}

Compilation message (stderr)

bridges.cpp: In function 'll read()':
bridges.cpp:69:19: warning: unused variable 'k' [-Wunused-variable]
   69 | ll read() { ll u, k = scanf("%lld", &u); return u; }
      |                   ^
bridges.cpp: In function 'H readh(short int)':
bridges.cpp:71:33: warning: unused variable 'k' [-Wunused-variable]
   71 | H readh(short g = 0) { H u; int k = scanf("%lld %lld", &u.fs, &u.sc); if (g == 1) u.fs--, u.sc--; if (g == 2) u.fs--; return u; }
      |                                 ^
bridges.cpp: In function 'int main()':
bridges.cpp:243:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  243 |         int u, v; ll r; scanf("%d %d %lld", &u, &v, &r);
      |                         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:249:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  249 |         int u; ll v, r; scanf("%d %lld %lld", &u, &v, &r);
      |                         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 13 / 13
• Subtask 2: 0 / 16
• Subtask 3: 17 / 17
• Subtask 4: 0 / 14
• Subtask 5: 0 / 13
• Subtask 6: 0 / 27