oj.uz

Submission #1014448

# Submission time Handle Problem Language Result Execution time Memory
1014448 2024-07-04T21:48:28 Z Ahmed_Solyman Connecting Supertrees (IOI20_supertrees) C++14
40 / 100
 140 ms 24212 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;
    }
}d,dsu,dsu2;
int construct(vector<vector<int>> p){
    int n=p.size();
    dsu.init(n);
    dsu2.init(n);
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(p[i][j]==1)dsu.unite(i,j);
            if(p[i][j]==2)dsu2.unite(i,j);
        }
    }
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            if(!p[i][j] && (dsu.find(i)==dsu.find(j) || dsu2.find(i)==dsu2.find(j))){
                return 0;
            }
            if(dsu.find(i)==dsu.find(j) && dsu2.find(i)==dsu2.find(j) && i==0 && j==1){
                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++){
        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;
        }
    }
    for(int i=0;i<n;i++){
        v[i].clear();
    }
    for(int i=0;i<n;i++)v[dsu2.find(i)].push_back(i);
    d.init(n);
    for(int i=0;i<n;i++){
        int m=(int)v[i].size();
        if(m<=1)continue;
        for(int j=1;j<m;j++){
            b[dsu.find(v[i][j-1])][dsu.find(v[i][j])]=1;
            b[dsu.find(v[i][j])][dsu.find(v[i][j-1])]=1;
            d.unite(dsu.find(v[i][j-1]),dsu.find(v[i][j]));
        }
        if(m==2){
            return 0;
        }
        b[dsu.find(v[i][0])][dsu.find(v[i][m-1])]=1;
        b[dsu.find(v[i][m-1])][dsu.find(v[i][0])]=1;
        d.unite(dsu.find(v[i][0]),dsu.find(v[i][m-1]));
    }
    build(b);
    return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 1212 KB Output is correct
7 Correct 106 ms 24136 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 1212 KB Output is correct
7 Correct 106 ms 24136 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 440 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 436 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 126 ms 24184 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 840 KB Output is correct
17 Correct 59 ms 10064 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 43 ms 6336 KB Output is correct
21 Correct 121 ms 24144 KB Output is correct
22 Correct 138 ms 24148 KB Output is correct
23 Correct 126 ms 24144 KB Output is correct
24 Correct 115 ms 24056 KB Output is correct
25 Correct 49 ms 10068 KB Output is correct
26 Correct 65 ms 10120 KB Output is correct
27 Correct 131 ms 24144 KB Output is correct
28 Correct 115 ms 24148 KB Output is correct

Subtask #3
19.0 / 19.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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 5 ms 1372 KB Output is correct
9 Correct 121 ms 24168 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 1372 KB Output is correct
13 Correct 128 ms 24020 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 61 ms 10228 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 436 KB Output is correct
21 Correct 30 ms 6272 KB Output is correct
22 Correct 130 ms 24144 KB Output is correct
23 Correct 108 ms 24180 KB Output is correct
24 Correct 116 ms 24144 KB Output is correct
25 Correct 47 ms 14164 KB Output is correct
26 Correct 46 ms 10116 KB Output is correct
27 Correct 117 ms 24148 KB Output is correct
28 Correct 123 ms 24212 KB Output is correct
29 Correct 53 ms 14160 KB Output is correct

Subtask #4
0 / 35.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 604 KB Output is correct
4 Correct 30 ms 6272 KB Output is correct
5 Correct 125 ms 24144 KB Output is correct
6 Correct 121 ms 24144 KB Output is correct
7 Correct 115 ms 24152 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 29 ms 6224 KB Output is correct
10 Correct 140 ms 24144 KB Output is correct
11 Correct 104 ms 24152 KB Output is correct
12 Correct 121 ms 24144 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Incorrect 0 ms 348 KB Too few ways to get from 0 to 1, should be 2 found 1
16 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 1212 KB Output is correct
7 Correct 106 ms 24136 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 440 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 436 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 126 ms 24184 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 840 KB Output is correct
17 Correct 59 ms 10064 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 43 ms 6336 KB Output is correct
21 Correct 121 ms 24144 KB Output is correct
22 Correct 138 ms 24148 KB Output is correct
23 Correct 126 ms 24144 KB Output is correct
24 Correct 115 ms 24056 KB Output is correct
25 Correct 49 ms 10068 KB Output is correct
26 Correct 65 ms 10120 KB Output is correct
27 Correct 131 ms 24144 KB Output is correct
28 Correct 115 ms 24148 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 5 ms 1372 KB Output is correct
37 Correct 121 ms 24168 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 5 ms 1372 KB Output is correct
41 Correct 128 ms 24020 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 604 KB Output is correct
45 Correct 61 ms 10228 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 436 KB Output is correct
49 Correct 30 ms 6272 KB Output is correct
50 Correct 130 ms 24144 KB Output is correct
51 Correct 108 ms 24180 KB Output is correct
52 Correct 116 ms 24144 KB Output is correct
53 Correct 47 ms 14164 KB Output is correct
54 Correct 46 ms 10116 KB Output is correct
55 Correct 117 ms 24148 KB Output is correct
56 Correct 123 ms 24212 KB Output is correct
57 Correct 53 ms 14160 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 2 ms 604 KB Output is correct
61 Correct 54 ms 10100 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Incorrect 27 ms 6408 KB b[50][50] is not 0
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 1212 KB Output is correct
7 Correct 106 ms 24136 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 440 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 436 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 126 ms 24184 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 840 KB Output is correct
17 Correct 59 ms 10064 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 43 ms 6336 KB Output is correct
21 Correct 121 ms 24144 KB Output is correct
22 Correct 138 ms 24148 KB Output is correct
23 Correct 126 ms 24144 KB Output is correct
24 Correct 115 ms 24056 KB Output is correct
25 Correct 49 ms 10068 KB Output is correct
26 Correct 65 ms 10120 KB Output is correct
27 Correct 131 ms 24144 KB Output is correct
28 Correct 115 ms 24148 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 5 ms 1372 KB Output is correct
37 Correct 121 ms 24168 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 5 ms 1372 KB Output is correct
41 Correct 128 ms 24020 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 604 KB Output is correct
45 Correct 61 ms 10228 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 436 KB Output is correct
49 Correct 30 ms 6272 KB Output is correct
50 Correct 130 ms 24144 KB Output is correct
51 Correct 108 ms 24180 KB Output is correct
52 Correct 116 ms 24144 KB Output is correct
53 Correct 47 ms 14164 KB Output is correct
54 Correct 46 ms 10116 KB Output is correct
55 Correct 117 ms 24148 KB Output is correct
56 Correct 123 ms 24212 KB Output is correct
57 Correct 53 ms 14160 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 604 KB Output is correct
61 Correct 30 ms 6272 KB Output is correct
62 Correct 125 ms 24144 KB Output is correct
63 Correct 121 ms 24144 KB Output is correct
64 Correct 115 ms 24152 KB Output is correct
65 Correct 1 ms 344 KB Output is correct
66 Correct 29 ms 6224 KB Output is correct
67 Correct 140 ms 24144 KB Output is correct
68 Correct 104 ms 24152 KB Output is correct
69 Correct 121 ms 24144 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Incorrect 0 ms 348 KB Too few ways to get from 0 to 1, should be 2 found 1
73 Halted 0 ms 0 KB -