oj.uz

Submission #1014131

# Submission time Handle Problem Language Result Execution time Memory
1014131 2024-07-04T11:55:16 Z Ahmed_Solyman Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 146 ms 24148 KB 
/*
In the name of Allah
made by: Ahmed_Solyman
*/
#include <bits/stdc++.h>
#include <ext/rope>

using namespace std;
using namespace __gnu_cxx;
#pragma GCC optimize("-Ofast")
#pragma GCC optimize("-O1")
//-------------------------------------------------------------//
typedef long long ll;
typedef unsigned long long ull;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define PI acos(-1)
#define lb lower_bound
#define ub upper_bound
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sum_to(n) (n*(n+1))/2
#define pb push_back
#define pf push_front
#define fil(arr,x) memset(arr,x,sizeof(arr))
#define endl '\n'
const ll mod=1e9+7;
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
//-------------------------------------------------------------//
ll lcm(ll a,ll b)
{
    return (max(a,b)/__gcd(a,b))*min(a,b);
}
void person_bool(bool x)
{
    cout<<(x?"YES":"NO")<<endl;
}
void build(vector<vector<int>>b);
struct DSU{
    vector<int>P,sz;
    void init(int n){
        P.resize(n+5);
        sz.assign(n+5,1);
        for(int i=0;i<n+5;i++)P[i]=i;
    }
    int find(int node){
        if(P[node]==node)return node;
        return P[node]=find(P[node]);
    }
    bool unite(int a,int b){
        int p1=find(a);
        int p2=find(b);
        if(p1==p2){
            return 0;
        }
        if(sz[p1]>sz[p2]){
            swap(p1,p2);
        }
        P[p1]=p2;
        sz[p2]+=sz[p1];
        return 1;
    }
}dsu;
int construct(vector<vector<int>> p){
    int n=p.size();
    dsu.init(n);
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(p[i][j])dsu.unite(i,j);
        }
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(!p[i][j] && dsu.find(i)==dsu.find(j)){
                return 0;
            }
        }
    }
    vector<int>v[n];
    for(int i=0;i<n;i++)v[dsu.find(i)].push_back(i);
    vector<vector<int>>b(n,vector<int>(n));
    for(int i=0;i<n;i++){
        bool cyc=1;
        int m=(int)v[i].size();
        for(int j=1;j<m;j++){
            b[v[i][j-1]][v[i][j]]=1;
            b[v[i][j]][v[i][j-1]]=1;
            cyc&=(p[v[i][j]][v[i][j-1]]==2);
        }
        if(cyc){
            if(m>1){
                b[v[i][m-1]][v[i][0]]=1;
                b[v[i][0]][v[i][m-1]]=1;
            }
        }
    }
    build(b);
    return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1372 KB Output is correct
7 Correct 121 ms 23304 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1372 KB Output is correct
7 Correct 121 ms 23304 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1188 KB Output is correct
13 Correct 112 ms 23376 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 63 ms 9476 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 29 ms 6204 KB Output is correct
21 Correct 117 ms 23380 KB Output is correct
22 Correct 113 ms 23300 KB Output is correct
23 Correct 142 ms 23376 KB Output is correct
24 Correct 114 ms 23456 KB Output is correct
25 Correct 49 ms 8276 KB Output is correct
26 Correct 47 ms 8216 KB Output is correct
27 Correct 146 ms 22100 KB Output is correct
28 Correct 117 ms 22100 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 30 ms 6268 KB Output is correct
5 Correct 118 ms 24148 KB Output is correct
6 Correct 116 ms 24148 KB Output is correct
7 Correct 130 ms 24056 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 29 ms 6372 KB Output is correct
10 Correct 119 ms 24148 KB Output is correct
11 Correct 119 ms 24148 KB Output is correct
12 Correct 125 ms 24148 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Incorrect 0 ms 348 KB Too many ways to get from 0 to 4, should be 1 found no less than 2
16 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1372 KB Output is correct
7 Correct 121 ms 23304 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1188 KB Output is correct
13 Correct 112 ms 23376 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 63 ms 9476 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 29 ms 6204 KB Output is correct
21 Correct 117 ms 23380 KB Output is correct
22 Correct 113 ms 23300 KB Output is correct
23 Correct 142 ms 23376 KB Output is correct
24 Correct 114 ms 23456 KB Output is correct
25 Correct 49 ms 8276 KB Output is correct
26 Correct 47 ms 8216 KB Output is correct
27 Correct 146 ms 22100 KB Output is correct
28 Correct 117 ms 22100 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1372 KB Output is correct
7 Correct 121 ms 23304 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1188 KB Output is correct
13 Correct 112 ms 23376 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 63 ms 9476 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 29 ms 6204 KB Output is correct
21 Correct 117 ms 23380 KB Output is correct
22 Correct 113 ms 23300 KB Output is correct
23 Correct 142 ms 23376 KB Output is correct
24 Correct 114 ms 23456 KB Output is correct
25 Correct 49 ms 8276 KB Output is correct
26 Correct 47 ms 8216 KB Output is correct
27 Correct 146 ms 22100 KB Output is correct
28 Correct 117 ms 22100 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -