oj.uz

Submission #992466

# Submission time Handle Problem Language Result Execution time Memory
992466 2024-06-04T13:46:37 Z MuntherCarrot Simurgh (IOI17_simurgh) C++14
0 / 100
 0 ms 596 KB 
#include <bits/stdc++.h>
#include "simurgh.h"
using namespace std;

#define ll long long
#define all(x) x.begin(), x.end()

struct dsu{
    vector<int> p, sz;
    dsu(int n){
        p.resize(n);
        iota(all(p), 0);
        sz.resize(n, 1);
    }
    int find(int x){
        return x == p[x] ? x : p[x] = find(p[x]);
    }
    void merge(int a, int b){
        a = find(a);
        b = find(b);
        p[b] = a;
        sz[a] += sz[b];
    }
    int size(){
        return *max_element(all(sz));
    }
};

// int count_common_roads(const std::vector<int>& r){
//     for(int i : r) cout << i << ' ';
//     cout << endl;
//     int x; cin >> x; return x;
// }

vector<int> find_roads(int n, vector<int> u, vector<int> v){
    string prm = string(u.size() - n + 1, '0') + string(n - 1, '1');
    do{
        vector<int> vec;
        dsu A(n);
        for(int i = 0; i < (int)u.size(); i++){
            if(prm[i] == '1'){
                vec.push_back(i);
                A.merge(u[i], v[i]);
            }
        }
        if(A.size() != n) continue;
        if(count_common_roads(vec) == n - 1){
            return vec;
        }
    }while(next_permutation(all(prm)));
    return {};
}

// int main(){
//     ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0);
//     find_roads(4, {0, 0, 0, 1, 1, 2}, {1, 2, 3, 2, 3, 3});
//     return 0;
// }

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 596 KB correct
2 Incorrect 0 ms 344 KB WA in grader: NO
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB WA in grader: NO
2 Halted 0 ms 0 KB -