제출 #527335

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
527335		andrei_c1	Gardening (RMI21_gardening)	C++14	0 / 100	7 ms	828 KiB

Main

#include <bits/stdc++.h>

using namespace std;

int T;

void solve() {
    int N, M, K;
    cin >> N >> M >> K;

    if(N == 2 && M == 2 && K == 1) {
        cout << "YES\n";
        cout << "1 1\n1 1\n";
        return;
    }

    if(N == 2 && M == 4 && K == 1) {
        cout << "YES\n";
        cout << "1 1 1 1\n1 1 1 1\n";
        return;
    }

    if(N == 4 && M == 2 && K == 1) {
        cout << "YES\n";
        cout << "1 1\n1 1\n1 1\n1 1\n";
        return;
    }

    if(N == 2 && M == 4 && K == 2) {
        cout << "YES\n";
        cout << "1 1 2 2\n1 1 2 2\n";
        return;
    }

    if(N == 4 && M == 2 && K == 2) {
        cout << "YES\n";
        cout << "1 1\n1 1\n2 2\n2 2\n";
        return;
    }

    if(N == 4 && M == 4 && K == 2) {
        cout << "YES\n";
        cout << "1 1 1 1\n1 2 2 1\n1 2 2 1\n1 1 1 1\n";
        return;
    }

    if(N == 4 && M == 4 && K == 3) {
        cout << "YES\n";
        cout << "1 1 2 2\n1 1 2 2\n3 3 3 3\n3 3 3 3\n";
        return;
    }

    if(N == 4 && M == 4 && K == 4) {
        cout << "YES\n";
        cout << "1 1 2 2\n1 1 2 2\n3 3 4 4\n3 3 4 4\n";
        return;
    }

    cout << "NO\n";
}

int main() {
    ios_base :: sync_with_stdio(false); cin.tie(0);

    cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 6
• Subtask 3: 0 / 10
• Subtask 4: 0 / 18
• Subtask 5: 0 / 39
• Subtask 6: 0 / 22