oj.uz

Submission #519349

# Submission time Handle Problem Language Result Execution time Memory
519349 2022-01-26T08:47:37 Z KoD Sob (COCI19_sob) C++17
110 / 110
 78 ms 15156 KB 
#include <bits/stdc++.h>

using std::vector;
using std::array;
using std::pair;
using std::tuple;

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int N, M;
    std::cin >> N >> M;
    vector<pair<int, int>> ans;
    vector<int> X(N), Y(N);
    std::iota(X.begin(), X.end(), 0);
    std::iota(Y.begin(), Y.end(), M);
    while (N > 0) {
        int L = 1;
        while (L < N) {
            L <<= 1;
        }
        const int m = M & (L - 1);
        const int H = L / 2;
        if (m <= H) {
            const int len = N - m;
            for (int i = 0; i < len; ++i) {
                ans.emplace_back(X[i + m], Y[i]);
            }
            N -= len;
            M = m + len;
            X.erase(X.end() - len, X.end());
            Y.erase(Y.begin(), Y.begin() + len);
        } else {
            if ((m + N) - L >= H) {
                const int offset = L - m;
                for (int i = 0; i < H; ++i) {
                    ans.emplace_back(X[i], Y[i + offset]);
                }
                N -= H;
                M = m - H;
                X.erase(X.begin(), X.begin() + H);
                Y.erase(Y.begin() + offset, Y.begin() + offset + H);
            } else {
                for (int i = N - H; i < N; ++i) {
                    if (m + i >= L) {
                        ans.emplace_back(X[m + i - L], Y[i]);
                    } else {
                        ans.emplace_back(X[m + i - H], Y[i]);
                    }
                }
                X.erase(X.begin(), X.begin() + H);
                Y.erase(Y.end() - H, Y.end());
                N -= H;
                M = m - H;
            }
        }
    }
    for (const auto& [x, y] : ans) {
        assert((x & y) == x);
        std::cout << x << ' ' << y << '\n';
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 41 ms 8136 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 40 ms 8012 KB Output is correct
7 Correct 21 ms 4032 KB Output is correct

Subtask #3
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 41 ms 8136 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 40 ms 8012 KB Output is correct
11 Correct 21 ms 4032 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 308 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 11 ms 1996 KB Output is correct
20 Correct 32 ms 6152 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 45 ms 8648 KB Output is correct
24 Correct 78 ms 15156 KB Output is correct
25 Correct 77 ms 14968 KB Output is correct