# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
215891 | SamAnd | Fire drill (LMIO18_sauga) | C++17 | 65 ms | 2936 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];
vector<pair<int, int> > v;
int main()
{
scanf("%d%d%d", &tt, &n, &ss);
for (int i = 1; i <= n; ++i)
{
int q;
scanf("%d", &q);
v.push_back(m_p(q, i));
while (q--)
{
int x;
scanf("%d", &x);
a[i].push_back(x);
}
}
sort(v.begin(), v.end());
for (int i = 0; i < n; ++i)
printf("%d\n", v[i].second);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |