QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#672443 | #9439. Aim High | yyyyxh | AC ✓ | 0ms | 1280kb | C++20 | 2.1kb | 2024-10-24 16:51:01 | 2024-10-24 16:51:02 |
Judging History
answer
#include <cctype>
#include <cstdio>
int read() {
char c = getchar();
int x = 0;
while (!isdigit(c))
c = getchar();
do
x = x * 10 + (c ^ 48), c = getchar();
while (isdigit(c));
return x;
}
int main() {
int tc = read();
while (tc--) {
int x = read();
if (x > 4) {
puts("-1");
continue;
}
puts("51");
puts("-1 -5 0 -5 0 -4");
puts("2 -5 1 -5 1 -4");
puts("-2 -4 -1 -4 -1 -3");
puts("3 -4 2 -4 2 -3");
puts("0 -4 1 -4 1 -3");
puts("1 -4 0 -4 0 -3");
puts("-3 -3 -2 -3 -2 -2");
puts("4 -3 3 -3 3 -2");
puts("-1 -3 0 -3 0 -2");
puts("0 -3 -1 -3 -1 -2");
puts("1 -3 2 -3 2 -2");
puts("2 -3 1 -3 1 -2");
puts("-4 -2 -3 -2 -3 -1");
puts("5 -2 4 -2 4 -1");
puts("-2 -2 -1 -2 -1 -1");
puts("-1 -2 -2 -2 -2 -1");
puts("0 -2 1 -2 1 -1");
puts("1 -2 0 -2 0 -1");
puts("2 -2 3 -2 3 -1");
puts("3 -2 2 -2 2 -1");
puts("-5 -1 -5 0 -4 0");
puts("-4 -1 -4 0 -3 0");
puts("6 -1 6 0 5 0");
puts("5 -1 5 0 4 0");
puts("-3 -1 -2 -1 -2 0");
puts("-2 -1 -3 -1 -3 0");
puts("-1 -1 0 -1 0 0");
puts("0 -1 -1 -1 -1 0");
puts("1 -1 2 -1 2 0");
puts("2 -1 1 -1 1 0");
puts("3 -1 4 -1 4 0");
puts("4 -1 3 -1 3 0");
puts("-4 0 -3 0 -3 1");
puts("-3 0 -2 0 -2 1");
puts("5 0 4 0 4 1");
puts("4 0 3 0 3 1");
puts("-1 0 0 0 0 1");
puts("0 0 -1 0 -1 1");
puts("1 0 2 0 2 1");
puts("2 0 1 0 1 1");
puts("-3 0 -2 0 -2 1");
puts("-3 1 -2 1 -2 2");
puts("4 0 3 0 3 1");
puts("4 1 3 1 3 2");
puts("-2 1 -2 2 -1 2");
puts("3 1 3 2 2 2");
puts("-1 1 0 1 0 2");
puts("2 1 1 1 1 2");
puts("-1 2 0 2 0 3");
puts("2 2 1 2 1 3");
puts("0 3 1 3 1 4");
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 1280kb
input:
1 1
output:
51 -1 -5 0 -5 0 -4 2 -5 1 -5 1 -4 -2 -4 -1 -4 -1 -3 3 -4 2 -4 2 -3 0 -4 1 -4 1 -3 1 -4 0 -4 0 -3 -3 -3 -2 -3 -2 -2 4 -3 3 -3 3 -2 -1 -3 0 -3 0 -2 0 -3 -1 -3 -1 -2 1 -3 2 -3 2 -2 2 -3 1 -3 1 -2 -4 -2 -3 -2 -3 -1 5 -2 4 -2 4 -1 -2 -2 -1 -2 -1 -1 -1 -2 -2 -2 -2 -1 0 -2 1 -2 1 -1 1 -2 0 -2 0 -1 2 -2 3 -...
result:
ok Output is valid. OK
Test #2:
score: 0
Accepted
time: 0ms
memory: 1244kb
input:
6 1 2 3 4 5 6
output:
51 -1 -5 0 -5 0 -4 2 -5 1 -5 1 -4 -2 -4 -1 -4 -1 -3 3 -4 2 -4 2 -3 0 -4 1 -4 1 -3 1 -4 0 -4 0 -3 -3 -3 -2 -3 -2 -2 4 -3 3 -3 3 -2 -1 -3 0 -3 0 -2 0 -3 -1 -3 -1 -2 1 -3 2 -3 2 -2 2 -3 1 -3 1 -2 -4 -2 -3 -2 -3 -1 5 -2 4 -2 4 -1 -2 -2 -1 -2 -1 -1 -1 -2 -2 -2 -2 -1 0 -2 1 -2 1 -1 1 -2 0 -2 0 -1 2 -2 3 -...
result:
ok Output is valid. OK
Extra Test:
score: 0
Extra Test Passed