제출 #1195615

#제출 시각아이디문제언어결과실행 시간메모리
1195615GoBananas69September (APIO24_september)C++20
0 / 100
0 ms328 KiB
#include <algorithm>
#include <iostream>
#include <vector>

#include "september.h"
using namespace std;

vector<vector<int>> adj;

int solve(int n, int m, vector<int> F, vector<vector<int>> S) {
	adj.assign(n, {});
	for (int i = 1; i<n; ++i) {
		adj[F[i]].push_back(i);
	}
	int k = 0;
	for (int i = 0; i<n - 1; ++i) {
		if (adj[S[0][i]].empty()) {
			++k;
		}
	}
	return k;
}

// int main() {
// 	int res = solve(3, 1, {-1, 0, 0}, {{1, 2}});
// 	cout << res << '\n';
// }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...