oj.uz

Submission #1070073

# Submission time Handle Problem Language Result Execution time Memory
1070073 2024-08-22T11:28:47 Z hasan2006 Connecting Supertrees (IOI20_supertrees) C++17
96 / 100
 206 ms 23648 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define se second
#define fi first
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N = 2e5 + 9 , mod = 1e9 + 7;
ll a[N] ,  b[N] , dp[N];

//int press(string a){}
int construct(vector<vector<int>> v){
    ll i , j , l , r , s  = 0, f , n , m , x , y , k;
    n = v.size();
    vector<vector<int>>c(n);
    for(i = 0; i < n; i++)
        c[i].resize(n);
    for(i = 0; i < n; i++){
        if(b[i] != 0)
            continue;
        vector<pair<int,pair<int,int>>>vc;
        vector<int>v1 , v2 , v3;
        for(j = 0; j < n; j++)
            if(v[i][j] != 0)
                b[j] = 1 , v1.pb(j);
        l = r = 0;
        for(x = 0; x < v1.size(); x++){
            if(b[v1[x]] != 2)
                b[v1[x]] = 3;
            f = v1[x];
            vector<int>vv;
            vv.pb(f);
            for(y = x + 1; y < v1.size(); y++){
                vc.pb({v[v1[x]][v1[y]] , {v1[x] , v1[y]}});
                if(v[v1[x]][v1[y]] == 2)
                    l = 1;
                else if(v[v1[x]][v1[y]] == 3)
                    r = 1;
                else if(b[v1[x]] == 3){
                    if(b[v1[y]] == 2)
                        return 0;
                    c[v1[y]][f] = c[f][v1[y]] = 1;
                    b[v1[y]] = 2;
                    f = v1[y];
                    vv.pb(f);
                }
            }
            if(b[v1[x]] == 3)
            for(auto to : vv){
                s= f =  0;
                for(auto to1:vv)
                if(v[to][to1] != 1)
                    return 0;
                for(j = 0; j < n; j++)
                    if(v[to][j] == 1)
                    s++;
                    else if(v[to][j])
                    f++;

                if(s != vv.size() || s + f != v1.size())
                    return 0;
            }
        }
        sort(all(vc));
        if(v1.size() == 1)
            continue;
        if((l == 1 && r == 1) || vc.front().fi == 0)
            return 0;
        set<int>st;
        for(auto to : v1){
            st.insert(to);
            if(b[to] == 3)
                v2.pb(to);
            else
                v3.pb(to);
        }
        if(l + r > 0){
            if(v2.size() <= vc.back().fi){
                return 0;
            }
            f = v2.back();
            for(auto to : v2)
                c[f][to] = c[to][f] = 1 , f = to;
            if(vc.back().fi == 3)
                c[v2[0]][v2[2]] = c[v2[2]][v2[0]] = 1;
        }
        for(auto to : v1){
            ll L = 0 ,R = 0 , s =0;
            for(j = 0; j < n ; j++)
                if(v[to][j] != 0){
                    if(st.find(j) == st.end())
                        return 0;
                    s++;
                    if(to == j)
                        continue;
                    if(v[to][j] == 2)
                        L = 1;
                    else if(v[to][j] == 3)
                        R = 1;
                }
            if((L > l) || (R > r) || s != v1.size())
                return 0;
        }
    }
 //   for(i = 0; i < n; i++){
 //       for(j = 0; j < n; j++)
 //           cout<<c[i][j]<<" ";
 //       cout<<"\n";
   // }
    build(c);
    return 1;
}

