# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
215886 | SamAnd | Fire drill (LMIO18_sauga) | C++17 | 99 ms | 3320 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(3141);
int tt, n, ss;
vector<int> a[N];
int u[N];
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;
for (int i = n; i >= 1; --i)
swap(u[i], u[(rnd() % i) + 1]);
for (int i = 1; i <= n; ++i)
printf("%d\n", u[i]);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |