제출 #886440

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
886440		Kutan	다리 (APIO19_bridges)	C++14	14 / 100	2587 ms	20816 KiB

bridges

// Cao Quang Hung
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
 
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<long long , long long>
#define vi vector<int>
#define vpii vector<pii>
#define SZ(x) ((int)(x.size()))
#define fi first
#define se second
#define IN(x,y) ((y).find((x))!=(y).end())
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define dem(x) __builtin_popcount(x)
#define Mask(x) (1LL << (x))
#define BIT(x, i) ((x) >> (i) & 1)
#define ln '\n'
#define io_faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
///mt19937 rnd(time(0));
 
const int INF = 1e9 , mod = 1e9 + 7;
 
template <class T1, class T2>
inline T1 mul(T1& x, const T2 &k){ return x = (1LL * x * k) % mod; }
 
template <class T1 , class T2>
inline T1 pw(T1 x, T2 k){T1 res = 1; for (; k ; k >>= 1){ if (k & 1) mul(res, x); mul(x, x); } return res;}
 
template <class T>
inline bool minimize(T &x, const T &y){ if (x > y){x = y; return 1;} return 0; }
 
template <class T>
inline bool maximize(T &x, const T &y){ if (x < y){x = y; return 1;} return 0; }
 
template <class T>
inline void add(T &x , const T &y){ if ((x += y) >= mod) x -= mod; }
 
template <class T>
inline T product (const T &x , const T &y) { return 1LL * x * y % mod; }
 
#define PROB "a"
void file(){
    if(fopen(PROB".inp", "r")){
        freopen(PROB".inp","r",stdin);
        freopen(PROB".out","w",stdout);
    }
}
void sinh_(){
//    srand(time(0));
//    freopen(PROB".inp" , "w" , stdout);
//    int n;
}
 
typedef long long ll;
typedef double db;
const int N = 1e5 + 5;
const int S = 350;
 
int n, m, q;
int par[N], sz[N];
int mark[N] = {}, num = 0, numRemain, curW[N];
int ans[N];

struct Data{
    int u, su, v, sv;
    Data(int _u = 0, int _su = 0, int _v = 0, int _sv = 0) {
        u = _u, su = _su, v = _v, sv = _sv;
    }
}; vector<Data> st;

struct edge{
    int u, v, w;
    edge(int _u = 0, int _v = 0, int _w = 0) {
        u = _u, v = _v, w = _w;
    }
    bool operator < (const edge &other) const {
        return w > other.w;
    }
} Edge[N], remained_edge[N];
 
struct query{
    int type, u, w;
    query(int _type = 0, int _u = 0, int _w = 0) {
        type = _type, u = _u, w = _w;
    }
} Query[N];
 
vi adj[N];
int other(int x, int id) {
    return x ^ Edge[id].u ^ Edge[id].v;
}
 
void readip(){
    cin >> n >> m;
    REP(i, 1, m) {
        int u, v, w; cin >> u >> v >> w;
        Edge[i] = edge(u, v, w);
        adj[u].eb(i);
        adj[v].eb(i);
    }
    cin >> q;
    REP(i, 1, q) cin >> Query[i].type >> Query[i].u >> Query[i].w;
}
    
namespace sub1 {
    vector<bool> vis;
    void bfs(int s, int w) {
        REP(i, 0, n) vis[i] = 0;
        int cnt = 0;
        queue<int> q;
        vis[s] = 1;
        q.push(s);
        while(!q.empty()) {
            int u = q.front(); ++cnt;
            q.pop();
            for (const int &id : adj[u]) {
                int v = other(u, id);
                if (vis[v] || Edge[id].w < w) continue;
                vis[v] = true;
                q.push(v);
            }
        }
        cout << cnt << ln;
    }
 
    void solve() {
        vis.assign(n + 5, 0);
        REP(i, 1, q) {
            if (Query[i].type == 1) {
                Edge[Query[i].u].w = Query[i].w;
            }
            else {
                bfs(Query[i].u, Query[i].w);
            }
        }
   }
};
 
namespace sub2 {
    struct segtree{
        vector<int> it;
        segtree(int _n = 0) {
            if (_n > 0) {
                it.assign(4 * n + 7, 0);
            }
        }
 
        void upd(int u, int val, int id = 1, int l = 1, int r = n) {
            if (l == r) {
                it[id] = val;
                return;
            }
            int mid = (l + r) >> 1;
            if (u <= mid) upd(u, val, id << 1, l, mid);
            else upd(u, val, id << 1 | 1, mid + 1, r);
            it[id] = min(it[id << 1], it[id << 1 | 1]);
        }
 
        int walk_lef(int pos, int val, int id = 1, int l = 1, int r = n) {
            if (l > pos) return n + 1;
            if (1 <= l && r <= pos) {
                int res = n + 1;
                while(1) {
                    int mid = (l + r) >> 1;
                    if (l == r) return (it[id] >= val ? l : res);
                    if (it[id << 1 | 1] >= val) {
                        res = mid + 1;
                        r = mid;
                        id = id << 1;
                    }
                    else {
                        l = mid + 1;
                        id = id << 1 | 1;
                    }
                }
            }
 
            int mid = (l + r) >> 1;
            if (pos <= mid) return walk_lef(pos, val, id << 1, l, mid);
            
            int tmp = walk_lef(pos, val, id << 1 | 1, mid + 1, r);
            if (tmp > mid + 1) return tmp;
            return min(mid + 1, walk_lef(pos, val, id << 1, l, mid));
        }
 
        int walk_rig(int pos, int val, int id = 1, int l = 1, int r = n) {
            if (r < pos) return -1;
            if (pos <= l && r <= n) {
                int res = -1;
                while(1) {
                    int mid = (l + r) >> 1;
                    if (l == r) return (it[id] >= val ? l : res);
                    if (it[id << 1] >= val) {
                        res = mid;
                        l = mid + 1;
                        id = id << 1 | 1;
                    }
                    else {
                        r = mid;
                        id = id << 1;
                    }
                }
            }
 
            int mid = (l + r) >> 1;
            if (pos > mid) return walk_rig(pos, val, id << 1 | 1, mid + 1, r);
 
            int tmp = walk_rig(pos, val, id << 1, l, mid);
            if (tmp < mid) return tmp;
            return max(tmp, walk_rig(pos, val, id << 1 | 1, mid + 1, r));
        }
    } ST;   
 
 
    bool check() {
        if (m != n - 1) return 0;
        REP(i, 1, m) if (Edge[i].u != i || Edge[i].v != i + 1) return 0;
        return 1;
    }
 
    void solve() {
        ST = segtree(n);
        REP(i, 1, m) ST.upd(i, Edge[i].w);  
        REP(i, 1, q) {
            if (Query[i].type == 1) {
                ST.upd(Query[i].u, Query[i].w);
            }
            else {
                int lef = Query[i].u, rig = Query[i].u;
                if (Query[i].u > 1) minimize(lef, ST.walk_lef(Query[i].u - 1, Query[i].w));
                if (Query[i].u < n) maximize(rig, ST.walk_rig(Query[i].u, Query[i].w) + 1);
                cout << rig - lef + 1 << ln;
            }
        }
    }
};
 
namespace sub4 {
    bool check() {
        REP(i, 1, q) if (Query[i].type == 1) return 0;
        return 1;
    }
    
    struct DSU{
        vector<int> par, sz;
        DSU(int _n = 0) {
            par.assign(n + 5, 0);
            REP(i, 1, n) par[i] = i;
            sz.assign(n + 5, 1);
        }

        int root(int x) {
            if (x == par[x]) return x;
            return par[x] = root(par[x]);
        }

        bool unite(int u, int v) {
            u = root(u), v = root(v);
            if (u == v) return false;
            if (sz[u] < sz[v]) swap(u, v);
            sz[u] += sz[v];
            par[v] = u;
            return true;
        }

        int getsize(int x) {return sz[root(x)]; }
    } dsu;

    void solve() {
        sort(Edge + 1, Edge + m + 1, [&](const edge &x, const edge &y){
            return x.w > y.w;
        }); 
        dsu = DSU(n);
        vector<int> idx(q + 2), ans(q + 2, 0);
        REP(i, 1, q) idx[i] = i;
        sort(idx.begin() + 1, idx.begin() + q + 1, [&](const int &x, const int &y) {
            return Query[x].w > Query[y].w;
        }); 

        int pt = 1;
        REP(i, 1, q) {
            while(pt <= m && Edge[pt].w >= Query[idx[i]].w) 
                dsu.unite(Edge[pt].u, Edge[pt].v), ++pt;
            ans[idx[i]] = dsu.getsize(Query[idx[i]].u);
        }
        REP(i, 1, q) cout << ans[i] << ln;
    }
}


namespace subfull {
    void init() {
        REP(i, 1, n) par[i] = i, sz[i] = 1;
        st.clear();
    }

    int root(int x) {
        while(x != par[x]) x = par[x];
        return x;
    }

    bool unite(int u, int v, bool hold) {
        u = root(u), v = root(v);
        if (u == v) return 0;
        if (!hold) st.eb(u, sz[u], v, sz[v]);

        if (sz[u] < sz[v]) swap(u, v);
        sz[u] += sz[v];
        par[v] = u;
        return 1;
    }
    
    void roll_back() {
        while(!st.empty()) {
            const auto &[u, su, v, sv] = st.back();
            st.pop_back();
            par[u] = u, sz[u] = su;
            par[v] = v, sz[v] = sv;
        }
    }

    void solve() {
        for (int l = 1; l <= q; ++l) {
            int r = min(q, l + S - 1);
            ++num;

            vector<int> active_edges;   
            vector<int> order;        
            REP(i, l, r) {
                if (Query[i].type == 1) {
                    if (mark[Query[i].u] != num) {
                        mark[Query[i].u] = num;
                        active_edges.eb(Query[i].u);
                    }
                }
                else order.eb(i);
            }   
            
            // for (int id : active_edges) cout << id << ' '; cout << ln;
            


            numRemain = 0;
            REP(i, 1, m) if (mark[i] != num)
                remained_edge[++numRemain] = Edge[i];
            sort(remained_edge + 1, remained_edge + numRemain + 1);

            sort(ALL(order), [&](const int &x, const int &y){
                return Query[x].w > Query[y].w;
            });

            // cout << "order " << ln;
            // for (int i : order) cout << i << ' '; cout << ln;
            // cout << ln;

            // cout << "remained  edge " << ln;
            // REP(i, 1, numRemain) cout << remained_edge[i].u << ' ' << remained_edge[i].v << ' ' << remained_edge[i].w << ln;
            // cout << ln;
            
            init();
            int pt = 1;
            for (int i : order) {
                while(pt <= numRemain && remained_edge[pt].w >= Query[i].w) {
                    unite(remained_edge[pt].u, remained_edge[pt].v, 1);
                    ++pt;
                }

                for (int id : active_edges) curW[id] = Edge[id].w;
                REP(k, l, i - 1) {
                    if (Query[k].type == 1)
                        curW[Query[k].u] = Query[k].w;
                }   
                
                for (int id : active_edges) if (curW[id] >= Query[i].w) 
                    unite(Edge[id].u, Edge[id].v, 0);

                ans[i] = sz[root(Query[i].u)];
                roll_back();
            }


            REP(k, l, r) if (Query[k].type == 1)
                Edge[Query[k].u] = Query[k].w;
            l = r;
        }

        REP(i, 1, q) if (Query[i].type == 2)
            cout << ans[i] << ln;
    }

};  

void solve(){   
    // if (n <= 1000 && m <= 1000 && q <= 10000) {
    //     sub1::solve();
    //     return;
    // }
    // if (sub2::check()) {
    //     sub2::solve();
    //     return;
    // }
    // if (sub4::check()) {
    //     sub4::solve();
    //     return;
    // }
    subfull::solve();
}
 
int main(){
    sinh_();
    io_faster
    file();
    int t = 1;
//    cin >> t;
    while (t--){
        readip();
        solve();
    }
}

