# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
215891 | 2020-03-26T12:09:13 Z | SamAnd | Fire drill (LMIO18_sauga) | C++17 | 65 ms | 2936 KB |
#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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 63 ms | 2936 KB | Output is correct |
2 | Partially correct | 5 ms | 384 KB | Output is partially correct |
3 | Partially correct | 5 ms | 384 KB | Output is partially correct |
4 | Partially correct | 6 ms | 384 KB | Output is partially correct |
5 | Partially correct | 5 ms | 384 KB | Output is partially correct |
6 | Partially correct | 6 ms | 384 KB | Output is partially correct |
7 | Partially correct | 16 ms | 768 KB | Output is partially correct |
8 | Partially correct | 65 ms | 2808 KB | Output is partially correct |
9 | Partially correct | 12 ms | 640 KB | Output is partially correct |
10 | Partially correct | 5 ms | 384 KB | Output is partially correct |