QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#129391#6131. TournamentEnergy_is_not_over#AC ✓13ms5832kbC++172.1kb2023-07-22 18:05:302023-07-22 18:05:33

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-07-22 18:05:33]
  • 评测
  • 测评结果:AC
  • 用时:13ms
  • 内存:5832kb
  • [2023-07-22 18:05:30]
  • 提交

answer

//
// Stvoreno mustangom288 o 22.07.2023 11:37:10
//

#include <bits/stdc++.h>

#define F first
#define S second
#define MP make_pair
#define PB push_back

#define all(a) a.begin(), a.end()
#define len(a) (int) (a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

#ifdef Energy_is_not_over
#define DEBUG for (bool ____DEBUG = true; ____DEBUG; ____DEBUG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl

template<class ...Ts>
auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }

#else
#define DEBUG while (false)
#define LOG(...)
#endif

const int max_n = 1011, inf = 1000111222;
int n, k;
int ans[max_n][max_n];

void solve() {
    int maxp2 = 1;
    while((n % (maxp2 * 2) == 0)) {
        maxp2 *= 2;
    }
    if (k >= maxp2) {
        cout << "Impossible" << "\n";
        return;
    }
    int step = 2;
    for (int it = 1; it <= k; ++it) {
        if (it == step) {
            step *= 2;
        }
        if (it == 1) {
            for (int i = 0; i < n; ++i) {
                ans[it][i] = i ^ 1;
            }
        } else {
            ans[it][0] = it;
            ans[it][it] = 0;
            for (int i = 1; i < step / 2; ++i) {
                int to = ans[i][it];
                ans[it][to] = i;
                ans[it][i] = to;
            }
            for (int k = step; k < n; k += step) {
                for (int j = 0; j < step; ++j) {
                    ans[it][k + j] = k + ans[it][j];
                }
            }
        }
        for (int i = 0; i < n; ++i) {
            cout << ans[it][i] + 1;
            if (i + 1 == n) {
                cout << "\n";
            } else {
                cout << ' ';
            }
        }
    }
}

int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int T;
    cin >> T;
    while(T--) {
        cin >> n >> k;
        solve();
    }

    return 0;
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3484kb

input:

2
3 1
4 3

output:

Impossible
2 1 4 3
3 4 1 2
4 3 2 1

result:

ok 4 lines

Test #2:

score: 0
Accepted
time: 1ms
memory: 3592kb

input:

100
1 4
2 1
2 2
2 3
3 6
4 2
4 3
4 4
4 5
5 4
6 1
6 2
6 4
7 1
8 3
8 7
8 8
8 14
9 4
10 1
10 2
10 3
12 2
12 3
12 4
12 8
13 2
14 1
14 2
14 4
15 4
16 9
16 15
16 16
16 28
17 6
18 1
18 2
18 4
19 5
20 1
20 3
20 4
20 6
21 1
22 1
22 2
22 3
23 4
24 5
24 7
24 8
24 15
25 3
26 1
26 2
26 3
27 5
28 1
28 3
28 4
28 6
...

output:

Impossible
2 1
Impossible
Impossible
Impossible
2 1 4 3
3 4 1 2
2 1 4 3
3 4 1 2
4 3 2 1
Impossible
Impossible
Impossible
2 1 4 3 6 5
Impossible
Impossible
Impossible
2 1 4 3 6 5 8 7
3 4 1 2 7 8 5 6
4 3 2 1 8 7 6 5
2 1 4 3 6 5 8 7
3 4 1 2 7 8 5 6
4 3 2 1 8 7 6 5
5 6 7 8 1 2 3 4
6 5 8 7 2 1 4 3
7 8 5 ...

result:

ok 194 lines

Test #3:

score: 0
Accepted
time: 13ms
memory: 5832kb

input:

5
512 511
512 513
896 120
896 130
960 60

output:

2 1 4 3 6 5 8 7 10 9 12 11 14 13 16 15 18 17 20 19 22 21 24 23 26 25 28 27 30 29 32 31 34 33 36 35 38 37 40 39 42 41 44 43 46 45 48 47 50 49 52 51 54 53 56 55 58 57 60 59 62 61 64 63 66 65 68 67 70 69 72 71 74 73 76 75 78 77 80 79 82 81 84 83 86 85 88 87 90 89 92 91 94 93 96 95 98 97 100 99 102 101 ...

result:

ok 693 lines

Test #4:

score: 0
Accepted
time: 1ms
memory: 3468kb

input:

30
184 17
154 3
172 2
138 10
156 13
130 3
168 7
170 4
146 3
198 3
134 11
116 1
132 7
140 2
130 9
174 5
182 4
106 4
174 2
182 2
104 14
168 13
198 1
110 3
176 9
198 9
156 11
148 2
118 10
150 8

output:

Impossible
Impossible
2 1 4 3 6 5 8 7 10 9 12 11 14 13 16 15 18 17 20 19 22 21 24 23 26 25 28 27 30 29 32 31 34 33 36 35 38 37 40 39 42 41 44 43 46 45 48 47 50 49 52 51 54 53 56 55 58 57 60 59 62 61 64 63 66 65 68 67 70 69 72 71 74 73 76 75 78 77 80 79 82 81 84 83 86 85 88 87 90 89 92 91 94 93 96 95...

result:

ok 47 lines