컴파일 시 표준 에러 (stderr) 메시지

bridges.cpp: In function 'void readip()':
bridges.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridges.cpp:176:5: note: in expansion of macro 'REP'
  176 |     REP(i, 1, m) {
      |     ^~~
bridges.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridges.cpp:183:5: note: in expansion of macro 'REP'
  183 |     REP(i, 1, q) cin >> Query[i].type >> Query[i].u >> Query[i].w;
      |     ^~~
bridges.cpp: In function 'void sub1::bfs(int, int)':
bridges.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridges.cpp:189:9: note: in expansion of macro 'REP'
  189 |         REP(i, 0, n) vis[i] = 0;
      |         ^~~
bridges.cpp: In function 'void sub1::solve()':
bridges.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridges.cpp:209:9: note: in expansion of macro 'REP'
  209 |         REP(i, 1, q) {
      |         ^~~
bridges.cpp: In function 'bool sub2::check()':
bridges.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridges.cpp:298:9: note: in expansion of macro 'REP'
  298 |         REP(i, 1, m) if (Edge[i].u != i || Edge[i].v != i + 1) return 0;
      |         ^~~
bridges.cpp: In function 'void sub2::solve()':
bridges.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridges.cpp:304:9: note: in expansion of macro 'REP'
  304 |         REP(i, 1, m) ST.upd(i, Edge[i].w);
      |         ^~~
bridges.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridges.cpp:305:9: note: in expansion of macro 'REP'
  305 |         REP(i, 1, q) {
      |         ^~~
bridges.cpp: In function 'bool sub4::check()':
bridges.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridges.cpp:321:9: note: in expansion of macro 'REP'
  321 |         REP(i, 1, q) if (Query[i].type == 1) return 0;
      |         ^~~
bridges.cpp: In constructor 'sub4::DSU::DSU(int)':
bridges.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridges.cpp:329:13: note: in expansion of macro 'REP'
  329 |             REP(i, 1, n) par[i] = i;
      |             ^~~
bridges.cpp: In function 'void sub4::solve()':
bridges.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridges.cpp:356:9: note: in expansion of macro 'REP'
  356 |         REP(i, 1, q) idx[i] = i;
      |         ^~~
bridges.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridges.cpp:362:9: note: in expansion of macro 'REP'
  362 |         REP(i, 1, q) {
      |         ^~~
bridges.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridges.cpp:367:9: note: in expansion of macro 'REP'
  367 |         REP(i, 1, q) cout << ans[i] << ln;
      |         ^~~
bridges.cpp: In function 'void subfull::init()':
bridges.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridges.cpp:374:9: note: in expansion of macro 'REP'
  374 |         REP(i, 1, n) par[i] = i, sz[i] = 1;
      |         ^~~
bridges.cpp: In function 'void subfull::roll_back()':
bridges.cpp:396:25: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  396 |             const auto &[u, su, v, sv] = st.back();
      |                         ^
bridges.cpp: In function 'void subfull::solve()':
bridges.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridges.cpp:410:13: note: in expansion of macro 'REP'
  410 |             REP(i, l, r) {
      |             ^~~
bridges.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridges.cpp:425:13: note: in expansion of macro 'REP'
  425 |             REP(i, 1, m) if (mark[i] != num)
      |             ^~~
bridges.cpp:92:28: warning: unnecessary parentheses in declaration of 'k' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridges.cpp:450:17: note: in expansion of macro 'REP'
  450 |                 REP(k, l, i - 1) {
      |                 ^~~
bridges.cpp:92:28: warning: unnecessary parentheses in declaration of 'k' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridges.cpp:463:13: note: in expansion of macro 'REP'
  463 |             REP(k, l, r) if (Query[k].type == 1)
      |             ^~~
bridges.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridges.cpp:468:9: note: in expansion of macro 'REP'
  468 |         REP(i, 1, q) if (Query[i].type == 2)
      |         ^~~
bridges.cpp: In function 'void file()':
bridges.cpp:125:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  125 |         freopen(PROB".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:126:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  126 |         freopen(PROB".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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