제출 #1151814

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

Main

#include <bits/stdc++.h>
using namespace std;

const int N = 105;
int n, m;
vector<int> g[N], c;
vector<vector<int>> output;

int main(){
    cin >> n >> m;
    for (int i = 0; i < m; i ++){
        int u, v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    for (int i = 0; i < n; i ++){
        c.resize(n, 0);
        for (int j = n - 1; j >= 0; j -= 4){
            c[j] = 1;
            if (j - 1 >= 0)
                c[j - 1] = 1;
        }
        output.push_back(c);

        c.resize(n, 0);
        for (int j = n - 2; j >= 0; j -= 4){
            c[j] = 1;
            if (j - 1 >= 0)
                c[j - 1] = 1;
        }
        output.push_back(c);
    }
    for (int i = 0; i < n; i ++){
        c.resize(n, 0);
        for (int j = n - 2; j >= 0; j -= 4){
            c[j] = 1;
            if (j - 1 >= 0)
                c[j - 1] = 1;
        }
        output.push_back(c);
        
        c.resize(n, 0);
        for (int j = n - 1; j >= 0; j -= 4){
            c[j] = 1;
            if (j - 1 >= 0)
                c[j - 1] = 1;
        }
        output.push_back(c);
    }
    for (int i = 0; i < n; i ++){
        c.resize(n, 0);
        for (int j = n - 1; j >= 0; j -= 4){
            c[j] = 1;
            if (j - 1 >= 0)
                c[j - 1] = 1;
        }
        output.push_back(c);

        c.resize(n, 0);
        for (int j = n - 2; j >= 0; j -= 4){
            c[j] = 1;
            if (j - 1 >= 0)
                c[j - 1] = 1;
        }
        output.push_back(c);
    }

    cout << output.size() << endl;
    for (int i = 0; i < output.size(); i ++){
        for (int j = 0; j < n; j ++)
            cout << output[i][j] << " ";
        cout << endl;
    }
}

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