oj.uz

답안 #1014467

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1014467 2024-07-05T01:38:32 Z Ahmed_Solyman 슈퍼트리 잇기 (IOI20_supertrees) C++14
100 / 100
 127 ms 24196 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,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=i+1;j<n;j++){
            if(p[i][j]==1)dsu.unite(i,j);
            if(p[i][j]==3)return 0;
        }
    }
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            if(p[i][j]!=1 && dsu.find(i)==dsu.find(j)){
                return 0;
            }
            if(p[i][j]==2)dsu2.unite(dsu.find(i),dsu.find(j));
        }
    }
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            if(p[i][j]==0 && dsu2.find(i)==dsu2.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++){
        int m=(int)v[i].size();
        for(int j=1;j<m;j++){
            b[v[i][0]][v[i][j]]=1;
            b[v[i][j]][v[i][0]]=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);
    for(int i=0;i<n;i++){
        int m=(int)v[i].size();
        if(m<=1)continue;
        if(m==2){
            return 0;
        }
        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;
        }
        b[v[i][0]][v[i][m-1]]=1;
        b[v[i][m-1]][v[i][0]]=1;
    }
    build(b);
    return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 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 114 ms 24084 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 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 114 ms 24084 KB Output is correct
8 Correct 1 ms 344 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 4 ms 1188 KB Output is correct
13 Correct 119 ms 24108 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 604 KB Output is correct
17 Correct 58 ms 10120 KB Output is correct
18 Correct 0 ms 504 KB Output is correct
19 Correct 0 ms 420 KB Output is correct
20 Correct 38 ms 6368 KB Output is correct
21 Correct 124 ms 24156 KB Output is correct
22 Correct 105 ms 24144 KB Output is correct
23 Correct 124 ms 24144 KB Output is correct
24 Correct 115 ms 24188 KB Output is correct
25 Correct 43 ms 10120 KB Output is correct
26 Correct 44 ms 10064 KB Output is correct
27 Correct 114 ms 24148 KB Output is correct
28 Correct 105 ms 24004 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 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 1 ms 428 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 6 ms 1368 KB Output is correct
9 Correct 116 ms 24068 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 8 ms 1196 KB Output is correct
13 Correct 108 ms 24196 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 71 ms 10120 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 348 KB Output is correct
21 Correct 34 ms 6248 KB Output is correct
22 Correct 116 ms 24068 KB Output is correct
23 Correct 124 ms 23980 KB Output is correct
24 Correct 114 ms 23980 KB Output is correct
25 Correct 45 ms 14164 KB Output is correct
26 Correct 43 ms 10248 KB Output is correct
27 Correct 104 ms 24064 KB Output is correct
28 Correct 127 ms 24148 KB Output is correct
29 Correct 42 ms 14160 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 30 ms 6324 KB Output is correct
5 Correct 108 ms 24072 KB Output is correct
6 Correct 109 ms 24144 KB Output is correct
7 Correct 110 ms 24148 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 29 ms 6244 KB Output is correct
10 Correct 112 ms 24184 KB Output is correct
11 Correct 118 ms 23976 KB Output is correct
12 Correct 126 ms 24108 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 29 ms 6228 KB Output is correct
17 Correct 120 ms 24064 KB Output is correct
18 Correct 119 ms 24152 KB Output is correct
19 Correct 110 ms 24196 KB Output is correct
20 Correct 115 ms 24144 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 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 114 ms 24084 KB Output is correct
8 Correct 1 ms 344 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 4 ms 1188 KB Output is correct
13 Correct 119 ms 24108 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 604 KB Output is correct
17 Correct 58 ms 10120 KB Output is correct
18 Correct 0 ms 504 KB Output is correct
19 Correct 0 ms 420 KB Output is correct
20 Correct 38 ms 6368 KB Output is correct
21 Correct 124 ms 24156 KB Output is correct
22 Correct 105 ms 24144 KB Output is correct
23 Correct 124 ms 24144 KB Output is correct
24 Correct 115 ms 24188 KB Output is correct
25 Correct 43 ms 10120 KB Output is correct
26 Correct 44 ms 10064 KB Output is correct
27 Correct 114 ms 24148 KB Output is correct
28 Correct 105 ms 24004 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 1 ms 428 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 6 ms 1368 KB Output is correct
37 Correct 116 ms 24068 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 8 ms 1196 KB Output is correct
41 Correct 108 ms 24196 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 2 ms 604 KB Output is correct
45 Correct 71 ms 10120 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 348 KB Output is correct
49 Correct 34 ms 6248 KB Output is correct
50 Correct 116 ms 24068 KB Output is correct
51 Correct 124 ms 23980 KB Output is correct
52 Correct 114 ms 23980 KB Output is correct
53 Correct 45 ms 14164 KB Output is correct
54 Correct 43 ms 10248 KB Output is correct
55 Correct 104 ms 24064 KB Output is correct
56 Correct 127 ms 24148 KB Output is correct
57 Correct 42 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 5 ms 604 KB Output is correct
61 Correct 53 ms 10236 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 28 ms 6408 KB Output is correct
66 Correct 47 ms 10064 KB Output is correct
67 Correct 69 ms 10064 KB Output is correct
68 Correct 47 ms 10068 KB Output is correct
69 Correct 50 ms 14160 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 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 114 ms 24084 KB Output is correct
8 Correct 1 ms 344 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 4 ms 1188 KB Output is correct
13 Correct 119 ms 24108 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 604 KB Output is correct
17 Correct 58 ms 10120 KB Output is correct
18 Correct 0 ms 504 KB Output is correct
19 Correct 0 ms 420 KB Output is correct
20 Correct 38 ms 6368 KB Output is correct
21 Correct 124 ms 24156 KB Output is correct
22 Correct 105 ms 24144 KB Output is correct
23 Correct 124 ms 24144 KB Output is correct
24 Correct 115 ms 24188 KB Output is correct
25 Correct 43 ms 10120 KB Output is correct
26 Correct 44 ms 10064 KB Output is correct
27 Correct 114 ms 24148 KB Output is correct
28 Correct 105 ms 24004 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 1 ms 428 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 6 ms 1368 KB Output is correct
37 Correct 116 ms 24068 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 8 ms 1196 KB Output is correct
41 Correct 108 ms 24196 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 2 ms 604 KB Output is correct
45 Correct 71 ms 10120 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 348 KB Output is correct
49 Correct 34 ms 6248 KB Output is correct
50 Correct 116 ms 24068 KB Output is correct
51 Correct 124 ms 23980 KB Output is correct
52 Correct 114 ms 23980 KB Output is correct
53 Correct 45 ms 14164 KB Output is correct
54 Correct 43 ms 10248 KB Output is correct
55 Correct 104 ms 24064 KB Output is correct
56 Correct 127 ms 24148 KB Output is correct
57 Correct 42 ms 14160 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 1 ms 344 KB Output is correct
61 Correct 30 ms 6324 KB Output is correct
62 Correct 108 ms 24072 KB Output is correct
63 Correct 109 ms 24144 KB Output is correct
64 Correct 110 ms 24148 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 29 ms 6244 KB Output is correct
67 Correct 112 ms 24184 KB Output is correct
68 Correct 118 ms 23976 KB Output is correct
69 Correct 126 ms 24108 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 29 ms 6228 KB Output is correct
74 Correct 120 ms 24064 KB Output is correct
75 Correct 119 ms 24152 KB Output is correct
76 Correct 110 ms 24196 KB Output is correct
77 Correct 115 ms 24144 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 5 ms 604 KB Output is correct
81 Correct 53 ms 10236 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 28 ms 6408 KB Output is correct
86 Correct 47 ms 10064 KB Output is correct
87 Correct 69 ms 10064 KB Output is correct
88 Correct 47 ms 10068 KB Output is correct
89 Correct 50 ms 14160 KB Output is correct
90 Correct 0 ms 348 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 3 ms 604 KB Output is correct
93 Correct 53 ms 10120 KB Output is correct
94 Correct 1 ms 604 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 1 ms 348 KB Output is correct
97 Correct 10 ms 2908 KB Output is correct
98 Correct 45 ms 10124 KB Output is correct
99 Correct 49 ms 10248 KB Output is correct
100 Correct 58 ms 10064 KB Output is correct
101 Correct 46 ms 10120 KB Output is correct
102 Correct 47 ms 10248 KB Output is correct
103 Correct 42 ms 10064 KB Output is correct
104 Correct 45 ms 10248 KB Output is correct
105 Correct 53 ms 10068 KB Output is correct