oj.uz

Submission #301260

# Submission time Handle Problem Language Result Execution time Memory
301260 2020-09-17T19:11:27 Z M4mou Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 263 ms 22264 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;

#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define inf 1000000000
#define sz(x) (ll)x.size()
#define boost ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
typedef long long ll;
typedef unsigned long long ull;
typedef  double ld;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef pair< int , pii> piii;
typedef pair<int,bool> pib;
typedef vector<pii> vii;
typedef vector<pib> vib;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef pair<string,string> pss;
typedef vector<pss> vss;
typedef pair<ld , ld> pdd;
typedef vector<ld> vd;
typedef vector<vector<pib>> vvib;
typedef vector<piii> viii;
typedef vector<viii> vviii;
typedef vector<bool> vb;
typedef pair<pii , bool> piib;
typedef vector<pair<pii , bool>> viib;
const int MOD = 1e9 + 7; //998244353;
const int MAXN = 100005;

int n;
struct UnionFind{
public:
    vi par;
    UnionFind(){
        for(int i = 0;i<n;i++)par[i] = i;
    }
    void init(){
        par.resize(n);
        for(int i = 0;i<n;i++)par[i] = i;
    }
    int findset(int x){
        if(par[x] == x)return x;
        return par[x] = findset(par[x]);
    }
    void Union(int x , int y){
        x = findset(x);
        y = findset(y);
        if(x != y){
            par[x] = y;
        }
    }
};

UnionFind components;
UnionFind branches;

vvi ans;
bool v[1005];
bool v0[1005];
int construct(vvi p){

    n = p.size();
    ans.assign(n ,vi(n ,0));
    components.init();

    branches.init();
    memset(v , 0 , 1005);
    for(int i = 0;i<n;i++){
        for(int j = 0;j<n;j++){
            if(p[i][j] == 3)return 0;
            if(p[i][j] >= 1)components.Union(i, j);
            if(p[i][j] == 1)branches.Union(i,j);
        }
    }

    for(int i = 0;i<n;i++){
        int c = 0;
        for(int j = 0;j<n;j++){
            if(p[i][j] == 0){
                if(components.findset(i) == components.findset(j))return 0;
            }
            if(p[i][j] == 2 && branches.findset(i) == branches.findset(j))return 0;
            if(p[i][j] == 2){
                int y = branches.findset(j);
                if(v[y])continue;
                v[y] = 1;
                c++;
            }
        }
        if(c == 1)return 0;
        memset(v , 0 , sizeof v);
    }
    memset(v0 , 0 , 1005);
    for(int i = 0;i<n;i++){
        int x = branches.findset(i);
        if(v[x])continue;
        vi res;
        for(int j = 0;j<n;j++){
            if(branches.findset(j) == x)res.pb(j);
        }
        v[x] = 1;
        if(res.size() <= 1)continue;
        for(int j = 0;j<res.size()-1;j++){
            ans[res[j]][res[j+1]] = 1;
            ans[res[j+1]][res[j]] = 1;
        }
    }
    memset(v , 0 , 1005);
    for(int i = 0;i<n;i++){
        int x = components.findset(i);
        if(v0[x])continue;
        vi res;
        v0[x] = 1;
        for(int j = 0;j<n;j++){
            int y = branches.findset(j);
            if(components.findset(y) == x && !v[y]){
                res.pb(y);
                v[y] = 1;
            }
        }
        if(res.size() <= 1)continue;
        for(int j = 0;j<res.size()-1;j++){
            ans[res[j]][res[j+1]] = 1;
            ans[res[j+1]][res[j]] = 1;
        }
        ans[res.front()][res.back()] = 1;
        ans[res.back()][res.front()] = 1;
    }
    build(ans);

    return 1;
}

//NEVER GIVE UP
//LONG LONG

Compilation message

