oj.uz

답안 #787018

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
787018 2023-07-18T16:35:28 Z acatmeowmeow 슈퍼트리 잇기 (IOI20_supertrees) C++14
40 / 100
 183 ms 22412 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();
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (p[i][j] == 3) {
				return 0;
			}
		}
	}
	
	// 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 = 0;
		for (int i = 0; i < sz; i++) {
			for (int j = i + 1; j < sz; j++) {
				hasTwo |= p[arr[i]][arr[j]] >= 2;
			}
		}
		if (!hasTwo) {
			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(u);
		}
		/*cout << "LOOP" << '\n';
		for (auto&v : loop) cout << v << " ";
		cout << '\n';*/
		if (loop.size() > 0 && loop.size() <= 2) 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;
		}
		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 < sz; i++) {
			for (int j = i + 1; j < sz; j++) {
				int u = arr[i], v = arr[j];
				if (vertex[u] != -1 && vertex[v] != -1 && p[u][v] >= 2 && 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:86:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |   for (int i = 0; i < loop.size(); i++) {
      |                   ~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 1244 KB Output is correct
7 Correct 145 ms 22340 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 1244 KB Output is correct
7 Correct 145 ms 22340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 1236 KB Output is correct
13 Correct 145 ms 22252 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 700 KB Output is correct
17 Correct 63 ms 8452 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 37 ms 5900 KB Output is correct
21 Correct 183 ms 22348 KB Output is correct
22 Correct 143 ms 22244 KB Output is correct
23 Correct 156 ms 22376 KB Output is correct
24 Correct 146 ms 22300 KB Output is correct
25 Correct 58 ms 8384 KB Output is correct
26 Correct 96 ms 8368 KB Output is correct
27 Correct 149 ms 22272 KB Output is correct
28 Correct 144 ms 22364 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 7 ms 1236 KB Output is correct
9 Correct 150 ms 22344 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 6 ms 1236 KB Output is correct
13 Correct 162 ms 22328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 700 KB Output is correct
17 Correct 63 ms 8360 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 360 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 39 ms 5864 KB Output is correct
22 Correct 147 ms 22232 KB Output is correct
23 Correct 153 ms 22288 KB Output is correct
24 Correct 154 ms 22412 KB Output is correct
25 Correct 61 ms 12472 KB Output is correct
26 Correct 58 ms 8536 KB Output is correct
27 Correct 149 ms 22276 KB Output is correct
28 Correct 153 ms 22224 KB Output is correct
29 Correct 59 ms 12584 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 41 ms 5912 KB Output is correct
5 Correct 145 ms 22224 KB Output is correct
6 Correct 145 ms 22296 KB Output is correct
7 Correct 162 ms 22308 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 37 ms 5860 KB Output is correct
10 Correct 147 ms 22272 KB Output is correct
11 Correct 144 ms 22216 KB Output is correct
12 Correct 148 ms 22244 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Incorrect 17 ms 3400 KB Answer gives possible 0 while actual possible 1
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 1244 KB Output is correct
7 Correct 145 ms 22340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 1236 KB Output is correct
13 Correct 145 ms 22252 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 700 KB Output is correct
17 Correct 63 ms 8452 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 37 ms 5900 KB Output is correct
21 Correct 183 ms 22348 KB Output is correct
22 Correct 143 ms 22244 KB Output is correct
23 Correct 156 ms 22376 KB Output is correct
24 Correct 146 ms 22300 KB Output is correct
25 Correct 58 ms 8384 KB Output is correct
26 Correct 96 ms 8368 KB Output is correct
27 Correct 149 ms 22272 KB Output is correct
28 Correct 144 ms 22364 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 7 ms 1236 KB Output is correct
37 Correct 150 ms 22344 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 6 ms 1236 KB Output is correct
41 Correct 162 ms 22328 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 3 ms 700 KB Output is correct
45 Correct 63 ms 8360 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 360 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 39 ms 5864 KB Output is correct
50 Correct 147 ms 22232 KB Output is correct
51 Correct 153 ms 22288 KB Output is correct
52 Correct 154 ms 22412 KB Output is correct
53 Correct 61 ms 12472 KB Output is correct
54 Correct 58 ms 8536 KB Output is correct
55 Correct 149 ms 22276 KB Output is correct
56 Correct 153 ms 22224 KB Output is correct
57 Correct 59 ms 12584 KB Output is correct
58 Correct 0 ms 340 KB Output is correct
59 Correct 0 ms 340 KB Output is correct
60 Correct 3 ms 732 KB Output is correct
61 Correct 63 ms 8652 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 0 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Incorrect 15 ms 3380 KB Answer gives possible 0 while actual possible 1
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 1244 KB Output is correct
7 Correct 145 ms 22340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 1236 KB Output is correct
13 Correct 145 ms 22252 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 700 KB Output is correct
17 Correct 63 ms 8452 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 37 ms 5900 KB Output is correct
21 Correct 183 ms 22348 KB Output is correct
22 Correct 143 ms 22244 KB Output is correct
23 Correct 156 ms 22376 KB Output is correct
24 Correct 146 ms 22300 KB Output is correct
25 Correct 58 ms 8384 KB Output is correct
26 Correct 96 ms 8368 KB Output is correct
27 Correct 149 ms 22272 KB Output is correct
28 Correct 144 ms 22364 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 7 ms 1236 KB Output is correct
37 Correct 150 ms 22344 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 6 ms 1236 KB Output is correct
41 Correct 162 ms 22328 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 3 ms 700 KB Output is correct
45 Correct 63 ms 8360 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 360 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 39 ms 5864 KB Output is correct
50 Correct 147 ms 22232 KB Output is correct
51 Correct 153 ms 22288 KB Output is correct
52 Correct 154 ms 22412 KB Output is correct
53 Correct 61 ms 12472 KB Output is correct
54 Correct 58 ms 8536 KB Output is correct
55 Correct 149 ms 22276 KB Output is correct
56 Correct 153 ms 22224 KB Output is correct
57 Correct 59 ms 12584 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 0 ms 340 KB Output is correct
61 Correct 41 ms 5912 KB Output is correct
62 Correct 145 ms 22224 KB Output is correct
63 Correct 145 ms 22296 KB Output is correct
64 Correct 162 ms 22308 KB Output is correct
65 Correct 1 ms 340 KB Output is correct
66 Correct 37 ms 5860 KB Output is correct
67 Correct 147 ms 22272 KB Output is correct
68 Correct 144 ms 22216 KB Output is correct
69 Correct 148 ms 22244 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 1 ms 332 KB Output is correct
73 Incorrect 17 ms 3400 KB Answer gives possible 0 while actual possible 1
74 Halted 0 ms 0 KB -