제출 #93883

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
93883		dalgerok	Nice sequence (IZhO18_sequence)	C++14	100 / 100	408 ms	35476 KiB

sequence

#include<bits/stdc++.h>
using namespace std;


const int N = 4e5 + 5;




int n, m, pref[N], timer, ans;


void dfs(int v){
    if(v - m >= 0 && pref[v - m] == 0){
        dfs(v - m);
    }
    if(v + n <= ans && pref[v + n] == 0){
        dfs(v + n);
    }
    pref[v] = ++timer;
}

void solve(){
    cin >> n >> m;
    ans = n + m - 1 - __gcd(n, m);
    memset(pref, 0, sizeof(pref));
    timer = 0;
    for(int i = 0; i <= ans; i++){
        if(!pref[i]){
            dfs(i);
        }
    }
    cout << ans << "\n";
    for(int i = 1; i <= ans; i++){
        cout << pref[i] - pref[i - 1] << " ";
    }
    if(ans > 0){
        cout << "\n";
    }
}

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int test;
    cin >> test;
    for(int i = 1; i <= test; i++){
        solve();
    }
}

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