제출 #1151812

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1151812		AbdullahIshfaq	Make them Meet (EGOI24_makethemmeet)	C++20	70 / 100	6 ms	5212 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 998244353
const int N = 200005;
vector<int> g[N];
int p[N], dep[N];
void dfs(int u, int v = -1){
	for(auto c : g[u]){
		if(c == v){
			continue;
		}
		dep[c] = dep[u] + 1;
		p[c] = u;
		dfs(c, u);
	}
}
void solve(){
	ll n, m, u , v;
	cin >> n >> m;
	for(int i = 0; i < m; i++){
		cin >> u >> v;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	if(m == n - 1){
		cout << 2 * n << '\n';
		dfs(0);
		for(int i = 0 ;i < 2 * n ; i++){
			for(int j = 0; j < n; j++){
				if(dep[j] % 2 == i % 2){
					cout << j << " ";
				}
				else if(j == 0){
					cout << g[j][0] << " ";
				}
				else{
					cout << p[j] << " ";
				}
			}
			cout << '\n';
		}
	}
	else{
		cout << n << '\n';
		for (int i = 0; i < n; i++){
			for (int j = 0; j < n; j++){
				cout << (j + (i % 2)) / 2 << ' ';
			}
			cout << '\n';
		}
	}
}
int main() {
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int tests = 1;
	// cin >> tests;
	for(int i = 1; i <= tests; i ++)
		solve();
}

• Subtask 1: 10 / 10
• Subtask 2: 13 / 13
• Subtask 3: 11 / 11
• Subtask 4: 36 / 36
• Subtask 5: 0 / 30