oj.uz

답안 #967515

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
967515 2024-04-22T09:56:48 Z lanaskarica Pick (COI18_pick) C++14
10 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pii pair <int, int>
#define fi first
#define se second

int a, b, c, d;

void ispisi(int x, int y) {
    cout << x << " " << y << "\n";
}

void solve1() {
    int x = 0, y = 0;
    for (int i = 0; i < b / 2; i++) {
         ispisi(x, y); y++;
    }
    ispisi(x, y); x++;
    for (int i = 0; i < (b - 1) / 2; i++) {
        ispisi(x, y); y--;
    }
    for (int i = 0; i < (a - 1) / 2; i++) {
        ispisi(x, y); x++;
    }
    ispisi(x, y); y--;
    for (int i = 0; i < a / 2; i++) {
        ispisi(x, y); x--;
    }
}

void solve2() {
    int x = 0, y = 0;
    for (int i = 0; i < d / 2; i++) {
         ispisi(x, y); x--; y++;
    }
    ispisi(x, y); x++; y++;
    for (int i = 0; i < (d - 1) / 2; i++) {
        ispisi(x, y); y--; x++;
    }
    for (int i = 0; i < (c - 1) / 2; i++) {
        ispisi(x, y); x++; y++;
    }
    ispisi(x, y); y--; x++;
    for (int i = 0; i < c / 2; i++) {
        ispisi(x, y); x--; y--;
    }
}

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

    cin >> a >> b >> c >> d;

    if (c == 0 && d == 0) solve1();
    if (a == 0 && b == 0) solve2();

    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Incorrect 0 ms 344 KB Unexpected end of file - int32 expected
10 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Incorrect 0 ms 344 KB Unexpected end of file - int32 expected
10 Halted 0 ms 0 KB -

Subtask #10
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Incorrect 0 ms 344 KB Unexpected end of file - int32 expected
10 Halted 0 ms 0 KB -