# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
493320 | hollwo_pelw | Nice sequence (IZhO18_sequence) | C++17 | 1271 ms | 53760 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
// is short or still long ???
hollwo_pelw's template(short)
// Note : -Dhollwo_pelw_local
*/
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/trie_policy.hpp>
// #include <ext/rope>
using namespace std;
// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
void FAST_IO(string filein = "", string fileout = "", string fileerr = ""){
if (fopen(filein.c_str(), "r")){
freopen(filein.c_str(), "r", stdin);
freopen(fileout.c_str(), "w", stdout);
#ifdef hollwo_pelw_local
freopen(fileerr.c_str(), "w", stderr);
#endif
}
cin.tie(0), cout.tie(0) -> sync_with_stdio(0);
}
void Hollwo_Pelw();
signed main(){
#ifdef hollwo_pelw_local
FAST_IO("input.inp", "output.out", "error.err");
auto start = chrono::steady_clock::now();
#else
FAST_IO("hollwo_pelw.inp", "hollwo_pelw.out");
#endif
int testcases = 1;
cin >> testcases;
for (int test = 1; test <= testcases; test++){
// cout << "Case #" << test << ": ";
Hollwo_Pelw();
}
#ifdef hollwo_pelw_local
auto end = chrono::steady_clock::now();
cout << "\nExcution time : " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
#endif
return 0;
}
const int N = 4e5 + 5;
int n, m, sz, pre[N], deg[N];
vector<int> adj[N], tp;
// pre[i] - pre[i - m] > 0
// pre[i - n] - pre[i] > 0
void Hollwo_Pelw() {
cin >> n >> m;
sz = n + m - __gcd(n, m);
fill(deg, deg + sz, 0);
for (int i = 0; i < sz; i++)
adj[i].clear();
for (int i = 0; i < sz; i++) {
if (i >= m) adj[i].push_back(i - m);
if (i >= n) adj[i - n].push_back(i);
}
for (int i = 0; i < sz; i++)
for (auto j : adj[i]) deg[j] ++;
queue<int> q;
for (int i = 0; i < sz; i++)
if (!deg[i]) q.push(i);
int cur = N;
while (!q.empty()) {
int u = q.front(); q.pop();
cur = (u ? cur - 1 : 0);
pre[u] = cur;
for (auto v : adj[u])
if (!(--deg[v])) q.push(v);
}
cout << sz - 1 << '\n';
for (int i = 1; i < sz; i++)
cout << pre[i] - pre[i - 1] << ' ';
cout << '\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |