# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
997401 | 2024-06-12T08:50:12 Z | Trisanu_Das | September (APIO24_september) | C++17 | 230 ms | 44328 KB |
#include "september.h" #include <bits/stdc++.h> using namespace std; int vis[200055], pos[20055]; vector<int>adj[200055], idx[200055]; bool flag = false; int dfs(int i ){ int curr = pos[i]; vis[i]=1; for(auto j : adj[i]) if(!vis[j]) curr = max(curr, dfs(j)); return curr; } int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) { memset(vis, 0, sizeof vis); memset(idx, 0, sizeof idx); memset(pos, 0, sizeof pos); for(int i = 0;i < 2055; i++)if(adj[i].size())adj[i].clear(); for(int i = 1;i < F.size(); i++)adj[F[i]].push_back(i); for(auto i : S[0]) pos[S[0][i]] = i; vector<int>vec; for(auto i : S[0])vec.push_back(i); int cnt = 0; for(int i = 0;i < vec.size(); i++){ int y = 0; if(vec[i]==1)flag = true; int R_ind = dfs(vec[i]); for(int j = i+1; j<=R_ind; j++) R_ind = max(R_ind, dfs(vec[j])); i = max(i, R_ind); cnt++; } return cnt; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 10588 KB | Output is correct |
2 | Correct | 3 ms | 10588 KB | Output is correct |
3 | Correct | 3 ms | 10588 KB | Output is correct |
4 | Correct | 3 ms | 10584 KB | Output is correct |
5 | Correct | 3 ms | 10632 KB | Output is correct |
6 | Correct | 3 ms | 10588 KB | Output is correct |
7 | Correct | 3 ms | 10588 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 10588 KB | Output is correct |
2 | Correct | 3 ms | 10588 KB | Output is correct |
3 | Correct | 3 ms | 10588 KB | Output is correct |
4 | Correct | 3 ms | 10584 KB | Output is correct |
5 | Correct | 3 ms | 10632 KB | Output is correct |
6 | Correct | 3 ms | 10588 KB | Output is correct |
7 | Correct | 3 ms | 10588 KB | Output is correct |
8 | Incorrect | 3 ms | 10588 KB | Output isn't correct |
9 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 10588 KB | Output is correct |
2 | Correct | 9 ms | 10588 KB | Output is correct |
3 | Correct | 8 ms | 10716 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 10588 KB | Output is correct |
2 | Correct | 3 ms | 10588 KB | Output is correct |
3 | Correct | 3 ms | 10588 KB | Output is correct |
4 | Correct | 3 ms | 10584 KB | Output is correct |
5 | Correct | 3 ms | 10632 KB | Output is correct |
6 | Correct | 3 ms | 10588 KB | Output is correct |
7 | Correct | 3 ms | 10588 KB | Output is correct |
8 | Correct | 9 ms | 10588 KB | Output is correct |
9 | Correct | 9 ms | 10588 KB | Output is correct |
10 | Correct | 8 ms | 10716 KB | Output is correct |
11 | Correct | 8 ms | 10588 KB | Output is correct |
12 | Incorrect | 8 ms | 10760 KB | Output isn't correct |
13 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 10588 KB | Output is correct |
2 | Correct | 9 ms | 10588 KB | Output is correct |
3 | Correct | 8 ms | 10716 KB | Output is correct |
4 | Incorrect | 9 ms | 10588 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 10588 KB | Output is correct |
2 | Correct | 3 ms | 10588 KB | Output is correct |
3 | Correct | 3 ms | 10588 KB | Output is correct |
4 | Correct | 3 ms | 10584 KB | Output is correct |
5 | Correct | 3 ms | 10632 KB | Output is correct |
6 | Correct | 3 ms | 10588 KB | Output is correct |
7 | Correct | 3 ms | 10588 KB | Output is correct |
8 | Incorrect | 3 ms | 10588 KB | Output isn't correct |
9 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 10588 KB | Output is correct |
2 | Correct | 9 ms | 10588 KB | Output is correct |
3 | Correct | 8 ms | 10716 KB | Output is correct |
4 | Runtime error | 230 ms | 44328 KB | Execution killed with signal 11 |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 10588 KB | Output is correct |
2 | Correct | 3 ms | 10588 KB | Output is correct |
3 | Correct | 3 ms | 10588 KB | Output is correct |
4 | Correct | 3 ms | 10584 KB | Output is correct |
5 | Correct | 3 ms | 10632 KB | Output is correct |
6 | Correct | 3 ms | 10588 KB | Output is correct |
7 | Correct | 3 ms | 10588 KB | Output is correct |
8 | Correct | 9 ms | 10588 KB | Output is correct |
9 | Correct | 9 ms | 10588 KB | Output is correct |
10 | Correct | 8 ms | 10716 KB | Output is correct |
11 | Correct | 8 ms | 10588 KB | Output is correct |
12 | Incorrect | 8 ms | 10760 KB | Output isn't correct |
13 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 10588 KB | Output is correct |
2 | Correct | 9 ms | 10588 KB | Output is correct |
3 | Correct | 8 ms | 10716 KB | Output is correct |
4 | Incorrect | 9 ms | 10588 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 10588 KB | Output is correct |
2 | Correct | 3 ms | 10588 KB | Output is correct |
3 | Correct | 3 ms | 10588 KB | Output is correct |
4 | Correct | 3 ms | 10584 KB | Output is correct |
5 | Correct | 3 ms | 10632 KB | Output is correct |
6 | Correct | 3 ms | 10588 KB | Output is correct |
7 | Correct | 3 ms | 10588 KB | Output is correct |
8 | Incorrect | 3 ms | 10588 KB | Output isn't correct |
9 | Halted | 0 ms | 0 KB | - |