oj.uz

Submission #1109781

# Submission time Handle Problem Language Result Execution time Memory
1109781 2024-11-07T14:51:36 Z TrinhKhanhDung Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 147 ms 24136 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18
#define INF (ll)1e9
#define MOD (ll)(1e9 + 7)
 #include "supertrees.h"

using namespace std;

template<class T1, class T2>
    bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

template<class T1, class T2>
    bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}

template<class T1, class T2>
    void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}

template<class T1, class T2>
    void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}

template<class T>
    void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}

const int MAX = 1003;

int construct(vector<vector<int>> p){
    int N = sz(p);

    auto subtask1_check = [&]() -> bool{
        for(int i = 0; i < N; i++){
            for(int j = 0; j < N; j++){
                if(p[i][j] != 1){
                    return false;
                }
            }
        }
        return true;
    };

    if(subtask1_check()){
        vector<vector<int>> ans(N, vector<int>(N, 0));
        for(int i = 1; i < N; i++){
            ans[i - 1][i] = ans[i][i - 1] = 1;
        }
        build(ans);
        return 1;
    }

    auto subtask2_check = [&]() -> bool{
        for(int i = 0; i < N; i++){
            for(int j = 0; j < N; j++){
                if(p[i][j] != 0 && p[i][j] != 1){
                    return false;
                }
            }
        }
        return true;
    };

    if(subtask2_check()){
        vector<vector<int>> ans(N, vector<int>(N, 0));

        vector<int> visited(N, false), save;
        auto dfs = [&](auto self, int u) -> void {
            if(visited[u]) return;
            visited[u] = true;
            save.push_back(u);
            for(int v = 0; v < N; v++) if(p[u][v]){
                self(self, v);
            }
        };

        for(int i = 0; i < N; i++) if(!visited[i]){
            save.clear();
            dfs(dfs, i);

            for(int j = 0; j < sz(save); j++){
                for(int k = j + 1; k < sz(save); k++){
                    if(p[save[j]][save[k]] == 0){
                        return 0;
                    }
                }
            }

            for(int j = 1; j < sz(save); j++){
                ans[save[j]][save[j - 1]] = ans[save[j - 1]][save[j]] = 1;
            }
        }

        build(ans);
        return 1;
    }

    return 0;
}

//int main(){
//    ios_base::sync_with_stdio(0); cin.tie(0);
//    // freopen("ADVERT.inp","r",stdin);
//    // freopen("ADVERT.out","w",stdout);
//
//    // cout << delivery(3, 2, 8, {1, 2, 5});
//
//    return 0;
//}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 508 KB Output is correct
6 Correct 5 ms 1104 KB Output is correct
7 Correct 120 ms 22036 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 508 KB Output is correct
6 Correct 5 ms 1104 KB Output is correct
7 Correct 120 ms 22036 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 6 ms 1104 KB Output is correct
13 Correct 138 ms 22088 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 4 ms 848 KB Output is correct
17 Correct 66 ms 14152 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 32 ms 6216 KB Output is correct
21 Correct 133 ms 24136 KB Output is correct
22 Correct 134 ms 24136 KB Output is correct
23 Correct 147 ms 24136 KB Output is correct
24 Correct 136 ms 23952 KB Output is correct
25 Correct 61 ms 14224 KB Output is correct
26 Correct 60 ms 14096 KB Output is correct
27 Correct 136 ms 24072 KB Output is correct
28 Correct 135 ms 24136 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Incorrect 1 ms 336 KB Answer gives possible 0 while actual possible 1
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Incorrect 1 ms 336 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 508 KB Output is correct
6 Correct 5 ms 1104 KB Output is correct
7 Correct 120 ms 22036 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 6 ms 1104 KB Output is correct
13 Correct 138 ms 22088 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 4 ms 848 KB Output is correct
17 Correct 66 ms 14152 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 32 ms 6216 KB Output is correct
21 Correct 133 ms 24136 KB Output is correct
22 Correct 134 ms 24136 KB Output is correct
23 Correct 147 ms 24136 KB Output is correct
24 Correct 136 ms 23952 KB Output is correct
25 Correct 61 ms 14224 KB Output is correct
26 Correct 60 ms 14096 KB Output is correct
27 Correct 136 ms 24072 KB Output is correct
28 Correct 135 ms 24136 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Incorrect 1 ms 336 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 508 KB Output is correct
6 Correct 5 ms 1104 KB Output is correct
7 Correct 120 ms 22036 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 6 ms 1104 KB Output is correct
13 Correct 138 ms 22088 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 4 ms 848 KB Output is correct
17 Correct 66 ms 14152 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 32 ms 6216 KB Output is correct
21 Correct 133 ms 24136 KB Output is correct
22 Correct 134 ms 24136 KB Output is correct
23 Correct 147 ms 24136 KB Output is correct
24 Correct 136 ms 23952 KB Output is correct
25 Correct 61 ms 14224 KB Output is correct
26 Correct 60 ms 14096 KB Output is correct
27 Correct 136 ms 24072 KB Output is correct
28 Correct 135 ms 24136 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Incorrect 1 ms 336 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -