oj.uz

답안 #495791

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
495791 2021-12-20T05:17:37 Z armashka Nice sequence (IZhO18_sequence) C++17
6 / 100
 5 ms 204 KB 
#include <bits/stdc++.h>
 
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
 
const int N = 3e5 + 5;
const ll M = 1e8;
const ll inf = 1e3;
const ll mod = 1e9;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }            
 
ll n, m;
vector <ll> res;
bool ok = 0;
 
void rec(ll pos) {
    if (ok) return;
    if (pos == max(n, m)) {
        for (int i = 0; i < res.sz; ++ i) {
            ll sum = 0;
            for (int j = i; j < min(ll(res.sz), i + n); ++ j) sum += res[j];
            if (i + n < res.sz) {
                if (sum >= 0) return;
            }
            sum = 0;
            for (int j = i; j < min(ll(res.sz), i + m); ++ j) sum += res[j];
            if (i + m < res.sz) {
                if (sum <= 0) return;
            }
        }
        cout << max(n, m) << "\n";
        for (auto x : res) cout << x << " ";
        cout << "\n";
        ok = 1;
        return;
    }
    for (int i = 1; i <= 5; ++ i) {
        res.pb(i);
        rec(pos + 1);
        res.pop_back();
    }
 
    for (int i = -1; i >= -5; -- i) {
        res.pb(i);
        rec(pos + 1);
        res.pop_back(); 
    }
}
 
const void solve(/*Armashka*/) {
    cin >> n >> m;
    ok = 0;
    res.clear();
    if (max(n, m) % min(n, m) == 0 || n % 2 == m % 2) {
        ll len = max(n, m) - 1;
        cout << len << "\n";
        for (int i = 1; i <= len; ++ i) {
            if (min(n, m) == n) cout << -i << " ";
            else cout << i << " ";
        }
        cout << "\n";
    } else {
        if (max(n, m) <= 10) {
            rec(0);
            return;
        }
        cout << max(n, m) << "\n";
        if (n % 2) {
            ll a = (n + 2) / 2, b = (n + 2 - a);
            for (int i = 1; i < max(n, m); i += 2) {
                cout << -a << " " << b << " ";
            }
            cout << -a << "\n";
        } else {
            ll a = (m + 2) / 2, b = (m + 2 - a);
            for (int i = 1; i < max(n, m); i += 2) {
                cout << a << " " << -b << " ";
            }
            cout << a << "\n";
        }
    }
}
 
signed main() {
    fast;
    //freopen("divide.in", "r", stdin);
    //freopen("divide.out", "w", stdout);
    int tt = 1;
    cin >> tt;
    while (tt --) {
        solve();
    }
}
 
/*
5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
*/

Compilation message

sequence.cpp: In function 'void rec(ll)':
sequence.cpp:38:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         for (int i = 0; i < res.sz; ++ i) {
      |                           ^
sequence.cpp:41:23: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |             if (i + n < res.sz) {
      |                       ^
sequence.cpp:46:23: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |             if (i + m < res.sz) {
      |                       ^

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Ok
2 Correct 0 ms 204 KB Ok
3 Correct 0 ms 204 KB Ok
4 Correct 1 ms 204 KB Ok
5 Correct 1 ms 204 KB Ok
6 Correct 1 ms 204 KB Ok
7 Correct 0 ms 204 KB Ok
8 Correct 1 ms 204 KB Ok
9 Correct 0 ms 204 KB Ok
10 Correct 0 ms 204 KB Ok
11 Correct 0 ms 204 KB Ok
12 Correct 0 ms 204 KB Ok

Subtask #2
0 / 9.0

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

Subtask #3
0 / 14.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Ok
2 Correct 0 ms 204 KB Ok
3 Correct 0 ms 204 KB Ok
4 Correct 1 ms 204 KB Ok
5 Correct 1 ms 204 KB Ok
6 Correct 1 ms 204 KB Ok
7 Correct 0 ms 204 KB Ok
8 Correct 1 ms 204 KB Ok
9 Correct 0 ms 204 KB Ok
10 Correct 0 ms 204 KB Ok
11 Correct 0 ms 204 KB Ok
12 Correct 0 ms 204 KB Ok
13 Incorrect 0 ms 204 KB there is incorrect sequence
14 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Ok
2 Correct 0 ms 204 KB Ok
3 Correct 0 ms 204 KB Ok
4 Correct 1 ms 204 KB Ok
5 Correct 1 ms 204 KB Ok
6 Correct 1 ms 204 KB Ok
7 Correct 0 ms 204 KB Ok
8 Correct 1 ms 204 KB Ok
9 Correct 0 ms 204 KB Ok
10 Correct 0 ms 204 KB Ok
11 Correct 0 ms 204 KB Ok
12 Correct 0 ms 204 KB Ok
13 Incorrect 5 ms 204 KB there is incorrect sequence
14 Halted 0 ms 0 KB -

Subtask #7
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Ok
2 Correct 0 ms 204 KB Ok
3 Correct 0 ms 204 KB Ok
4 Correct 1 ms 204 KB Ok
5 Correct 1 ms 204 KB Ok
6 Correct 1 ms 204 KB Ok
7 Correct 0 ms 204 KB Ok
8 Correct 1 ms 204 KB Ok
9 Correct 0 ms 204 KB Ok
10 Correct 0 ms 204 KB Ok
11 Correct 0 ms 204 KB Ok
12 Correct 0 ms 204 KB Ok
13 Incorrect 5 ms 204 KB there is incorrect sequence
14 Halted 0 ms 0 KB -