oj.uz

Submission #1043378

# Submission time Handle Problem Language Result Execution time Memory
1043378 2024-08-04T08:57:18 Z Pekiban Pipes (CEOI15_pipes) C++14
60 / 100
 631 ms 44884 KB 
#include <bits/stdc++.h>
    
using namespace std;
#define pb push_back
    
const int N = 1e5+5;
mt19937 rng(time(0));
// upravo sam imao najgenijalniju ideju svih vremena
vector<int> g[N];
int p[N], dp[N], vis[N];
int get(int x) {
    if (x == p[x])  return x;
    return p[x] = get(p[x]);
}
bool unite(int u, int v) {
    if (get(u) == get(v))   return 0;
    p[get(v)] = get(u);
    g[u].pb(v); g[v].pb(u);
    return 1;
}
void upd(int u, int v) {
    int x = rng() % (1LL << 31);
    dp[u] ^= x;
    dp[v] ^= x;
}
void dfs(int &s, int &e) {
    for (auto &u : g[s]) {
        if (u == e) continue;
        dfs(u, s);
        dp[s] ^= dp[u];
    }
    if (e && !dp[s])    cout << e << ' ' << s << '\n';
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    iota(p, p+N, 0);
    int n, m;
    cin >> n >> m;
    int u, v;
    for (int i = 0; i < m; ++i) {
        cin >> u >> v;
        if (!unite(u, v))   upd(u, v);
    }
    for (int i = 1; i <= n; ++i) {
        if (!vis[get(i)]) {
            int p = get(i), z = 0;
            dfs(p, z);
            vis[get(i)] = 1;
        }
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3672 KB Output is correct
2 Correct 1 ms 3676 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3948 KB Output is correct
2 Correct 2 ms 3932 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 3672 KB Output is correct
2 Correct 49 ms 3892 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 4088 KB Output is correct
2 Correct 102 ms 4184 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 4528 KB Output is correct
2 Correct 128 ms 4692 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 5976 KB Output is correct
2 Correct 179 ms 15376 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 6236 KB Output is correct
2 Runtime error 325 ms 23308 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 390 ms 6740 KB Output is correct
2 Runtime error 377 ms 27732 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 481 ms 6916 KB Output is correct
2 Runtime error 529 ms 33360 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 606 ms 6736 KB Output is correct
2 Runtime error 631 ms 44884 KB Memory limit exceeded
3 Halted 0 ms 0 KB -