Submission #225271

#	Time	Username	Problem	Language	Result	Execution time	Memory
225271		SorahISA	Sob (COCI19_sob)	C++17	110 / 110	301 ms	30712 KiB

sob

// #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
#define double long double
// 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 ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back

#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 n, m;
    cin >> n >> m;
    
    set<int> st;
    for (int i = m; i < m+n; ++i) st.insert(i);
    
    for (int i = n-1; i >= 0; --i) {
        for (auto x : st) {
            if ((x&i) == i) {
                while (st.count(x) and (x&i) == i) {
                    cout << i << " " << x << "\n";
                    st.erase(x);
                    --i, --x;
                }
                ++i;
                break;
            }
        }
    }
    
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 29 / 29
• Subtask 3: 39 / 39
• Subtask 4: 32 / 32