# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
530208 | 2022-02-24T19:32:02 Z | luciocf | Colors (RMI18_colors) | C++14 | 3000 ms | 26196 KB |
#include <bits/stdc++.h> #define ff first #define ss second using namespace std; typedef pair<int, int> pii; const int maxn = 5e5+10; int a[maxn], b[maxn]; pii p[maxn]; vector<int> quem[maxn]; bool mark[maxn]; vector<int> grafo[maxn]; void dfs(int u, int c) { mark[u] = 1; for (auto v: grafo[u]) if (!mark[v] && b[v] <= c) dfs(v, c); } bool reach(int u, int v, int c) { memset(mark, 0, sizeof mark); dfs(u, c); return mark[v]; } int main(void) { int tc; scanf("%d", &tc); while (tc--) { int n, m; scanf("%d %d", &n, &m); for (int i = 1; i <= n; i++) { grafo[i].clear(); quem[i].clear(); } for (int i = 1; i <= n; i++) { scanf("%d", &a[i]); quem[a[i]].push_back(i); } for (int i = 1; i <= n; i++) { scanf("%d", &b[i]); p[i] = {b[i], i}; } for (int i = 1; i <= m; i++) { int u, v; scanf("%d %d", &u, &v); grafo[u].push_back(v); grafo[v].push_back(u); } sort(p+1, p+n+1); bool ok = 1; for (int i = n; i >= 1; i--) { int c = p[i].ff, u = p[i].ss; bool flag = 0; for (auto v: quem[c]) if (reach(v, u, c)) flag = 1; ok &= flag; } if (ok) printf("1\n"); else printf("0\n"); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2138 ms | 25688 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 382 ms | 25940 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2366 ms | 25776 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2366 ms | 25776 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2138 ms | 25688 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3052 ms | 26196 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 268 ms | 25044 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2138 ms | 25688 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |