# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
301224 | joseacaz | Comparing Plants (IOI20_plants) | C++17 | 4094 ms | 16484 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 "plants.h"
#include <bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
const int MAXN = 2e5 + 5;
int N, k, vis[MAXN];
vi r, Graph[MAXN];
void sub(int idx)
{
for(int i = 1; i < k; i++)
{
int id = ((idx - i)%N + N)%N;
if(r[id] > 0)
{
r[id]--;
if(r[id] == 0)
Graph[idx].pb(id);
}
}
}
int getnext(int idx)
{
for(int i = 1; i < N; i++)
{
int id = ((idx + i)%N + N)%N;
if(i < k && !vis[id])
Graph[idx].pb(id);
if(r[id] == 0 && !vis[id])
return id;
}
return idx;
}
void init(int _k, vi _r)
{
k = _k;
swap(r, _r);
N = r.size();
int maxIdx = 0;
for(int i = 0; i < N; i++)
{
if(r[i] != 0)
continue;
int maxim = 1;
for(int j = 1; j < k; j++)
{
int id = ((i - j)%N + N)%N;
if(r[id] == 0)
maxim = 0;
}
if(maxim)
maxIdx = i;
}
while(!vis[maxIdx])
{
vis[maxIdx] = 1;
sub(maxIdx);
maxIdx = getnext(maxIdx);
}
return;
}
int dfs(int a, int b)
{
if(a == b)
return 1;
for(auto i : Graph[a])
if(dfs(i, b))
return 1;
return 0;
}
int compare_plants(int x, int y)
{
int aux = dfs(x, y), aux2 = dfs(y, x);
if(!aux && !aux2)
return 0;
else if(aux)
return 1;
else
return -1;
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... |