oj.uz

Submission #684785

# Submission time Handle Problem Language Result Execution time Memory
684785 2023-01-22T13:10:36 Z mychecksedad Nice sequence (IZhO18_sequence) C++17
15 / 100
 7 ms 596 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;
	sw = 1;
	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 + m - 2 << '\n';
		for(int i = 0; i < n + m - 2; ++i){
			if(i % 2) cout << sw * (n/m + 2) << ' ';
			else cout << sw * -(n/m+1) << ' ';
		}
		return;
	}

}

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

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Ok
2 Correct 1 ms 324 KB Ok
3 Correct 1 ms 212 KB Ok
4 Correct 0 ms 324 KB Ok
5 Correct 1 ms 212 KB Ok
6 Correct 0 ms 212 KB Ok
7 Correct 1 ms 212 KB Ok
8 Correct 0 ms 316 KB Ok
9 Correct 1 ms 212 KB Ok
10 Correct 1 ms 212 KB Ok
11 Correct 1 ms 320 KB Ok
12 Correct 0 ms 212 KB Ok

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Ok
2 Correct 0 ms 320 KB Ok
3 Correct 1 ms 320 KB Ok
4 Correct 1 ms 212 KB Ok
5 Correct 0 ms 212 KB Ok
6 Correct 2 ms 340 KB Ok
7 Correct 7 ms 596 KB Ok
8 Correct 3 ms 468 KB Ok
9 Correct 7 ms 596 KB Ok
10 Correct 4 ms 468 KB Ok

Subtask #3
0 / 14.0

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

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 324 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 212 KB Ok
2 Correct 1 ms 324 KB Ok
3 Correct 1 ms 212 KB Ok
4 Correct 0 ms 324 KB Ok
5 Correct 1 ms 212 KB Ok
6 Correct 0 ms 212 KB Ok
7 Correct 1 ms 212 KB Ok
8 Correct 0 ms 316 KB Ok
9 Correct 1 ms 212 KB Ok
10 Correct 1 ms 212 KB Ok
11 Correct 1 ms 320 KB Ok
12 Correct 0 ms 212 KB Ok
13 Correct 0 ms 212 KB Ok
14 Correct 1 ms 212 KB Ok
15 Correct 1 ms 212 KB Ok
16 Incorrect 1 ms 324 KB there is incorrect sequence
17 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Ok
2 Correct 1 ms 324 KB Ok
3 Correct 1 ms 212 KB Ok
4 Correct 0 ms 324 KB Ok
5 Correct 1 ms 212 KB Ok
6 Correct 0 ms 212 KB Ok
7 Correct 1 ms 212 KB Ok
8 Correct 0 ms 316 KB Ok
9 Correct 1 ms 212 KB Ok
10 Correct 1 ms 212 KB Ok
11 Correct 1 ms 320 KB Ok
12 Correct 0 ms 212 KB Ok
13 Correct 0 ms 212 KB Ok
14 Correct 0 ms 320 KB Ok
15 Correct 1 ms 320 KB Ok
16 Correct 1 ms 212 KB Ok
17 Correct 0 ms 212 KB Ok
18 Correct 2 ms 340 KB Ok
19 Correct 7 ms 596 KB Ok
20 Correct 3 ms 468 KB Ok
21 Correct 7 ms 596 KB Ok
22 Correct 4 ms 468 KB Ok
23 Correct 0 ms 212 KB Ok
24 Correct 1 ms 212 KB Ok
25 Correct 1 ms 212 KB Ok
26 Incorrect 1 ms 324 KB there is incorrect sequence
27 Halted 0 ms 0 KB -

Subtask #7
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Ok
2 Correct 1 ms 324 KB Ok
3 Correct 1 ms 212 KB Ok
4 Correct 0 ms 324 KB Ok
5 Correct 1 ms 212 KB Ok
6 Correct 0 ms 212 KB Ok
7 Correct 1 ms 212 KB Ok
8 Correct 0 ms 316 KB Ok
9 Correct 1 ms 212 KB Ok
10 Correct 1 ms 212 KB Ok
11 Correct 1 ms 320 KB Ok
12 Correct 0 ms 212 KB Ok
13 Correct 0 ms 212 KB Ok
14 Correct 0 ms 320 KB Ok
15 Correct 1 ms 320 KB Ok
16 Correct 1 ms 212 KB Ok
17 Correct 0 ms 212 KB Ok
18 Correct 2 ms 340 KB Ok
19 Correct 7 ms 596 KB Ok
20 Correct 3 ms 468 KB Ok
21 Correct 7 ms 596 KB Ok
22 Correct 4 ms 468 KB Ok
23 Correct 0 ms 212 KB Ok
24 Correct 1 ms 212 KB Ok
25 Correct 1 ms 212 KB Ok
26 Incorrect 1 ms 324 KB there is incorrect sequence
27 Halted 0 ms 0 KB -