제출 #862034

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
862034		Rifal	Pick (COI18_pick)	C++14	10 / 100	1 ms	348 KiB

pick

#include <bits/stdc++.h>
#include <fstream>
#define endl '\n'
#define mod 998244353
#define INF 900000000
//#define cin fin
//#define cout fout
//#define fi first
//#define se second
using namespace std;
//ofstream fout("intel.out");
//ifstream fin("intel.in");
 int x = 0, y = 0;
void sol(int cur, int ty, int op) {
    while(cur--) {
        if(ty == 0) {
            if(op == 1) x++;
            else x--;
        }
        else if(ty == 1){
            if(op == 1) y++;
            else y--;
        }
        else if(ty == 2){
            if(op == 1) {
                x++; y++;
            }
            else {
                x--; y--;
            }
        }
        else {
            if(op == 1) {
                x++; y--;
            }
            else {
                x--; y++;
            }
        }
        cout << x << ' ' << y << endl;
    }
}
int main()
{
    ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
    int a, b, c, d; cin >> a >> b >> c >> d;
    if(c == 0 && d == 0) {
        int cur = b/2;
        cout << x << ' ' << y << endl;
        sol(cur,1,1);
        x++; cout << x << ' ' << y << endl;
        cur = b/2-1;
        sol(cur,1,0);
        cur = a/2-1;
        sol(cur,0,1);
        y--; cout << x <<' ' << y << endl;
        cur = a/2-1;
        sol(cur,0,0);
    }
    else if(a == 0 && b == 0) {
        int cur = c/2;
        cout << x << ' ' << y << endl;
        sol(cur,2,1);
        x--; y++;
        cout << x << ' ' << y << endl;
        cur = c/2-1;
        sol(cur,2,0);
        cur = d/2-1;
        sol(cur,3,0);
        x--; y--;
        cout << x << ' ' << y << endl;
        cur = d/2-1;
        sol(cur,3,1);
    }
 return 0;
}

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