oj.uz

Submission #927627

# Submission time Handle Problem Language Result Execution time Memory
927627 2024-02-15T07:41:33 Z haxorman Connecting Supertrees (IOI20_supertrees) C++14
11 / 100
 167 ms 22236 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;

const int mxN = 1007;

int dsu[mxN];
bool mark[mxN], done[mxN];
vector<int> cmp[mxN];

int find(int x) {
    return dsu[x] < 0 ? x : dsu[x] = find(dsu[x]);
}

bool unite(int x, int y) {
    x = find(x), y = find(y);

    if (x == y) {
        return false;
    }

    if (dsu[x] > dsu[y]) {
        swap(x, y);
    }
    dsu[x] += dsu[y];
    dsu[y] = x;
    for (auto c : cmp[y]) {
        cmp[x].push_back(c);
    }

    return true;
}

int construct(vector<vector<int>> p) {
	int n = p.size();
    memset(dsu, -1, sizeof(dsu));
    vector<vector<int>> ans(n, vector<int>(n));
    
    for (int i = 0; i < n; ++i) {
        cmp[i].push_back(i);
    }

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (p[i][j] == 2) {
                int x = find(i), y = find(j);
                if (x != y) {
                    bool ok = true;
                    for (auto u : cmp[x]) {
                        for (auto v : cmp[y]) {
                            ok &= (p[u][v] == 2);
                        }
                    }

                    if (ok) {
                        unite(x, y);
                    }
                }
            } 
        }
    }

    for (int i = 0; i < n; ++i) {
        int x = find(i);
        if (done[x] || cmp[x].size() <= 2) {
            continue;
        }
        done[x] = true;
    
        /*
        cout << x << "\n";
        for (auto c : cmp[x]) {
            cout << c << ' ';
        }
        cout << "\n";
        */

        for (int j = 0; j < cmp[x].size() - 1; ++j) {
            mark[cmp[x][j]] = true;
            ans[cmp[x][j]][cmp[x][j+1]] = ans[cmp[x][j+1]][cmp[x][j]] = 1;
        }
        mark[cmp[x].back()] = true;
        ans[cmp[x][0]][cmp[x].back()] = ans[cmp[x].back()][cmp[x][0]] = 1;
    }
    
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (i != j && p[i][j] == 1) {
                int x = i, y = j;
                assert(!(mark[i] && mark[j]));

                if (!mark[x]) {
                    x = find(x);
                }
                if (!mark[y]) {
                    y = find(y);
                }

                if (x != y) {
                    ans[x][y] = ans[y][x] = 1;
                }

                if (!mark[i] && !mark[i]) {
                    unite(x, y);
                }
            }
        }
    }

    build(ans);
	return 1;
}

Compilation message

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

Subtask #1
11.0 / 11.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 0 ms 344 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 159 ms 22100 KB Output is correct

Subtask #2
0 / 10.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 0 ms 344 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 159 ms 22100 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 153 ms 22236 KB Output is correct
14 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #3
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 416 KB Output is correct
4 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
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 39 ms 5712 KB Output is correct
5 Correct 151 ms 22096 KB Output is correct
6 Correct 151 ms 22100 KB Output is correct
7 Correct 165 ms 22204 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 38 ms 5744 KB Output is correct
10 Correct 167 ms 22100 KB Output is correct
11 Correct 150 ms 22100 KB Output is correct
12 Correct 151 ms 22096 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 348 KB Output is correct
16 Runtime error 19 ms 6584 KB Execution killed with signal 6
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.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 0 ms 344 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 159 ms 22100 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 153 ms 22236 KB Output is correct
14 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #6
0 / 4.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 0 ms 344 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 159 ms 22100 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 153 ms 22236 KB Output is correct
14 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -