oj.uz

Submission #684685

# Submission time Handle Problem Language Result Execution time Memory
684685 2023-01-22T10:38:52 Z mychecksedad Nice sequence (IZhO18_sequence) C++17
0 / 100
 1 ms 320 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define MOD (1e9+7)
#define all(x) x.begin(), x.end()
const int N = 1e6, K = 20;


int n, m, sw = 1;
vector<int> ans;
void solve(){
	cin >> n >> m;
	if(n < m) swap(n, m), sw = -1;

	if(n % m == 0){
		cout << n - 1 << '\n';
		for(int i = 0; i < n - 1; ++i) cout << sw << ' ';
		return;
	}else{
		cout << n << '\n';
		for(int i = 0; i < n; ++i){
			if(i % 2) cout << sw * (n/2 + 2) << ' ';
			else cout << sw * -(n/2+1) << ' ';
		}
		return;
	}

	cout << ans.size() << '\n';
	for(int v: ans) cout << v << ' ';
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	int t; cin >> t;
	while(t--){
		solve();
		cout << '\n';
	}
	return 0;
}

Subtask #1
0 / 6.0

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

Subtask #2
0 / 9.0

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

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Ok
2 Incorrect 1 ms 212 KB there is incorrect sequence
3 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

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

Subtask #5
0 / 14.0

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

Subtask #6
0 / 18.0

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

Subtask #7
0 / 24.0

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