oj.uz

Submission #628327

# Submission time Handle Problem Language Result Execution time Memory
628327 2022-08-13T10:20:03 Z boris_mihov Connecting Supertrees (IOI20_supertrees) C++17
0 / 100
 1 ms 384 KB 
#include "supertrees.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <stack>

typedef long long llong;
const int MAXN = 1000 + 10;

int n;
int p[MAXN];
int d[MAXN];
std::vector < std::vector <int> > ans;
std::vector <int> byPaths[MAXN][3];

inline int find(int x)
{
    if (p[x] == x) return x;
    return p[x] = find(p[x]);
}

inline void connect(int x, int y)
{
    x = find(x);
    y = find(y);
    if (x == y) return;
    if (d[x] > d[y]) std::swap(x, y);
    if (d[x] == d[y]) ++d[y];
    p[x] = y;
}

inline bool areConnected(int x, int y)
{
    return find(x) == find(y);
}

int cycle[MAXN], cycleCnt;
int construct(std::vector < std::vector <int> > wantedPaths) 
{
    n = wantedPaths.size();
    ans.resize(n);

    for (int i = 1 ; i <= n ; ++i)
    {
        ans[i-1].resize(n, 0);
        for (int j = 1 ; j <= n ; ++j)
        {
            if (i == j) continue;
            if (wantedPaths[i - 1][j - 1] == 3) return 0;
            byPaths[i][wantedPaths[i - 1][j - 1]].push_back(j);
        }
    }

    std::iota(p + 1, p + 1 + n, 1);
    std::fill(d + 1, d + 1 + n, 1);
    for (int i = 1 ; i <= n ; ++i)
    {
        int last = i;
        int alreadyConnected = 0;
        for (const int &j : byPaths[2][i])
        {
            if (areConnected(i, j)) 
            {
                if (alreadyConnected == 1) return 0;
                cycle[i] = cycle[j];
                alreadyConnected = 2;
                continue;
            }

            if (alreadyConnected == 2 || cycle[j] != 0) return 0;
            if (cycle[i] == 0) cycle[i] = ++cycleCnt;
            ans[last - 1][j - 1] = 1;
            ans[j - 1][last - 1] = 1;
            alreadyConnected = 1;
            cycle[j] = cycle[i];
            connect(i, j);
            last = j;
        }

        if (last != i)
        {
            ans[last - 1][i - 1] = 1;
            ans[i - 1][last - 1] = 1;
        }

        for (const int &j : byPaths[1][i])
        {
            if (areConnected(i, j)) continue;
            ans[i - 1][j - 1] = 1;
            ans[j - 1][i - 1] = 1;
            connect(i, j);
        }
    }

    for (int i = 1 ; i <= n ; ++i)
    {
        for (int j = 1 ; j <= n ; ++j)
        {
            if (i == j) continue;
            if (cycle[i] != cycle[j] && cycle[i] != 0 && cycle[j] != 0 && areConnected(i, j)) return 0;
            if (wantedPaths[i - 1][j - 1] == 0 && areConnected(i, j)) return 0;
            if (wantedPaths[i - 1][j - 1] == 1 && ((cycle[i] != 0 && cycle[j] != 0 && cycle[i] == cycle[j]) || !areConnected(i, j))) return 0;
            if (wantedPaths[i - 1][j - 1] == 2 && (!areConnected(i, j) || (cycle[i] != cycle[j] && cycle[i] != 0 && cycle[j] != 0))) return 0;
        }
    }

    build(ans);
	return 1;
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 19.0

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

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Answer gives possible 0 while actual possible 1
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

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

Subtask #6
0 / 4.0

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