oj.uz

Submission #302965

# Submission time Handle Problem Language Result Execution time Memory
302965 2020-09-19T14:52:55 Z ivan24 Connecting Supertrees (IOI20_supertrees) C++14
40 / 100
 283 ms 26108 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

using ll = int;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
#define F first
#define S second

void build(vvi b);

class Solver{
private:
    vvi p;
    ll n;
    vvi ans;
    vi hasSet;
    bool add_edge(ll u, ll v){
        if (ans[u][v] || u == v) return 0;
        ans[u][v] = ans[v][u] = 1;
        return 1;
    }
    vi concat(const vi& v1, const vi& v2, const vi& v3){
        vi res;
        for (ll i = v1.size()-1; i >= 0; i--) res.push_back(v1[i]);
        for (auto i: v2) res.push_back(i);
        for (auto i: v3) res.push_back(i);
        return res;
    }

    bool checkOnes(const vi& v){
        for (auto i: v){
            for (auto j: v){
                if (j != i && p[i][j] != 1) return 0;
            }
        }
        return 1;
    }
    bool checkTwos(const vi& two, const vi& one){
        for (auto i: two){
            for (auto j: one){
                if (p[i][j] != 2) return 0;
            }
            for (auto j: two){
                if (p[i][j] != 2 && i != j) return 0;
            }
        }
        return 1;
    }


    bool processGroup(const vi& cur_set){
        // check if all are connected to each other
        for (auto j: cur_set){
            for (auto k: cur_set){
                if (p[j][k] == 0 && j != k) return 0;
            }
        }
        vi two_set; vvi one_set(2,vi());
        vi hasCurSet(n,0);
        for (auto j: cur_set){
            if (hasCurSet[j]) continue;
            hasCurSet[j] = true;

            bool hasOne = false;
            for (auto k: cur_set){
                if (k != j && p[j][k] == 1) hasOne = true;
            }
            if (hasOne){
                ll cur_one = 0;
                for (ll k = 0; 2 > k; k++){
                    if (one_set[k].size()) cur_one++;
                }
                //if (cur_one == 2) return 0;
                one_set[cur_one].push_back(j);
                for (auto k: cur_set){
                    if (p[j][k] == 1 && j != k){
                        one_set[cur_one].push_back(k);
                        if (hasCurSet[k]) return 0;
                        hasCurSet[k] = true;
                    }
                }
            }else{
                two_set.push_back(j);
            }
        }

        /*
        cout << "one_set:\n";
        for (auto j: one_set){
            for (auto k: j) cout << k << " ";
            cout << endl;
        }
        cout << "two_set:\n";
        for (auto j: two_set) cout << j << " ";
        cout << endl;
        */

        vi nodes = concat(one_set[0],two_set,one_set[1]);
        for (ll j = 0; nodes.size() > j+1; j++){
            add_edge(nodes[j],nodes[j+1]);
            //cout << nodes[j] << " " << nodes[j+1] << endl;
        }
        if (two_set.size()){
            ii extra_edge = ii(two_set[0],two_set[two_set.size()-1]);
            if (one_set[0].size()) extra_edge.F = one_set[0][0];
            if (one_set[1].size()) extra_edge.S = one_set[1][0];
            bool b = add_edge(extra_edge.F, extra_edge.S);
            //cout << extra_edge.F << " " << extra_edge.S << endl;
            if (!b) return 0;
        }

        bool b = checkOnes(one_set[0]) && checkOnes(one_set[1]);
        b = b && checkTwos(two_set,one_set[0]) && checkTwos(two_set,one_set[1]);
        if (!b) return 0;

        for (auto i: cur_set){
            for (auto j: cur_set){
                if (j != i) p[i][j] = 0;
            }
        }

        return 1;
    }
public:
    Solver(vvi p): p(p),n(p.size()),ans(n,vi(n,0)), hasSet(n,0){

    }
    bool solve(){
        for (int i = 0; n > i; i++){
            if (hasSet[i]){
                for (ll j = 0; n > j; j++){
                    if (p[i][j] && j != i) return 0;
                }
                continue;
            }
            vi cur_set;
            for (ll j = 0; n > j; j++){
                if (p[i][j] != 0){
                    cur_set.push_back(j);
                    if (hasSet[j]) return 0;
                    else hasSet[j] = 1;
                }
            }
            if (cur_set.size() > 1){
                bool res = processGroup(cur_set);
                if (!res) return 0;
            }
        }
        for (ll i = 0; n > i; i++){
            for (ll j = 0; n > j; j++){
                //if (p[i][j] && i != j) return 0;
            }
        }
        build(ans);
        return 1;
    }
};

int construct(vvi p) {
    Solver mySolver(p);
    return mySolver.solve();
}

Compilation message

supertrees.cpp: In member function 'bool Solver::processGroup(const vi&)':
supertrees.cpp:104:37: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'int'} [-Wsign-compare]
  104 |         for (ll j = 0; nodes.size() > j+1; j++){
      |                        ~~~~~~~~~~~~~^~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 11 ms 1408 KB Output is correct
7 Correct 268 ms 26104 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 11 ms 1408 KB Output is correct
7 Correct 268 ms 26104 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 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 11 ms 1408 KB Output is correct
13 Correct 250 ms 25976 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 6 ms 1152 KB Output is correct
17 Correct 124 ms 20056 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 64 ms 6848 KB Output is correct
21 Correct 258 ms 26068 KB Output is correct
22 Correct 246 ms 25980 KB Output is correct
23 Correct 264 ms 26104 KB Output is correct
24 Correct 253 ms 26108 KB Output is correct
25 Correct 117 ms 20060 KB Output is correct
26 Correct 111 ms 20088 KB Output is correct
27 Correct 262 ms 26068 KB Output is correct
28 Correct 256 ms 25976 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 12 ms 1408 KB Output is correct
9 Correct 256 ms 26104 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 1408 KB Output is correct
13 Correct 282 ms 26076 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 1152 KB Output is correct
17 Correct 121 ms 20088 KB Output is correct
18 Correct 1 ms 288 KB Output is correct
19 Correct 0 ms 360 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 64 ms 6776 KB Output is correct
22 Correct 256 ms 26104 KB Output is correct
23 Correct 248 ms 25976 KB Output is correct
24 Correct 266 ms 26104 KB Output is correct
25 Correct 113 ms 20056 KB Output is correct
26 Correct 124 ms 20120 KB Output is correct
27 Correct 250 ms 25976 KB Output is correct
28 Correct 273 ms 26104 KB Output is correct
29 Correct 113 ms 20088 KB Output is correct

Subtask #4
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 62 ms 6864 KB Output is correct
5 Correct 258 ms 25976 KB Output is correct
6 Correct 251 ms 26108 KB Output is correct
7 Correct 265 ms 26104 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 63 ms 6776 KB Output is correct
10 Correct 251 ms 26104 KB Output is correct
11 Correct 247 ms 25976 KB Output is correct
12 Correct 283 ms 26108 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Runtime error 36 ms 10488 KB Execution killed with signal 11
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 11 ms 1408 KB Output is correct
7 Correct 268 ms 26104 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 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 11 ms 1408 KB Output is correct
13 Correct 250 ms 25976 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 6 ms 1152 KB Output is correct
17 Correct 124 ms 20056 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 64 ms 6848 KB Output is correct
21 Correct 258 ms 26068 KB Output is correct
22 Correct 246 ms 25980 KB Output is correct
23 Correct 264 ms 26104 KB Output is correct
24 Correct 253 ms 26108 KB Output is correct
25 Correct 117 ms 20060 KB Output is correct
26 Correct 111 ms 20088 KB Output is correct
27 Correct 262 ms 26068 KB Output is correct
28 Correct 256 ms 25976 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 0 ms 256 KB Output is correct
36 Correct 12 ms 1408 KB Output is correct
37 Correct 256 ms 26104 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 1408 KB Output is correct
41 Correct 282 ms 26076 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 5 ms 1152 KB Output is correct
45 Correct 121 ms 20088 KB Output is correct
46 Correct 1 ms 288 KB Output is correct
47 Correct 0 ms 360 KB Output is correct
48 Correct 0 ms 256 KB Output is correct
49 Correct 64 ms 6776 KB Output is correct
50 Correct 256 ms 26104 KB Output is correct
51 Correct 248 ms 25976 KB Output is correct
52 Correct 266 ms 26104 KB Output is correct
53 Correct 113 ms 20056 KB Output is correct
54 Correct 124 ms 20120 KB Output is correct
55 Correct 250 ms 25976 KB Output is correct
56 Correct 273 ms 26104 KB Output is correct
57 Correct 113 ms 20088 KB Output is correct
58 Correct 0 ms 256 KB Output is correct
59 Correct 0 ms 256 KB Output is correct
60 Correct 5 ms 1152 KB Output is correct
61 Correct 125 ms 20088 KB Output is correct
62 Correct 1 ms 256 KB Output is correct
63 Correct 1 ms 256 KB Output is correct
64 Correct 1 ms 256 KB Output is correct
65 Runtime error 37 ms 10488 KB Execution killed with signal 11
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 11 ms 1408 KB Output is correct
7 Correct 268 ms 26104 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 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 11 ms 1408 KB Output is correct
13 Correct 250 ms 25976 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 6 ms 1152 KB Output is correct
17 Correct 124 ms 20056 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 64 ms 6848 KB Output is correct
21 Correct 258 ms 26068 KB Output is correct
22 Correct 246 ms 25980 KB Output is correct
23 Correct 264 ms 26104 KB Output is correct
24 Correct 253 ms 26108 KB Output is correct
25 Correct 117 ms 20060 KB Output is correct
26 Correct 111 ms 20088 KB Output is correct
27 Correct 262 ms 26068 KB Output is correct
28 Correct 256 ms 25976 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 0 ms 256 KB Output is correct
36 Correct 12 ms 1408 KB Output is correct
37 Correct 256 ms 26104 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 1408 KB Output is correct
41 Correct 282 ms 26076 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 5 ms 1152 KB Output is correct
45 Correct 121 ms 20088 KB Output is correct
46 Correct 1 ms 288 KB Output is correct
47 Correct 0 ms 360 KB Output is correct
48 Correct 0 ms 256 KB Output is correct
49 Correct 64 ms 6776 KB Output is correct
50 Correct 256 ms 26104 KB Output is correct
51 Correct 248 ms 25976 KB Output is correct
52 Correct 266 ms 26104 KB Output is correct
53 Correct 113 ms 20056 KB Output is correct
54 Correct 124 ms 20120 KB Output is correct
55 Correct 250 ms 25976 KB Output is correct
56 Correct 273 ms 26104 KB Output is correct
57 Correct 113 ms 20088 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 62 ms 6864 KB Output is correct
62 Correct 258 ms 25976 KB Output is correct
63 Correct 251 ms 26108 KB Output is correct
64 Correct 265 ms 26104 KB Output is correct
65 Correct 0 ms 256 KB Output is correct
66 Correct 63 ms 6776 KB Output is correct
67 Correct 251 ms 26104 KB Output is correct
68 Correct 247 ms 25976 KB Output is correct
69 Correct 283 ms 26108 KB Output is correct
70 Correct 1 ms 256 KB Output is correct
71 Correct 0 ms 256 KB Output is correct
72 Correct 0 ms 256 KB Output is correct
73 Runtime error 36 ms 10488 KB Execution killed with signal 11
74 Halted 0 ms 0 KB -