제출 #91938

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
91938		popovicirobert	Nice sequence (IZhO18_sequence)	C++14	6 / 100	2 ms	380 KiB

sequence

#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#define ld long double
// 217
// 44

using namespace std;

const int INF = 999999999;
const int MAXN = (int) 2e5;

void dfs(int nod, vector < vector <int> > &g, vector <int> &vis, bool &ok) {
    vis[nod] = 1;
    for(auto it : g[nod]) {
        if(vis[it] == 0) {
            dfs(it, g, vis, ok);
        }
        else if(vis[it] == 1) {
            ok = 0;
        }
    }
    vis[nod] = 2;
}

inline bool check(int len, int n, int m) {
    int i;
    vector < vector <int> > g(len + 1);
    for(i = 1; i <= len; i++) {
        if(i >= n) {
            g[i - n].push_back(i);
        }
        if(i >= m) {
            g[i].push_back(i - m);
        }
    }
    vector <int> vis(len + 1);
    bool ok = 1;
    for(i = 1; i <= len; i++) {
        if(vis[i] == 0) {
            dfs(i, g, vis, ok);
        }
    }
    return ok;
}

inline int solve(int n, int m) {
    int res = 0;
    for(int step = 1 << 15; step; step >>= 1) {
        if(check(res + step, n, m)) {
            res += step;
        }
    }
    return res;
}

int arr[MAXN + 1];
ll sp[MAXN + 1];

int main() {
    //ifstream cin("A.in");
    //ofstream cout("A.out");
    int t, i;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> t;
    while(t > 0) {
        t--;
        int n, m;
        cin >> n >> m;
        int mn = min(n, m), mx = max(n, m);
        if(mx % mn == 0) {
            cout << mx - 1 << "\n";
            int sign = 1;
            if(mn == n) {
                sign = -1;
            }
            for(i = 1; i < mx; i++) {
                cout << sign << " ";
            }
            if(mx > 1) {
                cout << "\n";
            }
            continue;
        }
        int val = INF / (mn - 1);
        int pos = 0;
        while(1) {
            for(i = 1; i < mn; i++) {
                arr[++pos] = val;
                sp[pos] = sp[pos - 1] + val;
            }
            arr[++pos] = -val * (mn - 1) - 1;
            sp[pos] = arr[pos] + sp[pos - 1];
            if(pos >= mx && sp[pos] - sp[pos - mx] <= 0) {
                pos--;
                break;
            }
        }
        int sign = 1;
        if(n != mn) {
            sign = -1;
        }
        for(i = 1; i <= pos; i++) {
            cout << sign * arr[i] << " ";
        }
        cout << "\n";
    }
    //cin.close();
    //cout.close();
    return 0;
}

• Subtask 1: 6 / 6
• Subtask 2: 0 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 0 / 14
• Subtask 6: 0 / 18
• Subtask 7: 0 / 24