# | TimeUTC-0 | 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();
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... |