# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
215947 | SamAnd | Fire drill (LMIO18_sauga) | C++17 | 808 ms | 3064 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;
#define m_p make_pair
const int N = 1003;
mt19937 rnd(132143134);
int tt, n, ss;
vector<int> a[N];
int u[N];
vector<int> v;
bool c[N];
void dfs(int x)
{
c[x] = true;
for (int i = 0; i < a[x].size(); ++i)
{
int h = a[x][i];
if (!c[h])
dfs(h);
}
v.push_back(x);
}
int ansq;
vector<int> ans;
int main()
{
scanf("%d%d%d", &tt, &n, &ss);
for (int i = 1; i <= n; ++i)
{
int q;
scanf("%d", &q);
while (q--)
{
int x;
scanf("%d", &x);
a[i].push_back(x);
}
}
for (int i = 1; i <= n; ++i)
u[i] = i;
while ((double)clock() / CLOCKS_PER_SEC < 0.8)
{
for (int i = n; i >= 1; --i)
{
swap(u[i], u[rnd() % i + 1]);
}
for (int i = 1; i <= n; ++i)
{
for (int j = (int)a[i].size() - 1; j >= 0; --j)
{
swap(a[i][j], a[i][rnd() % (j + 1)]);
}
}
memset(c, false, sizeof c);
v.clear();
for (int i = 1; i <= n; ++i)
{
int x = u[i];
if (!c[x])
dfs(x);
}
memset(c, false, sizeof c);
int q = 0;
for (int i = 0; i < n; ++i)
{
int x = v[i];
for (int j = 0; j < a[x].size(); ++j)
{
int h = a[x][j];
if (!c[h])
{
++q;
break;
}
}
c[x] = true;
}
if (ans.empty() || q < ansq)
{
ans = v;
ansq = q;
}
}
for (int i = 0; i < n; ++i)
printf("%d\n", ans[i]);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |