oj.uz

답안 #598666

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
598666 2022-07-18T16:58:25 Z Valaki2 Scissors and Tape (CEOI19_scissors) C++14
5 / 100
 1000 ms 73084 KB 
#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.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB used 204 vertices, largest error was 0.00000000966667
2 Correct 0 ms 324 KB used 172 vertices, largest error was 0.00000001150000
3 Correct 0 ms 324 KB used 252 vertices, largest error was 0.00000001200000
4 Correct 1 ms 212 KB used 140 vertices, largest error was 0.00000001150000
5 Correct 0 ms 212 KB used 172 vertices, largest error was 0.00000001150000
6 Correct 0 ms 340 KB used 172 vertices, largest error was 0.00000000960000
7 Correct 1 ms 320 KB used 92 vertices, largest error was 0.00000000900000
8 Correct 1 ms 212 KB used 252 vertices, largest error was 0.00000000966667
9 Correct 0 ms 212 KB used 252 vertices, largest error was 0.00000001140000
10 Correct 1 ms 212 KB used 44 vertices, largest error was 0.00000000850000

Subtask #2
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1084 ms 73084 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB used 204 vertices, largest error was 0.00000000966667
2 Correct 0 ms 324 KB used 172 vertices, largest error was 0.00000001150000
3 Correct 0 ms 324 KB used 252 vertices, largest error was 0.00000001200000
4 Correct 1 ms 212 KB used 140 vertices, largest error was 0.00000001150000
5 Correct 0 ms 212 KB used 172 vertices, largest error was 0.00000001150000
6 Correct 0 ms 340 KB used 172 vertices, largest error was 0.00000000960000
7 Correct 1 ms 320 KB used 92 vertices, largest error was 0.00000000900000
8 Correct 1 ms 212 KB used 252 vertices, largest error was 0.00000000966667
9 Correct 0 ms 212 KB used 252 vertices, largest error was 0.00000001140000
10 Correct 1 ms 212 KB used 44 vertices, largest error was 0.00000000850000
11 Execution timed out 1084 ms 73084 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Expected int32, but "-148789706990" found
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1085 ms 64652 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB used 204 vertices, largest error was 0.00000000966667
2 Correct 0 ms 324 KB used 172 vertices, largest error was 0.00000001150000
3 Correct 0 ms 324 KB used 252 vertices, largest error was 0.00000001200000
4 Correct 1 ms 212 KB used 140 vertices, largest error was 0.00000001150000
5 Correct 0 ms 212 KB used 172 vertices, largest error was 0.00000001150000
6 Correct 0 ms 340 KB used 172 vertices, largest error was 0.00000000960000
7 Correct 1 ms 320 KB used 92 vertices, largest error was 0.00000000900000
8 Correct 1 ms 212 KB used 252 vertices, largest error was 0.00000000966667
9 Correct 0 ms 212 KB used 252 vertices, largest error was 0.00000001140000
10 Correct 1 ms 212 KB used 44 vertices, largest error was 0.00000000850000
11 Execution timed out 1084 ms 73084 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB used 204 vertices, largest error was 0.00000000966667
2 Correct 0 ms 324 KB used 172 vertices, largest error was 0.00000001150000
3 Correct 0 ms 324 KB used 252 vertices, largest error was 0.00000001200000
4 Correct 1 ms 212 KB used 140 vertices, largest error was 0.00000001150000
5 Correct 0 ms 212 KB used 172 vertices, largest error was 0.00000001150000
6 Correct 0 ms 340 KB used 172 vertices, largest error was 0.00000000960000
7 Correct 1 ms 320 KB used 92 vertices, largest error was 0.00000000900000
8 Correct 1 ms 212 KB used 252 vertices, largest error was 0.00000000966667
9 Correct 0 ms 212 KB used 252 vertices, largest error was 0.00000001140000
10 Correct 1 ms 212 KB used 44 vertices, largest error was 0.00000000850000
11 Execution timed out 1084 ms 73084 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB used 204 vertices, largest error was 0.00000000966667
2 Correct 0 ms 324 KB used 172 vertices, largest error was 0.00000001150000
3 Correct 0 ms 324 KB used 252 vertices, largest error was 0.00000001200000
4 Correct 1 ms 212 KB used 140 vertices, largest error was 0.00000001150000
5 Correct 0 ms 212 KB used 172 vertices, largest error was 0.00000001150000
6 Correct 0 ms 340 KB used 172 vertices, largest error was 0.00000000960000
7 Correct 1 ms 320 KB used 92 vertices, largest error was 0.00000000900000
8 Correct 1 ms 212 KB used 252 vertices, largest error was 0.00000000966667
9 Correct 0 ms 212 KB used 252 vertices, largest error was 0.00000001140000
10 Correct 1 ms 212 KB used 44 vertices, largest error was 0.00000000850000
11 Execution timed out 1084 ms 73084 KB Time limit exceeded
12 Halted 0 ms 0 KB -