Submission #210114

#	Time	Username	Problem	Language	Result	Execution time	Memory
210114		SorahISA	Pick (COI18_pick)	C++17	10 / 100	5 ms	380 KiB

pick

// #pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")

// #include <bits/extc++.h>
// using namespace __gnu_pbds;

#include <bits/stdc++.h>
using namespace std;

#define int long long
// template <typename T>
// using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;

#define X first
#define Y second

#define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define RANDOM() random_device __rd; \
                 mt19937 __gen = mt19937(__rd()); \
                 uniform_int_distribution<int> __dis(0, 1); \
                 auto rnd = bind(__dis, __gen);

const int INF = 1E18;
const int mod = 1E9 + 7;

int32_t main() {
    fastIO();
    
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    
    /// subtask 1 ///
    if (c == 0 and d == 0) {
        for (int i = 0; i <= a/2; ++i)
            cout << i << " " << 0 << "\n";
        
        for (int i = 1; i <= b/2; ++i)
            cout << a/2 << " " << i << "\n";
        
        for (int i = b/2; i >= 1; --i)
            cout << a/2-1 << " " << i << "\n";
        
        for (int i = a/2-2; i >= 0; --i)
            cout << i << " " << 1 << "\n";
        
        return 0;
    }
    
    /// subtask 2 ///
    if (a == 0 and b == 0) {
        for (int i = 0; i <= c/2; ++i)
            cout << i << " " << i << "\n";
        
        for (int i = c/2; i >= 1; --i)
            cout << i-1 << " " << i+1 << "\n";
        
        for (int i = 1; i <= d/2-1; ++i)
            cout << -i << " " << i+2 << "\n";
        
        for (int i = d/2; i >= 1; --i)
            cout << -i << " " << i << "\n";
        
        return 0;
    }
    
    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