oj.uz

답안 #786977

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
786977 2023-07-18T16:01:16 Z acatmeowmeow 슈퍼트리 잇기 (IOI20_supertrees) C++14
21 / 100
 167 ms 24268 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

const int N = 1e3;
int par[N + 5], sz[N + 5];
vector<int> ls[N + 5];
int vertex[N + 5];
bool vis[N + 5];

int find(int x) { return x == par[x] ? x : find(par[x]); }

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

void unite(int x, int y) { 
	x = find(x), y = find(y);
	if (sz[x] < sz[y]) swap(x, y);
	sz[x] += sz[y], par[y] = x;
}

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	
	// check connectivity
	for (int i = 0; i < n; i++) par[i] = i, sz[i] = 1;	
	for (int i = 0; i < n; i++) {
		for (int j = i + 1; j < n; j++) {
			if (p[i][j] && !same(i, j)) unite(i, j);
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = i + 1; j < n; j++) {
			if (!p[i][j] && same(i, j)) return 0;
		}
	}
	
	for (int i = 0; i < n; i++) ls[find(i)].push_back(i);

	for (int i = 0; i < n; i++) vertex[i] = -1;	
	vector<vector<int>> b(n, vector<int>(n));	
	for (auto&arr : ls) {
		if (arr.empty()) continue;
		int sz = arr.size(), hasTwo = false, hasThree = false;
		for (int i = 0; i < sz; i++){
			for (int j = i + 1; j < sz; j++) {
				int u = arr[i], v = arr[j];
				hasTwo |= p[u][v] == 2, hasThree |= p[u][v] == 3;
			}
		}
		if (hasTwo && hasThree) return 0;
		if (!hasTwo && !hasThree) {
			for (int i = 0; i + 1 < sz; i++){
				int u = arr[i], v = arr[i + 1];
				b[u][v] = b[v][u] = 1;
			}
			continue;
		}
		vector<int> loop;
		for (int i = 0, flag = 0; !flag && i < sz; i++) {
			for (int j = i + 1; j < sz; j++) {
				int u = arr[i], v = arr[j];
				if (p[u][v] >= 2) {
					loop.push_back(u), loop.push_back(v);
					vertex[u] = -1, vertex[v] = -1;
					flag = true;
					break;
				}
			}
		}
		for (int i = 0; i < sz; i++) {
			int valid = 1, u = arr[i];
			for (auto&v : loop) valid &= u != v && p[u][v] >= 2;	
			if (valid) loop.push_back(i);
		}

		if (hasTwo && loop.size() <= 2) return 0;
		else if (hasThree && loop.size() <= 3) return 0;

		for (int i = 0; i < loop.size(); i++) {
			int u = loop[i], v = loop[(i + 1) % loop.size()];
			b[u][v] = b[v][u] = 1;
		}
		if (hasThree) b[loop[0]][loop[2]] = b[loop[2]][loop[0]] = 1;
		queue<int> q;
		for (auto&v : loop) q.push(v), vis[v] = true;
		while (q.size()) {
			int u = q.front(); q.pop();
			for (int i = 0; i < sz; i++) {
				int v = arr[i];
				if (v == u || vis[v] || p[v][u] != 1) continue;
				vis[v] = true;
				if (vertex[u] == -1) vertex[v] = u;
				else vertex[v] = vertex[u];
				q.push(v);
				b[u][v] = b[v][u] = 1;
			}
		}
		for (int i = 0; i + 1 < sz; i++) {
			int u = arr[i], v = arr[i + 1];
			if (p[u][v] > 1 && vertex[u] != -1 && vertex[v] != -1 && vertex[u] != vertex[v]) return 0;
		}
	}
	build(b);
	return 1;
}

