Submission #1253210

#	Time	Username	Problem	Language	Result	Execution time	Memory
1253210		TIN	세계 지도 (IOI25_worldmap)	C++20	5 / 100	8 ms	1348 KiB

worldmap

#include "worldmap.h"

std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) {
	std::vector<std::vector<int>> ans(2 * N, std::vector<int>(2 * N, 1));
	for (auto& x : A) --x; for (auto& x : B) --x;
	if (M == N - 1) {
		bool sub1 = true;
		for (int i = 0; i + 1 < N; i++) if (A[i] != i || B[i] != i + 1) sub1 = false;
		if (sub1) {
			for (int i = 0; i < 2 * N; i++) for (int j = 0; j < 2 * N; j++) ans[i][j] = N;
			for (int i = 1; i < N; i++) for (int j = 0; j < 2 * N; j++) ans[i - 1][j] = i;
		} else {
			
		}
		return ans;
	}
	return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 7
• Subtask 4: 0 / 8
• Subtask 5: 0 / 14
• Subtask 6: 0 / 56