oj.uz

답안 #519803

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
519803 2022-01-27T11:04:50 Z Monarchuwu Scissors and Tape (CEOI19_scissors) C++17
0 / 100
 1 ms 312 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 m, n, m1, n1, m2, n2;
vector<pii> S, T;

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;

    m1 = max(S[0].ff, S[2].ff);
    n1 = max(S[0].ss, S[2].ss);

    m2 = max(T[0].ff, T[2].ff);
    n2 = max(T[0].ss, T[2].ss);

    if (m1 > m2) { // n1 < n2
        cout << "scissors\n";
        cout << "0 2\n";

        cout << "4 ";
        cout << 0 << ' ' << 0 << ' ';
        cout << m2 << ' ' << 0 << ' ';
        cout << m2 << ' ' << n1 << ' ';
        cout << 0 << ' ' << n1 << '\n';

        cout << "4 ";
        cout << m2 << ' ' << 0 << ' ';
        cout << m1 << ' ' << 0 << ' ';
        cout << m1 << ' ' << n1 << ' ';
        cout << m2 << ' ' << n1 << '\n';
        
        cout << "tape\n";
        cout << "2 1 2\n";

        cout << "4 ";
        cout << 0 << ' ' << 0 << ' ';
        cout << m2 << ' ' << 0 << ' ';
        cout << m2 << ' ' << n1 << ' ';
        cout << 0 << ' ' << n1 << '\n';

        cout << "4 ";
        cout << m2 << ' ' << 0 << ' ';
        cout << m1 << ' ' << 0 << ' ';
        cout << m1 << ' ' << n1 << ' ';
        cout << m2 << ' ' << n1 << '\n';

        cout << "4\n";
        for (pii x : T) cout << x.ff << ' ' << x.ss << ' ';
        cout << '\n';
    }
    else { // m1 < m2 && n1 > n2
        cout << "scissors\n";
        cout << "0 2\n";

        cout << "4 ";
        cout << 0 << ' ' << 0 << ' ';
        cout << m1 << ' ' << 0 << ' ';
        cout << m1 << ' ' << n2 << ' ';
        cout << 0 << ' ' << n2 << '\n';

        cout << "4 ";
        cout << 0 << ' ' << n2 << ' ';
        cout << m1 << ' ' << n2 << ' ';
        cout << m1 << ' ' << n1 << ' ';
        cout << 0 << ' ' << n1 << '\n';

        cout << "tape\n";
        cout << "2 1 2\n";

        cout << "4 ";
        cout << 0 << ' ' << 0 << ' ';
        cout << m1 << ' ' << 0 << ' ';
        cout << m1 << ' ' << n2 << ' ';
        cout << 0 << ' ' << n2 << '\n';

        cout << "4 ";
        cout << 0 << ' ' << n2 << ' ';
        cout << m1 << ' ' << n2 << ' ';
        cout << m1 << ' ' << n1 << ' ';
        cout << 0 << ' ' << n1 << '\n';

        cout << "4\n";
        for (pii x : T) cout << x.ff << ' ' << x.ss << ' ';
        cout << '\n';        
    }
}
/**  /\_/\
 *  (= ._.)
 *  / >0  \>1
**/

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 312 KB Operation 2: Intersection of the big shape and the shape set is '18.000000', should be '24.000000', error '0.250000' (allowed 0.001000)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Operation 2: Intersection of the big shape and the shape set is '23765624919.196877', should be '38025000000.000000', error '0.375000' (allowed 0.001000)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 312 KB Operation 2: Intersection of the big shape and the shape set is '18.000000', should be '24.000000', error '0.250000' (allowed 0.001000)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 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 #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Operation 1 (scissors): Total area changed from '92299857880.500000' to '380217671022.000000', error '3.119374' (allowed 0.001000)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 312 KB Operation 2: Intersection of the big shape and the shape set is '18.000000', should be '24.000000', error '0.250000' (allowed 0.001000)
2 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 312 KB Operation 2: Intersection of the big shape and the shape set is '18.000000', should be '24.000000', error '0.250000' (allowed 0.001000)
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 312 KB Operation 2: Intersection of the big shape and the shape set is '18.000000', should be '24.000000', error '0.250000' (allowed 0.001000)
2 Halted 0 ms 0 KB -