oj.uz

답안 #948105

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
948105 2024-03-17T15:19:38 Z Blagoj Colors (RMI18_colors) C++17
17 / 100
 3000 ms 32172 KB 
#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define ll long long
#define all(x) (x).begin(), (x).end()

const int mxn = 2e5;

vector<int> a(mxn), b(mxn), cntA[mxn], cntB[mxn], ldr(mxn), rnk(mxn);
vector<pair<int, int>> edges, sgt[4 * mxn];

void clear() {
    edges.clear();
    for (int i = 1; i < mxn; i++) {
        ldr[i] = i;
        rnk[i] = 1;
        cntA[i].clear();
        cntB[i].clear();
    }
    for (int i = 1; i <= 4 * mxn; i++) sgt[i].clear();        
}

void update(int k, int l, int r, int i, int j, pair<int, int> x) {
    if (l > j || r < i) return;
    if (i <= l && r <= j) {
        sgt[k].push_back(x);
        return;
    }
    int mid = (l + r) / 2;
    update(k * 2, l, mid, i, j, x);
    update(k * 2 + 1, mid + 1, r, i, j, x);
}

bool flag;

int Find(int x) {
    if (x != ldr[x]) return ldr[x] = Find(ldr[x]);
    return ldr[x];
}

struct State {
    int x, y, xSize, ySize;
};

stack<State> s;

void Union(int x, int y) {
    x = Find(x), y = Find(y);
    if (rnk[x] < rnk[y]) swap(x, y);
    s.push({x, y, rnk[x], rnk[y]});
    if (x == y) return;
    ldr[y] = x;
    rnk[x] += rnk[y];
}

void rollback() {
    State top = s.top();
    s.pop();
    ldr[top.x] = top.x;
    ldr[top.y] = top.y;
    rnk[top.x] = top.xSize;
    rnk[top.y] = top.ySize;
}

void solve(int k, int l, int r) {
    for (auto [f, t] : sgt[k]) Union(f, t);
    if (l == r) {
        unordered_set<int> cnt;
        for (auto x : cntA[l]) cnt.insert(Find(x));
        for (auto x : cntB[l]) {
            if (!cnt.count(Find(x))) {
                flag = 0;
                break;
            }
        }
    }
    else {
        int mid = (l + r) / 2;
        solve(k * 2, l, mid);
        solve(k * 2 + 1, mid + 1, r);
    }
    for (auto [f, t] : sgt[k]) rollback();
}

void testCase() {
    int n, m;
    cin >> n >> m;
    clear();
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        cntA[a[i]].push_back(i);
    }
    for (int i = 1; i <= n; i++) {
        cin >> b[i];
        cntB[b[i]].push_back(i);
    }
    for (int i = 0; i < m; i++) {
        int f, t;
        cin >> f >> t;
        edges.push_back({f, t});
    }
    for (int i = 1; i <= n; i++) {
        if (a[i] < b[i]) {
            cout << 0 << endl;
            return;
        }
    }
    for (auto [f, t] : edges) {
        int mx = min(a[f], a[t]);
        int mn = max(b[f], b[t]);
        if (mn <= mx) update(1, 1, n, mn, mx, {f, t});
    }
    flag = 1;
    solve(1, 1, n);
    cout << flag << endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t;
    cin >> t;
    while (t--) {
        testCase();
    }
}

Compilation message

colors.cpp: In function 'void solve(int, int, int)':
colors.cpp:84:15: warning: structured binding declaration set but not used [-Wunused-but-set-variable]
   84 |     for (auto [f, t] : sgt[k]) rollback();
      |               ^~~~~~

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3032 ms 31832 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

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

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3050 ms 32052 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3050 ms 32052 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3032 ms 31832 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3038 ms 32060 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1253 ms 32080 KB Output is correct
2 Correct 107 ms 32172 KB Output is correct
3 Correct 34 ms 31832 KB Output is correct

Subtask #8
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3032 ms 31832 KB Time limit exceeded
2 Halted 0 ms 0 KB -