| Task: | Ruudukko |
| Sender: | lady-stardust |
| Submission time: | 2019-09-30 13:37:20 +0300 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 100 |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.01 s | details |
| #2 | ACCEPTED | 0.01 s | details |
| #3 | ACCEPTED | 0.01 s | details |
| #4 | ACCEPTED | 0.01 s | details |
| #5 | ACCEPTED | 0.02 s | details |
| #6 | ACCEPTED | 0.02 s | details |
Code
#include <bits/stdc++.h>
using namespace std;
int taita(double x, double y, double p, int limit, map<int, map<int, int>> &m, double rootVal) {
auto d = pow(2, p);
auto d2 = pow(2, p - 1);
double newX = x;
double newY = y;
if (fmod(x, d) > d2 || fmod(x, d) == 0) {
newX -= d2;
newY += d2;
} else {
newX += d2;
newY += d2;
}
if (newX > limit || newY > limit) {
return 1;
}
m[newY][newX] = rootVal;
p++;
taita(x, y, p, limit, m, rootVal);
taita(newX, newY, p, limit, m, rootVal);
return 1;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
map<int, map<int, int>> m;
int fixedN = pow(2, ceil(log2(n)));
for (int i = 1; i <= fixedN; i++) {
m[1][i] = i;
taita(i, 1, 1, fixedN, m, i);
}
for (int y = 1; y <= n; y++) {
for (int x = 1; x <= n; x++) {
cout << m[y][x];
if (x != n) {
cout << " ";
}
}
cout << "\n";
}
}Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 1 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 2 |
| correct output |
|---|
| 1 2 2 1 |
| user output |
|---|
| 1 2 2 1 |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 5 |
| correct output |
|---|
| 1 2 3 4 5 2 1 4 3 6 3 4 1 2 7 4 3 2 1 8 5 6 7 8 1 |
| user output |
|---|
| 1 2 3 4 5 2 1 4 3 6 3 4 1 2 7 4 3 2 1 8 5 6 7 8 1 |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 42 |
| correct output |
|---|
| 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| 1 2 3 4 5 6 7 8 9 10 11 12 13 ... Truncated |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 99 |
| correct output |
|---|
| 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| 1 2 3 4 5 6 7 8 9 10 11 12 13 ... Truncated |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 100 |
| correct output |
|---|
| 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| 1 2 3 4 5 6 7 8 9 10 11 12 13 ... Truncated |
