QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #189255 | #2701. Impressive Integers | Beevo | WA | 1ms | 3612kb | C++20 | 1.7kb | 2023-09-27 05:23:17 | 2023-09-27 05:23:19 |
Judging History
answer
#include <bits/stdc++.h>
#define el '\n'
#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void testCase() {
int n;
cin >> n;
if (n == 2 || n == 3 || n == 5)
return cout << "impossible", void();
if (n == 1) {
cout << 1 << ' ' << 1 << ' ' << 1 << el;
cout << 'A' << ' ' << 0 << ' ' << 0 << ' ' << 'U';
return;
}
if (n & 1) {
cout << 1 << ' ' << (n - 3) / 4 << ' ' << 1 + (n - 3) / 2 << el;
for (int i = 0; i < n - 4; i++) {
if (i & 1)
cout << 'A' << ' ' << i / 2 << ' ' << 1 << ' ' << 'D' << el;
else
cout << 'A' << ' ' << i / 2 << ' ' << 0 << ' ' << 'U' << el;
}
cout << 'B' << ' ' << 0 << ' ' << 1 << ' ' << 'U' << el;
cout << 'B' << ' ' << (n - 3) / 4 << ' ' << 1 << ' ' << 'U' << el;
cout << 'B' << ' ' << 0 << ' ' << 1 + (n - 3) / 4 << ' ' << 'D' << el;
cout << 'B' << ' ' << 0 << ' ' << 1 + (n - 3) / 4 << ' ' << 'U' << el;
}
else {
cout << 1 << ' ' << n / 2 - 1 << ' ' << n / 2 << el;
for (int i = 0; i < n - 1; i++) {
if (i & 1)
cout << 'A' << ' ' << i / 2 << ' ' << 1 << ' ' << 'D' << el;
else
cout << 'A' << ' ' << i / 2 << ' ' << 0 << ' ' << 'U' << el;
}
cout << 'B' << ' ' << 0 << ' ' << 1 << ' ' << 'U';
}
}
signed main() {
Beevo
int t = 1;
// cin >> t;
while (t--)
testCase();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3436kb
input:
1
output:
1 1 1 A 0 0 U
result:
ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3448kb
input:
2
output:
impossible
result:
ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
3
output:
impossible
result:
ok
Test #4:
score: 0
Accepted
time: 1ms
memory: 3488kb
input:
4
output:
1 1 2 A 0 0 U A 0 1 D A 1 0 U B 0 1 U
result:
ok
Test #5:
score: 0
Accepted
time: 0ms
memory: 3564kb
input:
5
output:
impossible
result:
ok
Test #6:
score: 0
Accepted
time: 0ms
memory: 3488kb
input:
6
output:
1 2 3 A 0 0 U A 0 1 D A 1 0 U A 1 1 D A 2 0 U B 0 1 U
result:
ok
Test #7:
score: -100
Wrong Answer
time: 0ms
memory: 3444kb
input:
7
output:
1 1 3 A 0 0 U A 0 1 D A 1 0 U B 0 1 U B 1 1 U B 0 2 D B 0 2 U
result:
wrong answer Uncovered areas!