제출 #1316526

#제출 시각아이디문제언어결과실행 시간메모리
1316526TroySerMake them Meet (EGOI24_makethemmeet)C++20
10 / 100
1 ms332 KiB
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main() {

    ll N, M;
    cin >> N >> M;

    vector<vector<ll> > adjList(N);

    for (ll i = 0; i < M; i++) {
        ll u, v;
        cin >> u >> v;
        adjList[u].push_back(v);
        adjList[v].push_back(u);
    }

    ll center = -1;
    for (ll i = 0; i < N; i++) {
        if (adjList[i].size() == M) {
            center = i;
        }
    }

    if (N == 2) {
        cout << "1" << endl << "1 1" << endl;
        exit(0);
    }

    cout << 1 + 2*(N - 1) << endl;

    vector<ll> c(N, 1);
    for (ll i = 0; i < N; i++) {
        if (i != 0) cout << " ";
        cout << c[i];
    }
    cout << endl;
    
    for (ll i = 0; i < N; i++) {

        if (i == center) continue;

        vector<ll> c(N, 0);

        c[i] = 1, c[center] = 1;
        
        for (ll i = 0; i < N; i++) {
            if (i != 0) cout << " ";
            cout << c[i];
        }
        cout << endl;

        for (ll i = 0; i < N; i++) {
            if (i != 0) cout << " ";
            cout << c[i];
        }
        cout << endl;

    }

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...