oj.uz

답안 #1044117

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1044117 2024-08-05T07:28:56 Z vjudge1 Pick (COI18_pick) C++17
10 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 105;

vector<pair<int, int>> path;
bool seen[N][N];
void recur(int x, int y, int a, int b, int c, int d){
    if (x < 0 or y < 0) return;
    if (a == 0 and b == 0 and c == 0 and d == 0){
        if (x == 0 and y == 0){
            for (auto [x, y] : path)
                cout << x << " " << y << endl;
            exit(0);
        }
        return;
    }

    if (seen[x][y]) return;
    path.push_back({x, y});

    if (a > 0){
        recur(x + 1, y, a - 1, b, c, d);
        recur(x - 1, y, a - 1, b, c, d);
    }
    if (b > 0){
        recur(x, y + 1, a, b - 1, c, d);
        recur(x, y - 1, a, b - 1, c, d);
    }
    if (c > 0){
        recur(x + 1, y + 1, a, b, c - 1, d);
        recur(x - 1, y - 1, a, b, c - 1, d);
    }
    if (d > 0){
        recur(x + 1, y - 1, a, b, c, d - 1);
        recur(x - 1, y + 1, a, b, c, d - 1);
    }

    path.pop_back();
}


int main(){
    int a, b, c, d;
    cin >> a >> b >> c >> d;

    if (a == 0 and b == 0){
        vector<pair<int, int>> vec;
        int x = 0, y = 0;
        vec.push_back({0, 0});
        for (int i = 0; i < c / 2; i ++){
            x++, y++;
            vec.push_back({x, y});
        }
        for (int i = 0; i < d / 2; i ++){
            x--, y++;
            vec.push_back({x, y});
        }
        for (int i = 0; i < c / 2; i ++){
            x--, y--;
            vec.push_back({x, y});
        }
        for (int i = 0; i < d / 2; i ++){
            x++, y--;
            vec.push_back({x, y});
        }
        vec.pop_back();

        for (auto [x, y] : vec)
            cout << x << " " << y << endl;

        return 0;
    }
    if (c == 0 and d == 0){
        vector<pair<int, int>> vec;
        int x = 0, y = 0;
        vec.push_back({0, 0});
        for (int i = 0; i < a / 2; i ++){
            x++;
            vec.push_back({x, y});
        }
        for (int i = 0; i < b / 2; i ++){
            y++;
            vec.push_back({x, y});
        }
        for (int i = 0; i < a / 2; i ++){
            x--;
            vec.push_back({x, y});
        }
        for (int i = 0; i < b / 2; i ++){
            y--;
            vec.push_back({x, y});
        }
        vec.pop_back();

        for (auto [x, y] : vec)
            cout << x << " " << y << endl;

        return 0;
    }

    recur(0, 0, a, b, c, d);
}

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 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 #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB duplicate vertices exist
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB duplicate vertices exist
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB duplicate vertices exist
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB duplicate vertices exist
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB duplicate vertices exist
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 0 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 348 KB duplicate vertices exist
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 0 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 348 KB duplicate vertices exist
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 0 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 348 KB duplicate vertices exist
10 Halted 0 ms 0 KB -