oj.uz

답안 #217633

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
217633 2020-03-30T11:24:52 Z Lego Konstrukcija (COCI20_konstrukcija) C++17
110 / 110
 5 ms 384 KB 
#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;

struct graf {
    int n;
    vector<pair<int, int>> edg;
    vector<int> back_l;
    graf(int _n, vector<pair<int, int>> edg_) {
        n = _n;
        edg = edg_;
    }
    graf() {
        n = 1;
        back_l.push_back(1);
    }

    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) {
        graf g(3, {{1, 2}, {2, 3}});
        g.print();
        return;
    }
    graf g;
    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 = g.mylt_min_2(pref);
        if(binary[i]) {
            if(pref < 0)
                pref = g.fun1(pref);
            else
                pref = g.fun2(pref);
        }
    }
    //assert(abs(k) == abs(pref));
    if(pref == k) g.fun3();
    else g.fun4();
    g.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
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Correct.
2 Correct 5 ms 384 KB Correct.
3 Correct 4 ms 384 KB Correct.
4 Correct 5 ms 384 KB Correct.
5 Correct 4 ms 384 KB Correct.

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Correct.
2 Correct 5 ms 384 KB Correct.
3 Correct 5 ms 384 KB Correct.
4 Correct 5 ms 384 KB Correct.
5 Correct 5 ms 384 KB Correct.

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Correct.
2 Correct 5 ms 384 KB Correct.
3 Correct 4 ms 384 KB Correct.
4 Correct 5 ms 384 KB Correct.
5 Correct 4 ms 384 KB Correct.
6 Correct 4 ms 384 KB Correct.
7 Correct 5 ms 384 KB Correct.
8 Correct 5 ms 384 KB Correct.
9 Correct 5 ms 384 KB Correct.
10 Correct 5 ms 384 KB Correct.
11 Correct 5 ms 384 KB Correct.
12 Correct 5 ms 384 KB Correct.
13 Correct 5 ms 384 KB Correct.
14 Correct 5 ms 384 KB Correct.
15 Correct 5 ms 384 KB Correct.

Subtask #4
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Correct.
2 Correct 5 ms 384 KB Correct.
3 Correct 4 ms 384 KB Correct.
4 Correct 5 ms 384 KB Correct.
5 Correct 4 ms 384 KB Correct.
6 Correct 4 ms 384 KB Correct.
7 Correct 5 ms 384 KB Correct.
8 Correct 5 ms 384 KB Correct.
9 Correct 5 ms 384 KB Correct.
10 Correct 5 ms 384 KB Correct.
11 Correct 5 ms 384 KB Correct.
12 Correct 5 ms 384 KB Correct.
13 Correct 5 ms 384 KB Correct.
14 Correct 5 ms 384 KB Correct.
15 Correct 5 ms 384 KB Correct.
16 Correct 5 ms 384 KB Correct.
17 Correct 5 ms 384 KB Correct.
18 Correct 5 ms 384 KB Correct.
19 Correct 5 ms 384 KB Correct.
20 Correct 5 ms 384 KB Correct.
21 Correct 5 ms 384 KB Correct.
22 Correct 5 ms 384 KB Correct.
23 Correct 5 ms 384 KB Correct.
24 Correct 5 ms 384 KB Correct.
25 Correct 5 ms 384 KB Correct.
26 Correct 5 ms 384 KB Correct.
27 Correct 5 ms 384 KB Correct.