제출 #1156962

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1156962		InvMOD	Colors (RMI18_colors)	C++20	100 / 100	656 ms	78684 KiB

colors

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define gcd __gcd
#define sz(v) (int) v.size()
#define pb push_back
#define pi pair<int,int>
#define all(v) (v).begin(), (v).end()
#define compact(v) (v).erase(unique(all(v)), (v).end())
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define REV(i, a, b) for(int i = (a); i >= (b); i--)
#define dbg(x) "[" #x " = " << (x) << "]"
///#define int long long

using ll = long long;
using ld = long double;
using ull = unsigned long long;

template<typename T> bool ckmx(T& a, const T& b){if(a < b) return a = b, true; return false;}
template<typename T> bool ckmn(T& a, const T& b){if(a > b) return a = b, true; return false;}

const int N = 2e5+5;
const ll MOD = 1e9+7;
const ll INF = 1e18;


namespace dsu{
    int par[N], sz[N];

    stack<pair<int, int&>> st;

    void preprocess(int n){
        for(int i = 1; i <= n; i++){
            par[i] = i;
            sz[i] = 1;
        }
        return;
    }

    int asc(int x){
        return x == par[x] ? x : asc(par[x]);
    }

    bool join(int u, int v){
        u = asc(u), v = asc(v);

        if(u == v) return false;
        if(sz[u] < sz[v]) swap(u, v);

        st.push({sz[u], sz[u]});
        st.push({par[v], par[v]});

        sz[u] += sz[v];
        par[v] = u;
        return true;
    }

    int snap(){
        return sz(st);
    }

    void rollback(int snap){
        while(sz(st) > snap){
            st.top().se = st.top().fi;

            st.pop();
        }
        return;
    }
}

int n, m, a[N], b[N];

bool good[N], answer = true;

vector<int> save[N], save_check[N];

vector<pair<int,int>> Edge[N << 2];

void update(int id, int l, int r, int u, int v, pair<int,int> e){
    if(l >= u && r <= v){
        Edge[id].push_back(e);
        return;
    }
    int m = l+r>>1;
    if(u <= m) update(id << 1, l, m, u, v, e);
    if(v > m) update(id << 1|1, m+1, r, u, v, e);
    return;
}

void dfs(int id, int l, int r){
    int snap = dsu::snap();

    if(l == r){
        for(pair<int,int> e : Edge[id]){
            int u = e.fi, v = e.se;
            dsu::join(u, v);
        }

        for(int v : save[l]){
            good[dsu::asc(v)] = true;
        }

        for(int v : save_check[l]){
            answer = answer & (good[dsu::asc(v)]);
        }

        for(int v : save[l]){
            good[dsu::asc(v)] = false;
        }
    }
    else{
        int m = l+r>>1;

        // Lazy
        for(pair<int,int> e : Edge[id]){
            int u = e.fi, v = e.se;
            dsu::join(u, v);
        }

        dfs(id << 1, l, m);
        dfs(id << 1|1, m+1, r);
    }

    dsu::rollback(snap);
    return;
}

void reset(){
    answer = true;

    FOR(i, 1, (n << 2)){
        Edge[i].clear();
    }

    FOR(i, 1, n) save[i].clear(), save_check[i].clear();
}

void solve()
{
    cin >> n >> m;

    FOR(i, 1, n) cin >> a[i];
    FOR(i, 1, n) cin >> b[i];

    FOR(i, 1, m){
        int u,v; cin >> u >> v;
        update(1, 1, n, max(b[u], b[v]), min(a[u], a[v]), make_pair(u, v));
    }

    FOR(i, 1, n){
        if(a[i] < b[i])
            answer = false;

        save[a[i]].push_back(i);
        save_check[b[i]].push_back(i);
    }

    dsu::preprocess(n);

    dfs(1, 1, n);

    cout << (answer ? 1 : 0) << "\n";

    reset();

    return;
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    #define name "InvMOD"
    if(fopen(name".INP", "r")){
        freopen(name".INP","r",stdin);
        freopen(name".OUT","w",stdout);
    }

    int t = 1; cin >> t;
    while(t--) solve();
    return 0;
}

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

colors.cpp: In function 'int main()':
colors.cpp:180:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  180 |         freopen(name".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
colors.cpp:181:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  181 |         freopen(name".OUT","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 15 / 15
• Subtask 2: 7 / 7
• Subtask 3: 8 / 8
• Subtask 4: 15 / 15
• Subtask 5: 7 / 7
• Subtask 6: 16 / 16
• Subtask 7: 10 / 10
• Subtask 8: 22 / 22