oj.uz

Submission #997476

# Submission time Handle Problem Language Result Execution time Memory
997476 2024-06-12T11:16:32 Z ALTAKEXE September (APIO24_september) C++17
0 / 100
 2 ms 3164 KB 
#include <bits/stdc++.h>
#include <vector>
using namespace std;
vector<vector<int>> adj(100005);
vector<bool> vis(100005, 0);
vector<int> p(100005, 0);
int c = -1;
void dfs(int u)
{
	if (vis[u])
		return;
	vis[u] = true;
	c = max(c, p[u]);
	for (auto i : adj[u])
		dfs(i);
}
int solve(int n, int m, vector<int> f, vector<vector<int>> s)
{
	for (int i = 1; i < n; i++)
		adj[f[i]].push_back(i);
	for (int j = 0; j < m; j++)
	{
		for (int i = 0; i < n - 1; i++)
			p[s[j][i]] = max(p[s[j][i]], i);
	}
	int ans = 0;
	for (int i = 0; i < n - 1; i++)
	{
		for (int j = 0; j < m; j++)
		{
			if (i > c && j == 0)
				ans++;
			dfs(s[j][i]);
		}
	}
	c = -1;
	return ans;
}

Subtask #1
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Incorrect 1 ms 3164 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Incorrect 1 ms 3164 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 3160 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Incorrect 1 ms 3164 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 3160 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Incorrect 1 ms 3164 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 3160 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Incorrect 1 ms 3164 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #9
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 3160 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Incorrect 1 ms 3164 KB Output isn't correct
3 Halted 0 ms 0 KB -