oj.uz

답안 #970968

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
970968 2024-04-27T16:10:45 Z Circling Hiperkocka (COCI21_hiperkocka) C++17
110 / 110
 39 ms 3792 KB 
/*The British Royal Family and a small cadre of English Fabian Socialists, in
conjunction with the Rockefellers and the Rothchilds, are engaged in a
conspiracy to greatly reduce the population of the human race in order to head
off a Malthusian catastrophe, a catastrophe that could easily be avoided by
simply building a massive amount of nuclear power plants and a number of massive
superhighways and bridges to connect all of the world's continents. But doing
that would cut into the conspiracy's profits. So the British Royal Family
invented environmentalism and neoliberalism in order to hide the truth. And in
order to further reduce the population, the British Royal Family is also the
world's foremost drug trafficking conspiracy. And it uses its control of the IMF
to push austerity in order to kill as many people in the global south as
possible.
And also Henry Kissinger is a gay KGB agent. */
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;


int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    int n, a, b, curr;
    cin >> n;
    cout << (1 << (n - 1)) << '\n';
    int value[n + 1];
    for (int i = 0; i <= n; i++) value[i] = -1;
    value[0] = 0;
    vector<vector<pair<int, int>>> tree;
    tree.resize(n + 1);
    for (int i = 0; i < n; i++){
        cin >> a >> b;
        tree[a].push_back({b, 1 << i});
        tree[b].push_back({a, 1 << i});
    }
    queue<int> searching;
    searching.push(0);
    while (!searching.empty()){
        curr = searching.front();
        searching.pop();
        for (pair<int, int> p: tree[curr]){
            if (value[p.first] == -1){
                value[p.first] = value[curr] ^ p.second;
                searching.push(p.first);
            }
        }
    }
    for (int i = 0; i < (1 << n); i = i - (i % 2) + 2){
        for (int j = 1; j < n; j++) i = i ^ ((i >> j) & 1);
        for (int j = 0; j <= n; j++) cout << (value[j] ^ i) << ' ';
        cout << '\n';
    }
}

Subtask #1
110.0 / 110.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 856 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 30 ms 3672 KB Output is correct
10 Correct 4 ms 604 KB Output is correct
11 Correct 8 ms 1628 KB Output is correct
12 Correct 31 ms 3672 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 33 ms 3712 KB Output is correct
15 Correct 15 ms 1880 KB Output is correct
16 Correct 10 ms 1112 KB Output is correct
17 Correct 31 ms 3640 KB Output is correct
18 Correct 31 ms 3536 KB Output is correct
19 Correct 39 ms 3668 KB Output is correct
20 Correct 32 ms 3792 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 32 ms 3608 KB Output is correct
23 Correct 32 ms 3668 KB Output is correct
24 Correct 31 ms 3664 KB Output is correct
25 Correct 31 ms 3672 KB Output is correct
26 Correct 19 ms 2604 KB Output is correct