제출 #1053364

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1053364		Ludissey	Make them Meet (EGOI24_makethemmeet)	C++17	0 / 100	0 ms	348 KiB

Main

#include <bits/stdc++.h>
#define int long long
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
using namespace std;
int N,M,Q;
signed main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    cin >> N >> M;
    vector<pair<int,int>> ed(M);
    for (int i = 0; i < M; i++)
    {
        cin >> ed[i].first >> ed[i].second;
        if(ed[i].first>ed[i].second) swap(ed[i].first,ed[i].second);
    }
    sort(all(ed));
    cout << N+(N-2) << "\n";
    for (int i = 0; i < N+1; i++) {
        if(i<N-1){
            for (int j = 0; j < N; j++)
            {
                if(j==i||j==i+1) cout << 0 << ' ';
                else cout << j+1 << ' ';
            }
            cout << '\n';
        }
        if(i>1){
            for (int j = 0; j < N; j++)
            {
                if(j==i-1||j==i-2) cout << 0 << ' ';
                else cout << j+1 << ' ';
            }
            if(i<N) cout << '\n';
        }
    }
    return 0;
}

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