oj.uz

Submission #519796

# Submission time Handle Problem Language Result Execution time Memory
519796 2022-01-27T10:45:18 Z Monarchuwu Scissors and Tape (CEOI19_scissors) C++17
0 / 100
 1000 ms 107236 KB 
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;

typedef pair<int, int> pii;
#define ff first
#define ss second

const int N = 1000;
int n, m;
vector<pii> S, T;

void scissors() {
    cout << "scissors\n";
    cout << "0 " << n * m << '\n';
    for (int i = 0; i < m; ++i)
        for (int j = 0; j < n; ++j) {
            cout << "4 ";
            cout << i << ' ' << j << ' ';
            cout << i << ' ' << j + 1 << ' ';
            cout << i + 1 << ' ' << j + 1 << ' ';
            cout << i + 1 << ' ' << j << '\n';
        }
}

void tape() {
    cout << "tape\n";
    cout << m * n << ' ';
    for (int i = 1; i <= m * n; ++i) cout << i << ' ';
    cout << '\n';

    for (int i = 0; i < m; ++i)
        for (int j = 0; j < n; ++j) {
            cout << "4 ";
            cout << i << ' ' << j << ' ';
            cout << i << ' ' << j + 1 << ' ';
            cout << i + 1 << ' ' << j + 1 << ' ';
            cout << i + 1 << ' ' << j << '\n';
        }

    cout << "4\n";
    for (pii x : T) cout << x.ff << ' ' << x.ss << ' ';
    cout << '\n';
}

int main() {
    cin.tie(NULL)->sync_with_stdio(false);
    cin >> n;
    S.resize(n);
    for (pii &x : S) cin >> x.ff >> x.ss;

    cin >> m;
    T.resize(m);
    for (pii &x : T) cin >> x.ff >> x.ss;

    m = max({ S[0].ff, S[1].ff, S[2].ff });
    n = max({ S[0].ss, S[1].ss, S[2].ss });
    scissors();
    tape();
}
/**  /\_/\
 *  (= ._.)
 *  / >0  \>1
**/

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Operation 1, Polygon 0: Polygon given in clockwise order, must be counter-clockwise
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1050 ms 58552 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Operation 1, Polygon 0: Polygon given in clockwise order, must be counter-clockwise
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1082 ms 107236 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1085 ms 66084 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Operation 1, Polygon 0: Polygon given in clockwise order, must be counter-clockwise
2 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Operation 1, Polygon 0: Polygon given in clockwise order, must be counter-clockwise
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Operation 1, Polygon 0: Polygon given in clockwise order, must be counter-clockwise
2 Halted 0 ms 0 KB -