# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
40453 | Pajaraja | Nice sequence (IZhO18_sequence) | C++14 | 614 ms | 17264 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;
vector<int> g[200007];
int pv[200007],deg[200007],parc[200007];
bool provera(int s,int n,int m)
{
fill(deg,deg+s+1,0);
for(int i=0;i<=s;i++) g[i].clear();
for(int i=n;i<=s;i++)
{
g[i].push_back(i-n);
deg[i-n]++;
}
for(int i=m;i<=s;i++)
{
g[i-m].push_back(i);
deg[i]++;
}
queue<int> q;
for(int i=0;i<=s;i++) if(deg[i]==0) q.push(i);
int cnt=0;
while(!q.empty())
{
int u=q.front();
pv[u]=cnt++;
q.pop();
for(int i=0;i<g[u].size();i++)
{
deg[g[u][i]]--;
if(deg[g[u][i]]==0) q.push(g[u][i]);
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... |