Submission #217636

#	Time	Username	Problem	Language	Result	Execution time	Memory
217636		Lego	Konstrukcija (COCI20_konstrukcija)	C++17	0 / 110	5 ms	384 KiB

Main

#include <bits/stdc++.h>

#define intl int
#define int long long
#define double long double

const bool MULTI_TEST = false;
const intl mod = 1e9 + 7, maxn = 400002, maxm = 2e5 + 1;

using namespace std;

int n;
vector<pair<int, int>> edg;
vector<int> back_l;


int mylt_min_2(int pref) {
    vector<int> new_ = {n + 1, n + 2, n + 3};
    for (auto x : back_l)
        for (auto y : new_)
            edg.push_back({x, y});
    back_l = new_;
    n = n + 3;
    return -2 * pref;
}

int fun1(int pref) {
    edg.push_back({1, n + 1});
    back_l.push_back(n + 1);
    n = n + 1;
    return pref - 1;
}

int fun2(int pref) {
    vector<int> novi = {n + 1, n + 2};
    for (auto x : back_l)
        for (auto y : novi)
            edg.push_back({x, y});
    edg.push_back({1, n + 3});
    novi.push_back(n + 3);
    back_l = novi;
    n = n + 3;
    return -pref - 1;
}

void fun3() {
    vector<int> novi = {n + 1, n + 2};
    for (auto x : back_l)
        for (auto y : novi)
            edg.push_back({x, y});
    back_l = novi;
    for (auto x : back_l)
        edg.push_back({x, n + 3});
    n = n + 3;
}

void fun4() {
    for (auto x : back_l)
        edg.push_back({x, n + 1});
    n = n + 1;
}

void print() {
    cout << n << ' ' << edg.size() << "\n";
    for (auto p : edg)
        cout << p.first << ' ' << p.second << "\n";
}

void solve() {
    int k;
    cin >> k;
    int k_ = abs(k);
    if (k == 0) {
        n = 3;
        edg = {{1, 2}, {2, 3}};
        print();
        return;
    }
    vector<int> binary;
    while (k_ > 0) {
        if (k_ & 1) binary.push_back(1);
        else binary.push_back(0);
        k_ /= 2;
    }
    reverse(binary.begin(), binary.end());
    int pref = 1;
    for (int i = 1; i < (int) binary.size(); i++) {
        pref = mylt_min_2(pref);
        if (binary[i]) {
            if (pref < 0)
                pref = fun1(pref);
            else
                pref = fun2(pref);
        }
    }
    //assert(abs(k) == abs(pref));
    if (pref == k) fun3();
    else fun4();
    print();
}


signed main() {
//#ifdef _DEBUG
    //freopen("qual.in", "r", stdin);freopen("qual.out", "w", stdout);
//#endif
//
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    if (MULTI_TEST) {
        std::cin >> t;
    }

    for (int i = 0; i < t; i++) {
        solve();
    }
    return 0;
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 15
• Subtask 3: 0 / 20
• Subtask 4: 0 / 60