제출 #240836

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

pick

#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;



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;

        while (x < a / 2) {cout << x << " " << y << endl; x++;}

        y += b / 2;

        x = 0;

        while (x < a / 2) {cout << x << " " << y << endl; x++;}

        x = 0; y = 1;

        while (y <= b / 2) {cout << x << " " << y << endl; y++;}

        x += a / 2;

        y = 1;

        while (y <= b / 2) {cout << x << " " << y << endl; y++;}

        exit(0);
    }
}

• Subtask 1: 0 / 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