oj.uz

Submission #968712

# Submission time Handle Problem Language Result Execution time Memory
968712 2024-04-23T22:29:20 Z MarwenElarbi Simurgh (IOI17_simurgh) C++17
13 / 100
 683 ms 456 KB 
#include <bits/stdc++.h>
using namespace std;
int count_common_roads(const std::vector<int>& r);
vector<int> adj[250];
vector<int> p(250);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int f(int x){
    if(x==p[x]) return x;
    return p[x]=f(p[x]);
}
bool sameset(int x,int y){
    return f(x)==f(y);
}
void joinset(int x,int y){
    x=f(x);
    y=f(y);
    p[x]=y;
}
std::vector<int> find_roads(int n, std::vector<int> u, std::vector<int> v){
    int m=u.size();
    vector<int> permutation(m);
    for (int i = 0; i < m; ++i)
    {
        permutation[i]=i;
    }
    while(true){
        vector<int> cur;
        shuffle(permutation.begin(),permutation.end(),rng);
        /*for (int i = 0; i < m; ++i)
        {
            cout <<permutation[i]<<" ";
        }cout <<endl;*/
        for (int i = 0; i < n; ++i)
        {
            p[i]=i;
        }
        for (int i = 0; i < m; ++i)
        {
            int x=u[permutation[i]];
            int y=v[permutation[i]];
            if(!sameset(x,y)){
                joinset(x,y);
                cur.push_back(permutation[i]);
            }
        }
        /*for (int i = 0; i < n-1; ++i)
        {
            cout <<cur[i]<<" ";
        }cout <<endl;*/
        int cnt=count_common_roads(cur);
        
        if(cnt==n-1) return(cur);       
    }
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 348 KB correct
2 Correct 10 ms 348 KB correct
3 Correct 6 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 2 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 0 ms 348 KB correct
10 Correct 1 ms 348 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 1 ms 348 KB correct
13 Correct 6 ms 348 KB correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 348 KB correct
2 Correct 10 ms 348 KB correct
3 Correct 6 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 2 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 0 ms 348 KB correct
10 Correct 1 ms 348 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 1 ms 348 KB correct
13 Correct 6 ms 348 KB correct
14 Incorrect 683 ms 456 KB WA in grader: NO
15 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 348 KB correct
2 Correct 10 ms 348 KB correct
3 Correct 6 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 2 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 0 ms 348 KB correct
10 Correct 1 ms 348 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 1 ms 348 KB correct
13 Correct 6 ms 348 KB correct
14 Incorrect 683 ms 456 KB WA in grader: NO
15 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 348 KB correct
2 Correct 10 ms 348 KB correct
3 Correct 6 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 2 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 0 ms 348 KB correct
10 Correct 1 ms 348 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 1 ms 348 KB correct
13 Correct 6 ms 348 KB correct
14 Incorrect 683 ms 456 KB WA in grader: NO
15 Halted 0 ms 0 KB -