oj.uz

답안 #1016063

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1016063 2024-07-07T11:02:51 Z GrindMachine Colors (RMI18_colors) C++17
47 / 100
 3000 ms 3648 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

struct DSU {
    vector<int> par, rankk, siz;
    vector<int> good;

    DSU() {

    }

    DSU(int n) {
        init(n);
    }

    void init(int n) {
        par = vector<int>(n + 1);
        rankk = vector<int>(n + 1);
        siz = vector<int>(n + 1);
        good = vector<int>(n + 1);
        rep(i, n + 1) create(i);
    }

    void create(int u) {
        par[u] = u;
        rankk[u] = 0;
        siz[u] = 1;
    }

    int find(int u) {
        if (u == par[u]) return u;
        else return par[u] = find(par[u]);
    }

    bool same(int u, int v) {
        return find(u) == find(v);
    }

    void merge(int u, int v) {
        u = find(u), v = find(v);
        if (u == v) return;

        if (rankk[u] == rankk[v]) rankk[u]++;
        if (rankk[u] < rankk[v]) swap(u, v);

        par[v] = u;
        siz[u] += siz[v];
        good[u] |= good[v];
    }
};

void solve(int test_case)
{
    ll n,m; cin >> n >> m;
    vector<ll> a(n+5), b(n+5);
    rep1(i,n) cin >> a[i];
    rep1(i,n) cin >> b[i];
    vector<pll> edges(m+5);
    rep1(i,m) cin >> edges[i].ff >> edges[i].ss;

    ll ans = 1;

    rev(x,n,1){
        DSU dsu(n);
        vector<bool> active(n+5);
        rep1(i,n){
            if(a[i] >= x and b[i] <= x){
                active[i] = 1;
            }
            if(a[i] == x){
                dsu.good[i] = 1;
            }
        }

        rep1(i,m){
            auto [u,v] = edges[i];
            if(active[u] and active[v]){
                dsu.merge(u,v);
            }
        }

        rep1(i,n){
            if(b[i] == x){
                ll p = dsu.find(i);
                ans &= dsu.good[p];
            }
        }
    }

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 1876 KB Output is correct
2 Correct 39 ms 860 KB Output is correct
3 Correct 24 ms 560 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 2144 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 1880 KB Output is correct
2 Correct 49 ms 856 KB Output is correct
3 Correct 26 ms 348 KB Output is correct

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 1880 KB Output is correct
2 Correct 49 ms 856 KB Output is correct
3 Correct 26 ms 348 KB Output is correct
4 Correct 188 ms 3408 KB Output is correct
5 Execution timed out 3071 ms 3468 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 1876 KB Output is correct
2 Correct 39 ms 860 KB Output is correct
3 Correct 24 ms 560 KB Output is correct
4 Correct 76 ms 1880 KB Output is correct
5 Correct 49 ms 856 KB Output is correct
6 Correct 26 ms 348 KB Output is correct
7 Correct 74 ms 1876 KB Output is correct
8 Correct 41 ms 860 KB Output is correct
9 Correct 34 ms 568 KB Output is correct

Subtask #6
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 187 ms 3412 KB Output is correct
2 Execution timed out 3081 ms 3648 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 1368 KB Output is correct
2 Correct 18 ms 836 KB Output is correct
3 Correct 22 ms 628 KB Output is correct

Subtask #8
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 1876 KB Output is correct
2 Correct 39 ms 860 KB Output is correct
3 Correct 24 ms 560 KB Output is correct
4 Correct 66 ms 2144 KB Output is correct
5 Correct 76 ms 1880 KB Output is correct
6 Correct 49 ms 856 KB Output is correct
7 Correct 26 ms 348 KB Output is correct
8 Correct 188 ms 3408 KB Output is correct
9 Execution timed out 3071 ms 3468 KB Time limit exceeded
10 Halted 0 ms 0 KB -