oj.uz

Submission #1069317

# Submission time Handle Problem Language Result Execution time Memory
1069317 2024-08-21T19:22:06 Z hasan2006 Connecting Supertrees (IOI20_supertrees) C++17
40 / 100
 153 ms 22184 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++)
            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;
                if(v[v1[x]][v1[y]] == 3)
                    r = 1;
            }
        sort(all(vc));
        if(v1.size() == 1)
            continue;
        if((l == 1 && r == 1) || vc.front().fi == 0){
            return 0;
        }
        for(auto to : vc)
            if(to.fi == 1 && to.se.fi != to.se.se)
                b[to.se.fi] = b[to.se.se] = 2;
        set<int>st;
        for(auto to : v1){
            st.insert(to);
            if(b[to] == 1)
                v2.pb(to);
            else
                v3.pb(to);
        }
        f = -1;
        for(auto to : v3){
            if(f != -1)
                c[to][f] = c[f][to] = 1;
            f = to;
        }

        if(v2.size()){
            if(v3.size())
                v2.pb(v3.back());
            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;
                    else {
                        if(b[to] == 1 || b[j] == 1)
                            return 0;
                    }
                }
          //  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
}*/
// Author : حسن

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:42:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |         for(x = 0; x < v1.size(); x++)
      |                    ~~^~~~~~~~~~~
supertrees.cpp:43:30: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |             for(y = x + 1; y < v1.size(); y++){
      |                            ~~^~~~~~~~~~~
supertrees.cpp:77:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   77 |             if(v2.size() <= vc.back().fi){
      |                          ^
supertrees.cpp:87:16: warning: variable 'L' set but not used [-Wunused-but-set-variable]
   87 |             ll L = 0 ,R = 0 , s =0;
      |                ^
supertrees.cpp:87:23: warning: variable 'R' set but not used [-Wunused-but-set-variable]
   87 |             ll L = 0 ,R = 0 , s =0;
      |                       ^
supertrees.cpp:27:24: warning: unused variable 's' [-Wunused-variable]
   27 |     ll i , j , l , r , s  = 0, f , n , m , x , y , k;
      |                        ^
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 1 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 7 ms 1308 KB Output is correct
7 Correct 153 ms 22164 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 1 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 7 ms 1308 KB Output is correct
7 Correct 153 ms 22164 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 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 6 ms 1116 KB Output is correct
13 Correct 114 ms 21988 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 856 KB Output is correct
17 Correct 65 ms 16584 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 28 ms 5756 KB Output is correct
21 Correct 122 ms 22184 KB Output is correct
22 Correct 113 ms 22040 KB Output is correct
23 Correct 147 ms 21980 KB Output is correct
24 Correct 119 ms 22044 KB Output is correct
25 Correct 58 ms 12372 KB Output is correct
26 Correct 48 ms 12112 KB Output is correct
27 Correct 141 ms 22152 KB Output is correct
28 Correct 109 ms 22096 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 1116 KB Output is correct
9 Correct 111 ms 22028 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1344 KB Output is correct
13 Correct 140 ms 21980 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 64 ms 13972 KB Output is correct
18 Correct 0 ms 344 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 5720 KB Output is correct
22 Correct 115 ms 22124 KB Output is correct
23 Correct 117 ms 22152 KB Output is correct
24 Correct 136 ms 21956 KB Output is correct
25 Correct 52 ms 12064 KB Output is correct
26 Correct 49 ms 12376 KB Output is correct
27 Correct 113 ms 22096 KB Output is correct
28 Correct 144 ms 21980 KB Output is correct
29 Correct 55 ms 12116 KB Output is correct

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 1 ms 348 KB Output is correct
4 Correct 32 ms 5776 KB Output is correct
5 Correct 118 ms 21976 KB Output is correct
6 Correct 116 ms 22104 KB Output is correct
7 Correct 138 ms 22172 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 38 ms 5724 KB Output is correct
10 Correct 115 ms 21972 KB Output is correct
11 Correct 149 ms 22096 KB Output is correct
12 Correct 137 ms 22080 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Incorrect 13 ms 3224 KB Answer gives possible 0 while actual possible 1
17 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 1 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 7 ms 1308 KB Output is correct
7 Correct 153 ms 22164 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 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 6 ms 1116 KB Output is correct
13 Correct 114 ms 21988 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 856 KB Output is correct
17 Correct 65 ms 16584 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 28 ms 5756 KB Output is correct
21 Correct 122 ms 22184 KB Output is correct
22 Correct 113 ms 22040 KB Output is correct
23 Correct 147 ms 21980 KB Output is correct
24 Correct 119 ms 22044 KB Output is correct
25 Correct 58 ms 12372 KB Output is correct
26 Correct 48 ms 12112 KB Output is correct
27 Correct 141 ms 22152 KB Output is correct
28 Correct 109 ms 22096 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 1116 KB Output is correct
37 Correct 111 ms 22028 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 6 ms 1344 KB Output is correct
41 Correct 140 ms 21980 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 64 ms 13972 KB Output is correct
46 Correct 0 ms 344 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 5720 KB Output is correct
50 Correct 115 ms 22124 KB Output is correct
51 Correct 117 ms 22152 KB Output is correct
52 Correct 136 ms 21956 KB Output is correct
53 Correct 52 ms 12064 KB Output is correct
54 Correct 49 ms 12376 KB Output is correct
55 Correct 113 ms 22096 KB Output is correct
56 Correct 144 ms 21980 KB Output is correct
57 Correct 55 ms 12116 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 4 ms 1116 KB Output is correct
61 Correct 81 ms 15512 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 Incorrect 17 ms 3228 KB Answer gives possible 0 while actual possible 1
66 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 1 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 7 ms 1308 KB Output is correct
7 Correct 153 ms 22164 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 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 6 ms 1116 KB Output is correct
13 Correct 114 ms 21988 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 856 KB Output is correct
17 Correct 65 ms 16584 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 28 ms 5756 KB Output is correct
21 Correct 122 ms 22184 KB Output is correct
22 Correct 113 ms 22040 KB Output is correct
23 Correct 147 ms 21980 KB Output is correct
24 Correct 119 ms 22044 KB Output is correct
25 Correct 58 ms 12372 KB Output is correct
26 Correct 48 ms 12112 KB Output is correct
27 Correct 141 ms 22152 KB Output is correct
28 Correct 109 ms 22096 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 1116 KB Output is correct
37 Correct 111 ms 22028 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 6 ms 1344 KB Output is correct
41 Correct 140 ms 21980 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 64 ms 13972 KB Output is correct
46 Correct 0 ms 344 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 5720 KB Output is correct
50 Correct 115 ms 22124 KB Output is correct
51 Correct 117 ms 22152 KB Output is correct
52 Correct 136 ms 21956 KB Output is correct
53 Correct 52 ms 12064 KB Output is correct
54 Correct 49 ms 12376 KB Output is correct
55 Correct 113 ms 22096 KB Output is correct
56 Correct 144 ms 21980 KB Output is correct
57 Correct 55 ms 12116 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 32 ms 5776 KB Output is correct
62 Correct 118 ms 21976 KB Output is correct
63 Correct 116 ms 22104 KB Output is correct
64 Correct 138 ms 22172 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 38 ms 5724 KB Output is correct
67 Correct 115 ms 21972 KB Output is correct
68 Correct 149 ms 22096 KB Output is correct
69 Correct 137 ms 22080 KB Output is correct
70 Correct 1 ms 344 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Incorrect 13 ms 3224 KB Answer gives possible 0 while actual possible 1
74 Halted 0 ms 0 KB -