oj.uz

Submission #500822

# Submission time Handle Problem Language Result Execution time Memory
500822 2022-01-01T10:28:46 Z pragmatist Birthday gift (IZhO18_treearray) C++17
0 / 100
 0 ms 204 KB 
#include <bits/stdc++.h>                            
 
#define pb push_back
#define sz(v) (int)v.size()
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define x first
#define y second
#define int long long
#define nl "\n"
 
using namespace std;

typedef long long ll;
typedef pair<long long, long long> pll;
typedef pair <ll, ll> pii;

const int N = (int)5e4 + 7;
const int M = (int)7e6 + 7;
const ll MOD = (ll)1e9 + 7;                    
const int inf = (int)1e9 + 7;
const ll INF = (ll)3e18 + 7;

pii dir[] = {{-1, -1}, {1, 1}, {-1, 1}, {1, -1}};

int n, m;

void solve() { 
	cin >> n >> m;
		cout << max(n, m) - 1 << nl;
		if(n > m) {        
			for(int i = 1; i < n; ++i) cout << "1 ";
		} else {
			for(int i = 1; i < m; ++i) cout << "-1 ";
		}		
		cout << nl;
}

signed main() {                   
	ios_base::sync_with_stdio(NULL);
    cin.tie(0);
    cout.tie(0);
   	int test = 1;
	cin >> test;
	for(int i = 1; i <= test; ++i) {
        //cout << "Case " << i << ": ";
        solve();
    }
    return 0;
}
/*
3
3 1
2 3
1 1
*/

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Wrong output format.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Wrong output format.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Wrong output format.
2 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Wrong output format.
2 Halted 0 ms 0 KB -