/*static int n;
static std::vector<std::vector<int>> p;
static std::vector<std::vector<int>> b;
static bool called = false;

static void check(bool cond, std::string message) {
    if (!cond) {
        printf("%s\n", message.c_str());
        fclose(stdout);
        exit(0);
    }
}

void build(std::vector<std::vector<int>> _b) {
    check(!called, "build is called more than once");
    called = true;
    check((int)_b.size() == n, "Invalid number of rows in b");
    for (int i = 0; i < n; i++) {
        check((int)_b[i].size() == n, "Invalid number of columns in b");
    }
    b = _b;
}

int main() {
    //assert(scanf("%d", &n) == 1);
	cin >> n;

    p.resize(n);
    for (int i = 0; i < n; i++) {
        p[i].resize(n);
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            //assert(scanf("%d", &p[i][j]) == 1);
			cin >> p[i][j];
        }
    }
    //fclose(stdin);

    int possible = construct(p);

    check(possible == 0 || possible == 1, "Invalid return value of construct");
    if (possible == 1) {
        check(called, "construct returned 1 without calling build");
    } else {
        check(!called, "construct called build but returned 0");
    }

    printf("%d\n", possible);
    if (possible == 1) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (j) {
                    printf(" ");
                }
                printf("%d", b[i][j]);
            }
            printf("\n");
        }
    }
   // fclose(stdout);
}*/

Compilation message

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 155 ms 23964 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 155 ms 23964 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 7 ms 1304 KB Output is correct
13 Correct 161 ms 24268 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 68 ms 10140 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 39 ms 6292 KB Output is correct
21 Correct 157 ms 23940 KB Output is correct
22 Correct 160 ms 23968 KB Output is correct
23 Correct 163 ms 23964 KB Output is correct
24 Correct 156 ms 23968 KB Output is correct
25 Correct 63 ms 10128 KB Output is correct
26 Correct 62 ms 10144 KB Output is correct
27 Correct 167 ms 23960 KB Output is correct
28 Correct 155 ms 23972 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 9 ms 1244 KB Output is correct
9 Correct 155 ms 23956 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 166 ms 24064 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 65 ms 10060 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 328 KB Output is correct
21 Incorrect 40 ms 6184 KB Too many ways to get from 0 to 2, should be 0 found no less than 1
22 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 40 ms 6208 KB Output is correct
5 Correct 158 ms 23952 KB Output is correct
6 Correct 157 ms 23968 KB Output is correct
7 Correct 162 ms 24004 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Incorrect 40 ms 6280 KB Too many ways to get from 0 to 2, should be 0 found no less than 1
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 155 ms 23964 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 7 ms 1304 KB Output is correct
13 Correct 161 ms 24268 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 68 ms 10140 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 39 ms 6292 KB Output is correct
21 Correct 157 ms 23940 KB Output is correct
22 Correct 160 ms 23968 KB Output is correct
23 Correct 163 ms 23964 KB Output is correct
24 Correct 156 ms 23968 KB Output is correct
25 Correct 63 ms 10128 KB Output is correct
26 Correct 62 ms 10144 KB Output is correct
27 Correct 167 ms 23960 KB Output is correct
28 Correct 155 ms 23972 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 9 ms 1244 KB Output is correct
37 Correct 155 ms 23956 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 7 ms 1236 KB Output is correct
41 Correct 166 ms 24064 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 328 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 65 ms 10060 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 0 ms 328 KB Output is correct
49 Incorrect 40 ms 6184 KB Too many ways to get from 0 to 2, should be 0 found no less than 1
50 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 155 ms 23964 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 7 ms 1304 KB Output is correct
13 Correct 161 ms 24268 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 68 ms 10140 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 39 ms 6292 KB Output is correct
21 Correct 157 ms 23940 KB Output is correct
22 Correct 160 ms 23968 KB Output is correct
23 Correct 163 ms 23964 KB Output is correct
24 Correct 156 ms 23968 KB Output is correct
25 Correct 63 ms 10128 KB Output is correct
26 Correct 62 ms 10144 KB Output is correct
27 Correct 167 ms 23960 KB Output is correct
28 Correct 155 ms 23972 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 9 ms 1244 KB Output is correct
37 Correct 155 ms 23956 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 7 ms 1236 KB Output is correct
41 Correct 166 ms 24064 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 328 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 65 ms 10060 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 0 ms 328 KB Output is correct
49 Incorrect 40 ms 6184 KB Too many ways to get from 0 to 2, should be 0 found no less than 1
50 Halted 0 ms 0 KB -