# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
46506 | Bruteforceman | Nice sequence (IZhO18_sequence) | C++11 | 884 ms | 28080 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.
#include "bits/stdc++.h"
using namespace std;
int N, M;
vector <int> g[200010];
vector <int> solution;
int deg[200010];
int p[200010];
bool good(int size) {
for(int i = 0; i <= size; i++) {
g[i].clear();
deg[i] = 0;
}
for(int i = N; i <= size; i++) {
g[i].push_back(i - N);
++deg[i - N];
}
for(int i = 0; i <= size - M; i++) {
g[i].push_back(i + M);
++deg[i + M];
}
queue <int> Q;
for(int i = 0; i <= size; i++) {
if(deg[i] == 0) {
Q.push(i);
}
}
vector <int> v;
while(!Q.empty()) {
int x = Q.front();
Q.pop();
v.push_back(x);
for(auto i : g[x]) {
--deg[i];
if(deg[i] == 0) {
Q.push(i);
}
}
}
if(v.size() == size + 1) {
vector <int> pref (size + 1);
solution.resize(size + 1);
for(int i = 0; i < v.size(); i++) {
if(v[i] == 0) {
int cur = 0;
for(int j = i-1; j >= 0; j--) {
pref[v[j]] = --cur;
}
cur = 0;
for(int j = i+1; j < v.size(); j++) {
pref[v[j]] = ++cur;
}
break;
}
}
for(int i = 1; i <= size; i++) {
solution[i] = pref[i] - pref[i - 1];
}
return true;
}
return false;
}
int search(int b, int e) {
if(b == e) {
return b;
}
int m = (b + e + 1) >> 1;
if(good(m)) return search(m, e);
else return search(b, m - 1);
}
int main(int argc, char const *argv[])
{
int test;
scanf("%d", &test);
for(int cs = 1; cs <= test; cs++) {
scanf("%d %d", &N, &M);
int ans = search(0, N + M - 1);
good(ans);
printf("%d\n", ans);
for(int i = 1; i <= ans; i++) {
printf("%d ", solution[i]);
}
printf("\n");
}
return 0;
}
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... |