#include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >> t;
while(t--){
int n, m;
cin >> n >> m;
if(min(n,m) == 2){
int x = max(n,m)-(max(n,m) % 2 == 0);
cout << x << "\n";
if(n < m){
for(int i = 1; i <= x; i++){
if(i % 2 == 1) cout << 4 << ' ';
else cout << -5 << ' ';
}
}
else {
for(int i = 1; i <= x; i++){
if(i % 2 == 1) cout << -5 << ' ';
else cout << 4 << ' ';
}
}
}
else {
if(n < m){
cout << m-1 << '\n';
for(int i = 1; i < m; i++){
cout << -1 << ' ';
}
}
else {
cout << n-1 << "\n";
for(int i = 1; i < n; i++){
cout << 1 << ' ';
}
}
}
cout << '\n';
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
336 KB |
Ok |
2 |
Correct |
1 ms |
336 KB |
Ok |
3 |
Correct |
1 ms |
336 KB |
Ok |
4 |
Correct |
1 ms |
336 KB |
Ok |
5 |
Correct |
1 ms |
336 KB |
Ok |
6 |
Correct |
1 ms |
336 KB |
Ok |
7 |
Correct |
1 ms |
336 KB |
Ok |
8 |
Correct |
1 ms |
336 KB |
Ok |
9 |
Correct |
1 ms |
336 KB |
Ok |
10 |
Correct |
1 ms |
504 KB |
Ok |
11 |
Correct |
1 ms |
336 KB |
Ok |
12 |
Correct |
1 ms |
336 KB |
Ok |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
there is incorrect sequence |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
592 KB |
Ok |
2 |
Correct |
1 ms |
336 KB |
Ok |
3 |
Incorrect |
1 ms |
504 KB |
there is incorrect sequence |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
Jury has the better answer : jans = 5, pans = 3 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
336 KB |
Ok |
2 |
Correct |
1 ms |
336 KB |
Ok |
3 |
Correct |
1 ms |
336 KB |
Ok |
4 |
Correct |
1 ms |
336 KB |
Ok |
5 |
Correct |
1 ms |
336 KB |
Ok |
6 |
Correct |
1 ms |
336 KB |
Ok |
7 |
Correct |
1 ms |
336 KB |
Ok |
8 |
Correct |
1 ms |
336 KB |
Ok |
9 |
Correct |
1 ms |
336 KB |
Ok |
10 |
Correct |
1 ms |
504 KB |
Ok |
11 |
Correct |
1 ms |
336 KB |
Ok |
12 |
Correct |
1 ms |
336 KB |
Ok |
13 |
Correct |
1 ms |
592 KB |
Ok |
14 |
Correct |
1 ms |
336 KB |
Ok |
15 |
Incorrect |
1 ms |
504 KB |
there is incorrect sequence |
16 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
336 KB |
Ok |
2 |
Correct |
1 ms |
336 KB |
Ok |
3 |
Correct |
1 ms |
336 KB |
Ok |
4 |
Correct |
1 ms |
336 KB |
Ok |
5 |
Correct |
1 ms |
336 KB |
Ok |
6 |
Correct |
1 ms |
336 KB |
Ok |
7 |
Correct |
1 ms |
336 KB |
Ok |
8 |
Correct |
1 ms |
336 KB |
Ok |
9 |
Correct |
1 ms |
336 KB |
Ok |
10 |
Correct |
1 ms |
504 KB |
Ok |
11 |
Correct |
1 ms |
336 KB |
Ok |
12 |
Correct |
1 ms |
336 KB |
Ok |
13 |
Incorrect |
1 ms |
336 KB |
there is incorrect sequence |
14 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
336 KB |
Ok |
2 |
Correct |
1 ms |
336 KB |
Ok |
3 |
Correct |
1 ms |
336 KB |
Ok |
4 |
Correct |
1 ms |
336 KB |
Ok |
5 |
Correct |
1 ms |
336 KB |
Ok |
6 |
Correct |
1 ms |
336 KB |
Ok |
7 |
Correct |
1 ms |
336 KB |
Ok |
8 |
Correct |
1 ms |
336 KB |
Ok |
9 |
Correct |
1 ms |
336 KB |
Ok |
10 |
Correct |
1 ms |
504 KB |
Ok |
11 |
Correct |
1 ms |
336 KB |
Ok |
12 |
Correct |
1 ms |
336 KB |
Ok |
13 |
Incorrect |
1 ms |
336 KB |
there is incorrect sequence |
14 |
Halted |
0 ms |
0 KB |
- |