oj.uz

답안 #1084742

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1084742 2024-09-06T21:58:28 Z an22inkle 슈퍼트리 잇기 (IOI20_supertrees) C++17
21 / 100
 125 ms 24148 KB 
#include<bits/stdc++.h>
#include "supertrees.h"
using pair = std::array<int, 2>;
using ll = long long;

void stress(std::vector<std::vector<int>> p, std::vector<std::vector<int>> ans) {
	int n = p.size();
	std::vector<std::vector<int>> hits(n, std::vector<int>(n));
	auto adj = hits;

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
				if (i == j or ans[i][j] == 0) continue;
				adj[i].push_back(j);
				adj[j].push_back(i);
		}
	}

	std::function<int(int, int, int)> dfs = [&](int u, int parent, int target) {
		if (target == u) return 1;
		int res = 0;
		for (auto v : adj[u]) {
			if (parent == v) continue;
			res += dfs(v, u, target);
		}
		return res;
	};

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (i == j) hits[i][i] = 1;
			else hits[i][j] = dfs(i, -1, j);

			if (hits[i][j] != p[i][j]) {
				std::cout << "mismatch\n" << i << ' ' << j << " expected " << p[i][j] << " got " << hits[i][j] << '\n';;
			}
		}
	}

	std::cout << "stress test ok\n";
}

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	std::vector<std::vector<int>> ans(n, std::vector<int>(n)), lines;
	std::vector<int> part(n, -1);

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (i == j || p[i][j] == 0) continue;
	
			if (part[i] > -1 && part[j] > -1) {
				if (part[i] != part[j]) return 0;
				continue;
			}
			if (part[i] > -1) lines[part[i]].push_back(j), part[j] = part[i];
			else if (part[j] > -1) lines[part[j]].push_back(i), part[i] = part[j];
			else {
				lines.push_back({});
				lines.back().push_back(i);
				lines.back().push_back(j);
				part[i] = part[j] = lines.size() - 1;
			}
		}
	}

	for (auto line : lines) {
		for (int i = 0; i < line.size(); i++) {
			for (int j = i+1; j < line.size(); j++) {
				if (p[line[i]][line[j]] == 0) return 0;
			}
			// std::cout << line[i] << ' ';
			if (i != line.size() - 1) ans[line[i]][line[i+1]] = ans[line[i + 1]][line[i]] = 1;
		} 
	}

	build(ans);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:68:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |   for (int i = 0; i < line.size(); i++) {
      |                   ~~^~~~~~~~~~~~~
supertrees.cpp:69:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |    for (int j = i+1; j < line.size(); j++) {
      |                      ~~^~~~~~~~~~~~~
supertrees.cpp:73:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |    if (i != line.size() - 1) ans[line[i]][line[i+1]] = ans[line[i + 1]][line[i]] = 1;
      |        ~~^~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 0 ms 440 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1376 KB Output is correct
7 Correct 117 ms 24148 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 0 ms 440 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1376 KB Output is correct
7 Correct 117 ms 24148 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 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 114 ms 23892 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 63 ms 14072 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 29 ms 6204 KB Output is correct
21 Correct 115 ms 24148 KB Output is correct
22 Correct 112 ms 24148 KB Output is correct
23 Correct 122 ms 24144 KB Output is correct
24 Correct 125 ms 24076 KB Output is correct
25 Correct 53 ms 14164 KB Output is correct
26 Correct 55 ms 14164 KB Output is correct
27 Correct 125 ms 24144 KB Output is correct
28 Correct 111 ms 23888 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 1 ms 348 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Too few ways to get from 0 to 1, should be 2 found 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 0 ms 440 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1376 KB Output is correct
7 Correct 117 ms 24148 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 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 114 ms 23892 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 63 ms 14072 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 29 ms 6204 KB Output is correct
21 Correct 115 ms 24148 KB Output is correct
22 Correct 112 ms 24148 KB Output is correct
23 Correct 122 ms 24144 KB Output is correct
24 Correct 125 ms 24076 KB Output is correct
25 Correct 53 ms 14164 KB Output is correct
26 Correct 55 ms 14164 KB Output is correct
27 Correct 125 ms 24144 KB Output is correct
28 Correct 111 ms 23888 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 1 ms 348 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 0 ms 440 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1376 KB Output is correct
7 Correct 117 ms 24148 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 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 114 ms 23892 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 63 ms 14072 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 29 ms 6204 KB Output is correct
21 Correct 115 ms 24148 KB Output is correct
22 Correct 112 ms 24148 KB Output is correct
23 Correct 122 ms 24144 KB Output is correct
24 Correct 125 ms 24076 KB Output is correct
25 Correct 53 ms 14164 KB Output is correct
26 Correct 55 ms 14164 KB Output is correct
27 Correct 125 ms 24144 KB Output is correct
28 Correct 111 ms 23888 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 1 ms 348 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -