제출 #1053336

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1053336		Ludissey	Make them Meet (EGOI24_makethemmeet)	C++17	14.80 / 100	38 ms	3288 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 << (2*M)+2 << '\n';
    for (int i = 0; i < N; i++) cout << 0 << ' ';
    cout << '\n';        
    for (int i = 0; i < N; i++) cout << 0 << ' ';
    cout << '\n';       
    for (int i = 0; i < M; i++) {
        for (int j = 0; j < N; j++)
        {
            if(j==ed[i].first||j==ed[i].second) cout << 0 << ' ';
            else cout << j+1 << ' ';
        }
        cout << '\n';
        for (int j = 0; j < N; j++)
        {
            if(j==ed[i].first||j==ed[i].second) cout << 0 << ' ';
            else cout << j+1 << ' ';
        }
        if(i<M-1) cout << '\n';
    }
    return 0;
}

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