oj.uz

Submission #495822

# Submission time Handle Problem Language Result Execution time Memory
495822 2021-12-20T05:50:46 Z Nuraly_Serikbay Nice sequence (IZhO18_sequence) C++14
0 / 100
 1 ms 204 KB 
#include <bits/stdc++.h>
  
#define endl "\n"
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define sz size()
#define rep(i,k,n) for(int i = k ; i <= n ; ++i)
#define per(i,k,n) for(int i = k ; i >= n ; --i)
#define Zymraq() ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define all(x) x.begin(),x.end()
#define fr(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define toqta return 0
#define PERMUTE next_permutation
#define no cout<<"No"<<endl;
#define yes cout<<"Yes"<<endl;
#define a() a + 1, a + n + 1  
 
  
using namespace std;
   
typedef long long ll;
typedef unsigned long long ull;
typedef string S;
typedef double ld;
typedef long double lld;
   
const int N = 1e6 + 17;
const int modd = 1e9 + 7;
const int INF = 1e9 - 19;
const int P = 37;
const ll NN = 1e7 + 17;
const ld eps = 1e-19;
const double pi = 3.141592653589793238462643383279 ;
   
 
bool sortbysec(const pair<int,int> &a, const pair<int,int> &b){
    return (a.second < b.second);
}
 
void pre (ll a) {
    cout << fixed << setprecision(a);
    return;
} 



int main () {
	ll t;
	cin >> t;
	while (t --) {
		ll n, m;
		cin >> n >> m;
		if (n == 2 && n < m && m % n != 0)  {
			cout << m << '\n';
			for (int i = 1; i <= m / 2; ++ i) {
				cout << -3 << ' ' << 4 << ' ';
			} 	
			cout << -3 << '\n';
			continue;
		}
		if (m == 2 && n > m && n % m != 0) {
			cout << n << '\n';
			for (int i = 1; i <= n / 2; ++ i) {
				cout << 3 << ' ' << -4 << ' ';
			}
			cout << 3 << '\n';
			continue;
		}
		if (n == m) {
			cout << 0 << '\n';
			continue;
		}
		if (n > m) {
			cout << n - 1 << '\n';
			for (int i = 1; i < n; ++ i) {
				cout << i << ' ';
			}
			cout << '\n';
		} else if (m > n){
			cout << m - 1 << '\n';
			for (int i = 1; i < m; ++ i) {
				cout << 0 - i << ' ';
			}
			cout << '\n';
		}
		
	}
	return 0;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Ok
2 Correct 0 ms 204 KB Ok
3 Incorrect 1 ms 204 KB Jury has the better answer : jans = 93, pans = 0
4 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Jury has the better answer : jans = 1, pans = 0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB there is incorrect sequence
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB there is incorrect sequence
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Ok
2 Correct 0 ms 204 KB Ok
3 Incorrect 1 ms 204 KB Jury has the better answer : jans = 93, pans = 0
4 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Ok
2 Correct 0 ms 204 KB Ok
3 Incorrect 1 ms 204 KB Jury has the better answer : jans = 93, pans = 0
4 Halted 0 ms 0 KB -

Subtask #7
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Ok
2 Correct 0 ms 204 KB Ok
3 Incorrect 1 ms 204 KB Jury has the better answer : jans = 93, pans = 0
4 Halted 0 ms 0 KB -