oj.uz

답안 #495951

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
495951 2021-12-20T08:32:02 Z ergagan Nice sequence (IZhO18_sequence) C++17
9 / 100
 7 ms 844 KB 
//я так много думал, что опять попал
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define f first
#define s second
#define left(v) v + v
#define right(v) v + v + 1
#define ub upper_bound
#define lb lower_bound

using namespace std;
typedef long long ll;

//17 SEVENTEEN
const long double Pi = acos(-1.0);
const ll dx[] = {0,0,1,-1};
const ll dy[] = {1,-1,0,0};
const ll N = (ll) 1e6 + 17;
const ll M = (ll) 5e3 + 69;
const ll inf = (ll) 1e14 + 3;
const ll mod = (ll) 1e9 + 7;
ll sq(ll x) { return x * x; }

ll zxc = 1, a[N];

void solve() {
    ll n, m;
    cin >> n >> m;

    if(n == 1) {
        cout << m - 1 << "\n";
        for(ll i = 1; i < m; i++) cout << -i << " ";
        cout << "\n";
    }

    else if(m == 1) {
        cout << n - 1 << "\n";
        for(ll i = 1; i < n; i++) cout << i << " ";
        cout << "\n";
    }

    else if(n < m) {
        if(n % 2) {
            if(!(m % 2)) m--;
            cout << m << "\n";
            for(ll i = 1; i <= m / 2 - 1; i++) {
                cout << -m << " " << m + 1 << " ";
            }
            cout << (m + 1) << "\n";
        }
        else {
            if(!(m % 2)) m--;
            cout << m << "\n";
            for(ll i = 1; i <= m / 2; i++) {
                cout << m << " " << -(m + 1) << " ";
            }
            cout << m << "\n";
        }
    }
    else {
        if(m % 2) {
            if(!(n % 2)) n--;
            cout << n << "\n";
            for(ll i = 1; i <= n / 2 - 1; i++) {
                cout << n << " " << -(n + 1) << " ";
            }
            cout << -(n + 1) << "\n";
        }
        else {
            if(!(n % 2)) n--;
            cout << n << "\n";
            for(ll i = 1; i <= n / 2; i++) {
                cout << -n << " " << n + 1 << " ";
            }
            cout << -n << "\n";
        }
    }
}

int main(/*Уверенно*/) {
ios_base::sync_with_stdio(0);
    cin.tie(0);
/*
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
*/
    cin >> zxc;
    while(zxc--) {
        solve();
    }
  	return 0;
}
// さよならさ いかなくちゃ

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Ok
2 Incorrect 0 ms 204 KB there is incorrect sequence
3 Halted 0 ms 0 KB -

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Ok
2 Correct 0 ms 204 KB Ok
3 Correct 1 ms 204 KB Ok
4 Correct 1 ms 216 KB Ok
5 Correct 0 ms 204 KB Ok
6 Correct 1 ms 332 KB Ok
7 Correct 6 ms 716 KB Ok
8 Correct 3 ms 460 KB Ok
9 Correct 7 ms 844 KB Ok
10 Correct 5 ms 588 KB Ok

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Ok
2 Correct 0 ms 204 KB Ok
3 Correct 0 ms 204 KB Ok
4 Incorrect 0 ms 204 KB Jury has the better answer : jans = 9, pans = 7
5 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Jury has the better answer : jans = 5, pans = 3
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Ok
2 Incorrect 0 ms 204 KB there is incorrect sequence
3 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Ok
2 Incorrect 0 ms 204 KB there is incorrect sequence
3 Halted 0 ms 0 KB -

Subtask #7
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Ok
2 Incorrect 0 ms 204 KB there is incorrect sequence
3 Halted 0 ms 0 KB -