supertrees.cpp: In function 'int construct(vvi)':
supertrees.cpp:112:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |         for(int j = 0;j<res.size()-1;j++){
      |                       ~^~~~~~~~~~~~~
supertrees.cpp:131:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  131 |         for(int j = 0;j<res.size()-1;j++){
      |                       ~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 10 ms 1152 KB Output is correct
7 Correct 241 ms 22264 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 10 ms 1152 KB Output is correct
7 Correct 241 ms 22264 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 238 ms 22136 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 111 ms 12212 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 60 ms 5752 KB Output is correct
21 Correct 245 ms 22264 KB Output is correct
22 Correct 242 ms 22136 KB Output is correct
23 Correct 263 ms 22136 KB Output is correct
24 Correct 249 ms 22136 KB Output is correct
25 Correct 99 ms 12152 KB Output is correct
26 Correct 95 ms 12116 KB Output is correct
27 Correct 253 ms 22136 KB Output is correct
28 Correct 241 ms 22136 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 10 ms 1152 KB Output is correct
9 Correct 242 ms 22264 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 248 ms 22136 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 111 ms 12152 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 62 ms 5852 KB Output is correct
22 Correct 260 ms 22136 KB Output is correct
23 Correct 243 ms 22140 KB Output is correct
24 Correct 259 ms 22136 KB Output is correct
25 Correct 102 ms 12152 KB Output is correct
26 Correct 100 ms 12120 KB Output is correct
27 Correct 240 ms 22104 KB Output is correct
28 Correct 257 ms 22100 KB Output is correct
29 Correct 97 ms 12152 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 61 ms 5880 KB Output is correct
5 Correct 238 ms 22136 KB Output is correct
6 Correct 241 ms 22136 KB Output is correct
7 Correct 253 ms 22264 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 62 ms 5752 KB Output is correct
10 Correct 244 ms 22136 KB Output is correct
11 Correct 242 ms 22136 KB Output is correct
12 Correct 257 ms 22104 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 64 ms 5880 KB Output is correct
17 Correct 248 ms 22136 KB Output is correct
18 Correct 245 ms 22264 KB Output is correct
19 Correct 239 ms 22140 KB Output is correct
20 Correct 238 ms 22136 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 10 ms 1152 KB Output is correct
7 Correct 241 ms 22264 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 238 ms 22136 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 111 ms 12212 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 60 ms 5752 KB Output is correct
21 Correct 245 ms 22264 KB Output is correct
22 Correct 242 ms 22136 KB Output is correct
23 Correct 263 ms 22136 KB Output is correct
24 Correct 249 ms 22136 KB Output is correct
25 Correct 99 ms 12152 KB Output is correct
26 Correct 95 ms 12116 KB Output is correct
27 Correct 253 ms 22136 KB Output is correct
28 Correct 241 ms 22136 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 10 ms 1152 KB Output is correct
37 Correct 242 ms 22264 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 11 ms 1152 KB Output is correct
41 Correct 248 ms 22136 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 111 ms 12152 KB Output is correct
46 Correct 0 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 0 ms 256 KB Output is correct
49 Correct 62 ms 5852 KB Output is correct
50 Correct 260 ms 22136 KB Output is correct
51 Correct 243 ms 22140 KB Output is correct
52 Correct 259 ms 22136 KB Output is correct
53 Correct 102 ms 12152 KB Output is correct
54 Correct 100 ms 12120 KB Output is correct
55 Correct 240 ms 22104 KB Output is correct
56 Correct 257 ms 22100 KB Output is correct
57 Correct 97 ms 12152 KB Output is correct
58 Correct 0 ms 256 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 5 ms 768 KB Output is correct
61 Correct 119 ms 12280 KB Output is correct
62 Correct 0 ms 256 KB Output is correct
63 Correct 0 ms 256 KB Output is correct
64 Correct 0 ms 256 KB Output is correct
65 Correct 62 ms 5836 KB Output is correct
66 Correct 98 ms 12152 KB Output is correct
67 Correct 102 ms 12152 KB Output is correct
68 Correct 135 ms 12152 KB Output is correct
69 Correct 96 ms 12152 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 10 ms 1152 KB Output is correct
7 Correct 241 ms 22264 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 238 ms 22136 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 111 ms 12212 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 60 ms 5752 KB Output is correct
21 Correct 245 ms 22264 KB Output is correct
22 Correct 242 ms 22136 KB Output is correct
23 Correct 263 ms 22136 KB Output is correct
24 Correct 249 ms 22136 KB Output is correct
25 Correct 99 ms 12152 KB Output is correct
26 Correct 95 ms 12116 KB Output is correct
27 Correct 253 ms 22136 KB Output is correct
28 Correct 241 ms 22136 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 10 ms 1152 KB Output is correct
37 Correct 242 ms 22264 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 11 ms 1152 KB Output is correct
41 Correct 248 ms 22136 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 111 ms 12152 KB Output is correct
46 Correct 0 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 0 ms 256 KB Output is correct
49 Correct 62 ms 5852 KB Output is correct
50 Correct 260 ms 22136 KB Output is correct
51 Correct 243 ms 22140 KB Output is correct
52 Correct 259 ms 22136 KB Output is correct
53 Correct 102 ms 12152 KB Output is correct
54 Correct 100 ms 12120 KB Output is correct
55 Correct 240 ms 22104 KB Output is correct
56 Correct 257 ms 22100 KB Output is correct
57 Correct 97 ms 12152 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 1 ms 256 KB Output is correct
61 Correct 61 ms 5880 KB Output is correct
62 Correct 238 ms 22136 KB Output is correct
63 Correct 241 ms 22136 KB Output is correct
64 Correct 253 ms 22264 KB Output is correct
65 Correct 0 ms 256 KB Output is correct
66 Correct 62 ms 5752 KB Output is correct
67 Correct 244 ms 22136 KB Output is correct
68 Correct 242 ms 22136 KB Output is correct
69 Correct 257 ms 22104 KB Output is correct
70 Correct 0 ms 256 KB Output is correct
71 Correct 0 ms 256 KB Output is correct
72 Correct 1 ms 256 KB Output is correct
73 Correct 64 ms 5880 KB Output is correct
74 Correct 248 ms 22136 KB Output is correct
75 Correct 245 ms 22264 KB Output is correct
76 Correct 239 ms 22140 KB Output is correct
77 Correct 238 ms 22136 KB Output is correct
78 Correct 0 ms 256 KB Output is correct
79 Correct 1 ms 256 KB Output is correct
80 Correct 5 ms 768 KB Output is correct
81 Correct 119 ms 12280 KB Output is correct
82 Correct 0 ms 256 KB Output is correct
83 Correct 0 ms 256 KB Output is correct
84 Correct 0 ms 256 KB Output is correct
85 Correct 62 ms 5836 KB Output is correct
86 Correct 98 ms 12152 KB Output is correct
87 Correct 102 ms 12152 KB Output is correct
88 Correct 135 ms 12152 KB Output is correct
89 Correct 96 ms 12152 KB Output is correct
90 Correct 0 ms 256 KB Output is correct
91 Correct 1 ms 256 KB Output is correct
92 Correct 5 ms 768 KB Output is correct
93 Correct 100 ms 12152 KB Output is correct
94 Correct 0 ms 256 KB Output is correct
95 Correct 0 ms 256 KB Output is correct
96 Correct 1 ms 256 KB Output is correct
97 Correct 35 ms 3320 KB Output is correct
98 Correct 103 ms 12152 KB Output is correct
99 Correct 108 ms 12152 KB Output is correct
100 Correct 94 ms 12152 KB Output is correct
101 Correct 96 ms 12100 KB Output is correct
102 Correct 100 ms 12152 KB Output is correct
103 Correct 103 ms 12152 KB Output is correct
104 Correct 97 ms 12120 KB Output is correct
105 Correct 106 ms 12124 KB Output is correct