제출 #557145

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
557145		Yazan_Alattar	Pick (COI18_pick)	C++14	5 / 100	0 ms	320 KiB

pick

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 200007;
const ll inf = 2e9;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const double eps = 1e-6;
const int dx[] = {0, -1, 0, 1}, dy[] = {1, 0, -1, 0};
const int block = 320;

int a, b, c, d, x, y;

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> b >> a >> c >> d;

    assert(a % 2 == 0);
    assert(b % 2 == 0);

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

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

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


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

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

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

    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 20