Submission #93883

#TimeUsernameProblemLanguageResultExecution timeMemory
93883dalgerokNice sequence (IZhO18_sequence)C++14
100 / 100
408 ms35476 KiB
#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(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...