답안 #334894

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
334894	2020-12-10T07:16:06 Z	tengiz05	Nice sequence (IZhO18_sequence)	C++17	6 / 100	1 ms	384 KB

sequence

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
const int mod = 1e9+7, N = 2e5+5;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val);}
int n, m, k;

void solve(int test_case){
	int i, j;
	cin >> n >> m;
	if(max(n,m)%min(n,m) == 0){
		if(n >= m){
			cout << n-1 << '\n';
			for(i=1;i<n;i++){
				cout << 1 << ' ';
			}cout << '\n';
		}else {
			cout << m-1 << '\n';
			for(i=1;i<m;i++){
				cout << -1 << ' ';
			}cout << '\n';
		}
	}else if(min(n, m) == 2){
		if(n > m){
			cout << n << '\n';
			for(i=0;i<n;i++){
				if(i%2==0)cout << -2 << ' ' ;
				else cout << 3 << ' ' ;
			}cout << '\n';
		}else if(n < m){
			cout << m << '\n';
			for(i=0;i<m;i++){
				if(i%2==0)cout << 2 << ' ' ;
				else cout << -3 << ' ' ;
			}cout << '\n';
		}else {
			cout << 0 << '\n';
		}
	}
	
	return;
}

signed main(){
	FASTIO;
#define MULTITEST 1
#if MULTITEST
	int ___T;
	cin >> ___T;
	for(int T_CASE = 1; T_CASE <= ___T; T_CASE++)
		solve(T_CASE);
#else
	solve(1);
#endif
	return 0;
}

Compilation message

sequence.cpp: In function 'void solve(long long int)':
sequence.cpp:17:9: warning: unused variable 'j' [-Wunused-variable]
   17 |  int i, j;
      |         ^

Subtask #1

6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Ok
2	Correct	1 ms	364 KB	Ok
3	Correct	1 ms	364 KB	Ok
4	Correct	1 ms	364 KB	Ok
5	Correct	1 ms	364 KB	Ok
6	Correct	1 ms	364 KB	Ok
7	Correct	1 ms	364 KB	Ok
8	Correct	1 ms	364 KB	Ok
9	Correct	1 ms	364 KB	Ok
10	Correct	1 ms	364 KB	Ok
11	Correct	1 ms	364 KB	Ok
12	Correct	1 ms	364 KB	Ok

Subtask #2

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	364 KB	there is incorrect sequence
2	Halted	0 ms	0 KB	-

Subtask #3

0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	364 KB	Ok
2	Correct	1 ms	364 KB	Ok
3	Incorrect	1 ms	384 KB	there is incorrect sequence
4	Halted	0 ms	0 KB	-

Subtask #4

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	384 KB	Unexpected end of file - int32 expected
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Ok
2	Correct	1 ms	364 KB	Ok
3	Correct	1 ms	364 KB	Ok
4	Correct	1 ms	364 KB	Ok
5	Correct	1 ms	364 KB	Ok
6	Correct	1 ms	364 KB	Ok
7	Correct	1 ms	364 KB	Ok
8	Correct	1 ms	364 KB	Ok
9	Correct	1 ms	364 KB	Ok
10	Correct	1 ms	364 KB	Ok
11	Correct	1 ms	364 KB	Ok
12	Correct	1 ms	364 KB	Ok
13	Correct	0 ms	364 KB	Ok
14	Correct	1 ms	364 KB	Ok
15	Incorrect	1 ms	384 KB	there is incorrect sequence
16	Halted	0 ms	0 KB	-

Subtask #6

0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Ok
2	Correct	1 ms	364 KB	Ok
3	Correct	1 ms	364 KB	Ok
4	Correct	1 ms	364 KB	Ok
5	Correct	1 ms	364 KB	Ok
6	Correct	1 ms	364 KB	Ok
7	Correct	1 ms	364 KB	Ok
8	Correct	1 ms	364 KB	Ok
9	Correct	1 ms	364 KB	Ok
10	Correct	1 ms	364 KB	Ok
11	Correct	1 ms	364 KB	Ok
12	Correct	1 ms	364 KB	Ok
13	Incorrect	1 ms	364 KB	there is incorrect sequence
14	Halted	0 ms	0 KB	-

Subtask #7

0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Ok
2	Correct	1 ms	364 KB	Ok
3	Correct	1 ms	364 KB	Ok
4	Correct	1 ms	364 KB	Ok
5	Correct	1 ms	364 KB	Ok
6	Correct	1 ms	364 KB	Ok
7	Correct	1 ms	364 KB	Ok
8	Correct	1 ms	364 KB	Ok
9	Correct	1 ms	364 KB	Ok
10	Correct	1 ms	364 KB	Ok
11	Correct	1 ms	364 KB	Ok
12	Correct	1 ms	364 KB	Ok
13	Incorrect	1 ms	364 KB	there is incorrect sequence
14	Halted	0 ms	0 KB	-