/*
int main(){
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
    cout<<construct({{1, 1, 2, 2}, {1, 1, 2, 2}, {2, 2, 1, 2}, {2, 2, 2, 1}});
}*/
// Author : حسن

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:41:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |         for(x = 0; x < v1.size(); x++){
      |                    ~~^~~~~~~~~~~
supertrees.cpp:47:30: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |             for(y = x + 1; y < v1.size(); y++){
      |                            ~~^~~~~~~~~~~
supertrees.cpp:74:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |                 if(s != vv.size() || s + f != v1.size())
      |                    ~~^~~~~~~~~~~~
supertrees.cpp:74:44: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |                 if(s != vv.size() || s + f != v1.size())
      |                                      ~~~~~~^~~~~~~~~~~~
supertrees.cpp:92:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   92 |             if(v2.size() <= vc.back().fi){
      |                          ^
supertrees.cpp:115:40: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |             if((L > l) || (R > r) || s != v1.size())
      |                                      ~~^~~~~~~~~~~~
supertrees.cpp:27:40: warning: unused variable 'm' [-Wunused-variable]
   27 |     ll i , j , l , r , s  = 0, f , n , m , x , y , k;
      |                                        ^
supertrees.cpp:27:52: warning: unused variable 'k' [-Wunused-variable]
   27 |     ll i , j , l , r , s  = 0, f , n , m , x , y , k;
      |                                                    ^

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 440 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 6 ms 1392 KB Output is correct
7 Correct 156 ms 23372 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 440 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 6 ms 1392 KB Output is correct
7 Correct 156 ms 23372 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 1 ms 348 KB Output is correct
12 Correct 6 ms 1368 KB Output is correct
13 Correct 149 ms 23316 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 59 ms 13652 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 6332 KB Output is correct
21 Correct 206 ms 23236 KB Output is correct
22 Correct 110 ms 23240 KB Output is correct
23 Correct 135 ms 23448 KB Output is correct
24 Correct 121 ms 23440 KB Output is correct
25 Correct 57 ms 13652 KB Output is correct
26 Correct 49 ms 13396 KB Output is correct
27 Correct 145 ms 23312 KB Output is correct
28 Correct 114 ms 23380 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 6 ms 1392 KB Output is correct
9 Correct 114 ms 23380 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1388 KB Output is correct
13 Correct 199 ms 23524 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 860 KB Output is correct
17 Correct 56 ms 13344 KB Output is correct
18 Correct 1 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 28 ms 6404 KB Output is correct
22 Correct 131 ms 23372 KB Output is correct
23 Correct 118 ms 23484 KB Output is correct
24 Correct 146 ms 23336 KB Output is correct
25 Correct 50 ms 13340 KB Output is correct
26 Correct 64 ms 13548 KB Output is correct
27 Correct 161 ms 23404 KB Output is correct
28 Correct 140 ms 23344 KB Output is correct
29 Correct 64 ms 13444 KB Output is correct

Subtask #4
35.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 348 KB Output is correct
4 Correct 50 ms 6268 KB Output is correct
5 Correct 124 ms 23420 KB Output is correct
6 Correct 118 ms 23476 KB Output is correct
7 Correct 157 ms 23384 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 34 ms 6408 KB Output is correct
10 Correct 129 ms 23252 KB Output is correct
11 Correct 114 ms 23648 KB Output is correct
12 Correct 162 ms 23328 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 344 KB Output is correct
16 Correct 32 ms 6292 KB Output is correct
17 Correct 129 ms 23436 KB Output is correct
18 Correct 145 ms 23476 KB Output is correct
19 Correct 119 ms 23376 KB Output is correct
20 Correct 112 ms 23328 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 440 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 6 ms 1392 KB Output is correct
7 Correct 156 ms 23372 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 1 ms 348 KB Output is correct
12 Correct 6 ms 1368 KB Output is correct
13 Correct 149 ms 23316 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 59 ms 13652 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 6332 KB Output is correct
21 Correct 206 ms 23236 KB Output is correct
22 Correct 110 ms 23240 KB Output is correct
23 Correct 135 ms 23448 KB Output is correct
24 Correct 121 ms 23440 KB Output is correct
25 Correct 57 ms 13652 KB Output is correct
26 Correct 49 ms 13396 KB Output is correct
27 Correct 145 ms 23312 KB Output is correct
28 Correct 114 ms 23380 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 6 ms 1392 KB Output is correct
37 Correct 114 ms 23380 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1388 KB Output is correct
41 Correct 199 ms 23524 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 860 KB Output is correct
45 Correct 56 ms 13344 KB Output is correct
46 Correct 1 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 28 ms 6404 KB Output is correct
50 Correct 131 ms 23372 KB Output is correct
51 Correct 118 ms 23484 KB Output is correct
52 Correct 146 ms 23336 KB Output is correct
53 Correct 50 ms 13340 KB Output is correct
54 Correct 64 ms 13548 KB Output is correct
55 Correct 161 ms 23404 KB Output is correct
56 Correct 140 ms 23344 KB Output is correct
57 Correct 64 ms 13444 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 860 KB Output is correct
61 Correct 55 ms 13524 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 31 ms 6392 KB Output is correct
66 Correct 65 ms 13580 KB Output is correct
67 Correct 76 ms 13652 KB Output is correct
68 Correct 52 ms 13392 KB Output is correct
69 Correct 62 ms 13408 KB Output is correct

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 440 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 6 ms 1392 KB Output is correct
7 Correct 156 ms 23372 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 1 ms 348 KB Output is correct
12 Correct 6 ms 1368 KB Output is correct
13 Correct 149 ms 23316 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 59 ms 13652 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 6332 KB Output is correct
21 Correct 206 ms 23236 KB Output is correct
22 Correct 110 ms 23240 KB Output is correct
23 Correct 135 ms 23448 KB Output is correct
24 Correct 121 ms 23440 KB Output is correct
25 Correct 57 ms 13652 KB Output is correct
26 Correct 49 ms 13396 KB Output is correct
27 Correct 145 ms 23312 KB Output is correct
28 Correct 114 ms 23380 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 6 ms 1392 KB Output is correct
37 Correct 114 ms 23380 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1388 KB Output is correct
41 Correct 199 ms 23524 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 860 KB Output is correct
45 Correct 56 ms 13344 KB Output is correct
46 Correct 1 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 28 ms 6404 KB Output is correct
50 Correct 131 ms 23372 KB Output is correct
51 Correct 118 ms 23484 KB Output is correct
52 Correct 146 ms 23336 KB Output is correct
53 Correct 50 ms 13340 KB Output is correct
54 Correct 64 ms 13548 KB Output is correct
55 Correct 161 ms 23404 KB Output is correct
56 Correct 140 ms 23344 KB Output is correct
57 Correct 64 ms 13444 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 348 KB Output is correct
61 Correct 50 ms 6268 KB Output is correct
62 Correct 124 ms 23420 KB Output is correct
63 Correct 118 ms 23476 KB Output is correct
64 Correct 157 ms 23384 KB Output is correct
65 Correct 1 ms 348 KB Output is correct
66 Correct 34 ms 6408 KB Output is correct
67 Correct 129 ms 23252 KB Output is correct
68 Correct 114 ms 23648 KB Output is correct
69 Correct 162 ms 23328 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 344 KB Output is correct
73 Correct 32 ms 6292 KB Output is correct
74 Correct 129 ms 23436 KB Output is correct
75 Correct 145 ms 23476 KB Output is correct
76 Correct 119 ms 23376 KB Output is correct
77 Correct 112 ms 23328 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 2 ms 860 KB Output is correct
81 Correct 55 ms 13524 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 31 ms 6392 KB Output is correct
86 Correct 65 ms 13580 KB Output is correct
87 Correct 76 ms 13652 KB Output is correct
88 Correct 52 ms 13392 KB Output is correct
89 Correct 62 ms 13408 KB Output is correct
90 Correct 1 ms 348 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 3 ms 860 KB Output is correct
93 Correct 57 ms 13348 KB Output is correct
94 Correct 0 ms 344 KB Output is correct
95 Correct 1 ms 348 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 16 ms 3728 KB Output is correct
98 Correct 79 ms 13644 KB Output is correct
99 Correct 76 ms 13700 KB Output is correct
100 Correct 86 ms 13388 KB Output is correct
101 Correct 70 ms 13392 KB Output is correct
102 Incorrect 151 ms 23240 KB Answer gives possible 1 while actual possible 0
103 Halted 0 ms 0 KB -