제출 #598666

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
598666		Valaki2	Scissors and Tape (CEOI19_scissors)	C++14	5 / 100	1085 ms	73084 KiB

scissors

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

#define int long long

void solve() {
    vector<int> data_1(9, 0);
    vector<int> data_2(9, 0);
    for(int &tmp : data_1) {
        cin >> tmp;
    }
    for(int &tmp : data_2) {
        cin >> tmp;
    }
    int x1 = data_1[5], y1 = data_1[6], x2 = data_2[5], y2 = data_2[6];
    cout << "scissors\n0 " << x1 * y1 << "\n";
    for(int i = 0; i < x1; i++) {
        for(int j = 0; j < y1; j++) {
            cout << "4 " << i << " " << j << " " << i + 1 << " " << j << " " << i + 1 << " " << j + 1 << " " << i << " " << j + 1 << "\n";
        }
    }
    cout << "tape\n" << x1 * y1 << " ";
    for(int i = 1; i <= x1 * y1; i++) {
        cout << i << " ";
    }
    cout << "\n";
    for(int i = 0; i < x2; i++) {
        for(int j = 0; j < y2; j++) {
            cout << "4 " << i << " " << j << " " << i + 1 << " " << j << " " << i + 1 << " " << j + 1 << " " << i << " " << j + 1 << "\n";
        }
    }
    for(int tmp : data_2) {
        cout << tmp << " ";
    }
    cout << "\n";
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 13
• Subtask 3: 0 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 10
• Subtask 6: 0 / 16
• Subtask 7: 0 / 11
• Subtask 8: 0 / 19