oj.uz

Submission #342737

# Submission time Handle Problem Language Result Execution time Memory
342737 2021-01-02T17:13:48 Z David_M Nice sequence (IZhO18_sequence) C++14
15 / 100
 19 ms 24556 KB 
#include <bits/stdc++.h> 
#define ll long long
#define F first
#define S second
#define FF first.first
#define FS first.second
#define pb push_back
using namespace std;
const ll N=200006, INF=1e18;
     
ll pos, l, r, n, m, t, a[N], b[N], h[N], p[20][N], q, k, x, y;
vector <ll> v[N];
set <ll> s[N], S[N];

int main(){ios_base::sync_with_stdio(false), cin.tie(0);
	cin>>q;
	while(q--){
		cin>>n>>m;
	
		if (n>m){
			if(n%m==0){
				cout<<n-1<<'\n';
				for (int i=1; i<n; i++)cout<<"1 ";
				cout<<'\n';
				continue;
			}
			if(m==2){
				cout<<n<<"\n-999999999 ";
				for (int i=1; i<n; i+=2)cout<<"1000000000 -999999999 ";
				cout<<'\n';
				continue;
			}
			if(n==m+1){
				cout<<m*2-1<<'\n';
				for (int i=1; i<m; i++)cout<<"-2 ";
				cout<<2*m-1;
				for (int i=1; i<m; i++)cout<<" -2";
				cout<<'\n';
			}
			if(n==m+2){
				cout<<m*2<<'\n';
				for (int i=1; i<m-1; i++)cout<<"2 ";
				cout<<-m-1<<" 2 2 "<<-m-1;
				for (int i=1; i<m-1; i++)cout<<" 2";
				cout<<'\n';
			}
		}else{
			if(m%n==0){
				cout<<m-1<<'\n';
				for (int i=1; i<m; i++)cout<<"-1 ";
				cout<<'\n';
				continue;
			}
			if(n==2){
				cout<<m<<"\n999999999 ";
				for (int i=1; i<m; i+=2)cout<<"-1000000000 999999999 ";
				cout<<'\n';
				continue;
			}
			if(m==n+1){
				cout<<n*2-1<<'\n';
				for (int i=1; i<n; i++)cout<<"2 ";
				cout<<-2*n+1;
				for (int i=1; i<n; i++)cout<<" 2";
				cout<<'\n';
			}
			if(m==n+2){
				cout<<n*2<<'\n';
				for (int i=1; i<n-1; i++)cout<<"-2 ";
				cout<<n+1<<" -2 -2 "<<n+1;
				for (int i=1; i<n-1; i++)cout<<" -2";
				cout<<'\n';
			}
		}
	}
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23788 KB Ok
2 Correct 14 ms 23788 KB Ok
3 Correct 14 ms 23788 KB Ok
4 Correct 15 ms 23788 KB Ok
5 Correct 15 ms 23788 KB Ok
6 Correct 14 ms 23788 KB Ok
7 Correct 14 ms 23788 KB Ok
8 Correct 16 ms 23788 KB Ok
9 Correct 15 ms 23788 KB Ok
10 Correct 14 ms 23788 KB Ok
11 Correct 14 ms 23788 KB Ok
12 Correct 14 ms 23788 KB Ok

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23808 KB Ok
2 Correct 14 ms 23788 KB Ok
3 Correct 14 ms 23788 KB Ok
4 Correct 14 ms 23788 KB Ok
5 Correct 15 ms 23788 KB Ok
6 Correct 15 ms 23916 KB Ok
7 Correct 17 ms 24428 KB Ok
8 Correct 16 ms 24172 KB Ok
9 Correct 19 ms 24556 KB Ok
10 Correct 16 ms 24172 KB Ok

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23788 KB Ok
2 Correct 15 ms 23788 KB Ok
3 Correct 14 ms 23788 KB Ok
4 Incorrect 15 ms 23808 KB Jury has the better answer : jans = 9, pans = 2
5 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

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

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23788 KB Ok
2 Correct 14 ms 23788 KB Ok
3 Correct 14 ms 23788 KB Ok
4 Correct 15 ms 23788 KB Ok
5 Correct 15 ms 23788 KB Ok
6 Correct 14 ms 23788 KB Ok
7 Correct 14 ms 23788 KB Ok
8 Correct 16 ms 23788 KB Ok
9 Correct 15 ms 23788 KB Ok
10 Correct 14 ms 23788 KB Ok
11 Correct 14 ms 23788 KB Ok
12 Correct 14 ms 23788 KB Ok
13 Correct 14 ms 23788 KB Ok
14 Correct 15 ms 23788 KB Ok
15 Correct 14 ms 23788 KB Ok
16 Incorrect 15 ms 23808 KB Jury has the better answer : jans = 9, pans = 2
17 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23788 KB Ok
2 Correct 14 ms 23788 KB Ok
3 Correct 14 ms 23788 KB Ok
4 Correct 15 ms 23788 KB Ok
5 Correct 15 ms 23788 KB Ok
6 Correct 14 ms 23788 KB Ok
7 Correct 14 ms 23788 KB Ok
8 Correct 16 ms 23788 KB Ok
9 Correct 15 ms 23788 KB Ok
10 Correct 14 ms 23788 KB Ok
11 Correct 14 ms 23788 KB Ok
12 Correct 14 ms 23788 KB Ok
13 Correct 15 ms 23808 KB Ok
14 Correct 14 ms 23788 KB Ok
15 Correct 14 ms 23788 KB Ok
16 Correct 14 ms 23788 KB Ok
17 Correct 15 ms 23788 KB Ok
18 Correct 15 ms 23916 KB Ok
19 Correct 17 ms 24428 KB Ok
20 Correct 16 ms 24172 KB Ok
21 Correct 19 ms 24556 KB Ok
22 Correct 16 ms 24172 KB Ok
23 Correct 14 ms 23788 KB Ok
24 Correct 15 ms 23788 KB Ok
25 Correct 14 ms 23788 KB Ok
26 Incorrect 15 ms 23808 KB Jury has the better answer : jans = 9, pans = 2
27 Halted 0 ms 0 KB -

Subtask #7
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23788 KB Ok
2 Correct 14 ms 23788 KB Ok
3 Correct 14 ms 23788 KB Ok
4 Correct 15 ms 23788 KB Ok
5 Correct 15 ms 23788 KB Ok
6 Correct 14 ms 23788 KB Ok
7 Correct 14 ms 23788 KB Ok
8 Correct 16 ms 23788 KB Ok
9 Correct 15 ms 23788 KB Ok
10 Correct 14 ms 23788 KB Ok
11 Correct 14 ms 23788 KB Ok
12 Correct 14 ms 23788 KB Ok
13 Correct 15 ms 23808 KB Ok
14 Correct 14 ms 23788 KB Ok
15 Correct 14 ms 23788 KB Ok
16 Correct 14 ms 23788 KB Ok
17 Correct 15 ms 23788 KB Ok
18 Correct 15 ms 23916 KB Ok
19 Correct 17 ms 24428 KB Ok
20 Correct 16 ms 24172 KB Ok
21 Correct 19 ms 24556 KB Ok
22 Correct 16 ms 24172 KB Ok
23 Correct 14 ms 23788 KB Ok
24 Correct 15 ms 23788 KB Ok
25 Correct 14 ms 23788 KB Ok
26 Incorrect 15 ms 23808 KB Jury has the better answer : jans = 9, pans = 2
27 Halted 0 ms 0 KB -