oj.uz

답안 #244370

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
244370 2020-07-03T18:38:17 Z Vimmer Pick (COI18_pick) C++14
10 / 100
 5 ms 384 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 101001
#define M ll(998244353)
#define inf 1e9 + 1e9


using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 3> a3;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

vector <pair <int, int> > vr;

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int a, b, c, d;

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

    if (c + d == 0)
    {
        int x = 0, y = 0;

        cout << 0 << " " << 0 << endl;

        for (int i = 0; i < a / 2; i++) {x++; cout << x << " " << y << endl;}

        y++; cout << x << " " << y << endl;

        for (int i = 0; i < a / 2 - 1; i++) {x--; cout << x << " " << y << endl;}

        for (int i = 0; i < b / 2 - 1; i++) {y++; cout << x << " " << y << endl;}

        x--; cout << x << " " << y << endl;

        for (int i = 0; i < b / 2 - 1; i++) {y--; cout << x << " " << y << endl;}

        exit(0);
    }
    else if (a + b == 0)
    {
        cout << 0 << " " << 0 << endl;

        int x = 0, y = 0;

        for (int i = 0; i < c / 2; i++)
        {
            x++; y++;

            cout << x << " " << y << endl;
        }

        x--; y++;

        cout << x << " " << y << endl;

        for (int i = 0; i < c / 2 - 1; i++)
        {
            x--; y--;

            cout << x << " " << y << endl;
        }

        for (int i = 0; i < d / 2 - 1; i++)
        {
            x--; y++;

            cout << x << " " << y << endl;
        }

        x--; y--;

        cout << x << " " << y << endl;

        for (int i = 1; i < d / 2; i++)
        {
            x++; y--;

            cout << x << " " << y << endl;
        }

        exit(0);
    }
    else
    {
        if (a == 0)  swap(a, b);

        if (c == 0)  swap(c, d);

        if (c != 0 && d != 0 && c%2 == 0) swap(c, d);

        int x = 0, y = 0;

        vr.pb({x, y});

        if (a % 2 == 0 && b % 2 == 0 && c % 2 == 0 && d % 2 == 0)
        {


            for (int i = 0; i < a / 2; i++) {x++; vr.pb({x, y}); }

            for (int i = 0; i < b / 2; i++) {y++; vr.pb({x, y});}

            for (int i = 0; i < c / 2 - 1; i++) { x++; y++; vr.pb({x, y});}

            for (int i = 0; i < d / 2; i++) {x--; y++; vr.pb({x, y});}


            x--;
            vr.pb({x, y});



            for (int i = 0; i < d / 2; i++){x++; y--; vr.pb({x, y}); }

            for (int i = 0; i < c / 2 - 1; i++) {x--; y--; vr.pb({x, y}); }

            for (int i = 0; i < b / 2; i++) {y--; vr.pb({x, y});}

            for (int i = 0; i < a / 2 - 1; i++) {x--; vr.pb({x, y}); }


            x--; y--;
            vr.pb({x, y});

        } else if (a % 2 == 0 && b % 2 == 0 && c % 2 == 1 && d % 2 == 1)
        {
            for (int i = 0; i < (a - 2) / 2; i++) {x++; vr.pb({x, y}); }


            x++; y++;
            vr.pb({x, y});

            for (int i = 0; i < b / 2; i++) {y++; vr.pb({x, y});}

            for (int i = 0; i < (c - 1) / 2; i++) { x++; y++; vr.pb({x, y});}

            for (int i = 0; i < (d - 1) / 2; i++) {x--; y++; vr.pb({x, y}); }

            x--;
            vr.pb({x, y});


            for (int i = 0; i < (d - 1) / 2; i++){x++; y--; vr.pb({x, y}); }

            for (int i = 0; i < (c - 1) / 2; i++) {x--; y--; vr.pb({x, y});}


            for (int i = 0; i < b / 2; i++) {y--; vr.pb({x, y});}

            for (int i = 0; i < (a - 2) / 2; i++) {x--; vr.pb({x, y});}


            x--;
            vr.pb({x, y});


            x++; y--;

            vr.pb({x, y});
        } else if (a % 2 == 1 && b % 2 == 1 && c % 2 == 1 && d % 2 == 0)
        {
            for (int i = 0; i < (a - 1) / 2; i++) {x++; vr.pb({x, y}); }


            x++; y++;
            vr.pb({x, y});

            for (int i = 0; i < (b - 1) / 2; i++) {y++; vr.pb({x, y});}

            for (int i = 0; i < (c - 1) / 2; i++) { x++; y++; vr.pb({x, y});}

            for (int i = 0; i < d / 2; i++) {x--; y++; vr.pb({x, y});}


            x--;
            vr.pb({x, y});

            for (int i = 0; i < d / 2; i++){x++; y--; vr.pb({x, y}); }

            for (int i = 0; i < (c - 1) / 2; i++) {x--; y--; vr.pb({x, y});}

            for (int i = 0; i < (b - 1) / 2; i++) {y--; vr.pb({x, y});}

            for (int i = 0; i < (a - 1) / 2; i++) {x--; vr.pb({x, y});}


            y--;
            vr.pb({x, y});
        }
    }

    if (a == 0) for (auto it : vr) swap(it.F, it.S);

    if (c == 0) for (auto it : vr)  it.S = -it.S;

    if (c != 0 && d != 0 && c%2 == 0) for (auto it : vr)  it.S = -it.S;

    for (auto it : vr) cout << it.F << " " << it.S << endl;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB number of sticks is not consistent with the given input
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB number of sticks is not consistent with the given input
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB number of sticks is not consistent with the given input
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB number of sticks is not consistent with the given input
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB number of sticks is not consistent with the given input
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Incorrect 5 ms 384 KB number of sticks is not consistent with the given input
10 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Incorrect 5 ms 384 KB number of sticks is not consistent with the given input
10 Halted 0 ms 0 KB -

Subtask #10
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Incorrect 5 ms 384 KB number of sticks is not consistent with the given input
10 Halted 0 ms 0 KB -