You are given an integer n, which indicates that there are n courses labeled from 1 to n. You are also given an array relations where relations[i] = [prevCoursei, nextCoursei], representing a prerequisite relationship between course prevCoursei and course nextCoursei: course prevCoursei has to be taken before course nextCoursei. Also, you are given the integer k.
In one semester, you can take at most k courses as long as you have taken all the prerequisites in the previous semesters for the courses you are taking.
Return the minimum number of semesters needed to take all courses. The testcases will be generated such that it is possible to take every course.
Example 1:
Input: n = 4, relations = [[2,1],[3,1],[1,4]], k = 2 Output: 3 Explanation: The figure above represents the given graph. In the first semester, you can take courses 2 and 3. In the second semester, you can take course 1. In the third semester, you can take course 4.
Example 2:
Input: n = 5, relations = [[2,1],[3,1],[4,1],[1,5]], k = 2 Output: 4 Explanation: The figure above represents the given graph. In the first semester, you can only take courses 2 and 3 since you cannot take more than two per semester. In the second semester, you can take course 4. In the third semester, you can take course 1. In the fourth semester, you can take course 5.
Constraints:
1 <= n <= 151 <= k <= n0 <= relations.length <= n * (n-1) / 2relations[i].length == 21 <= prevCoursei, nextCoursei <= nprevCoursei != nextCoursei- All the pairs
[prevCoursei, nextCoursei]are unique. - The given graph is a directed acyclic graph.
class Solution:
def minNumberOfSemesters(self, n: int, relations: List[List[int]], k: int) -> int:
d = [0] * (n + 1)
for x, y in relations:
d[y] |= 1 << x
q = deque([(0, 0)])
vis = {0}
while q:
cur, t = q.popleft()
if cur == (1 << (n + 1)) - 2:
return t
nxt = 0
for i in range(1, n + 1):
if (cur & d[i]) == d[i]:
nxt |= 1 << i
nxt ^= cur
if nxt.bit_count() <= k:
if (nxt | cur) not in vis:
vis.add(nxt | cur)
q.append((nxt | cur, t + 1))
else:
x = nxt
while nxt:
if nxt.bit_count() == k and (nxt | cur) not in vis:
vis.add(nxt | cur)
q.append((nxt | cur, t + 1))
nxt = (nxt - 1) & xclass Solution {
public int minNumberOfSemesters(int n, int[][] relations, int k) {
int[] d = new int[n + 1];
for (var e : relations) {
d[e[1]] |= 1 << e[0];
}
Deque<int[]> q = new ArrayDeque<>();
q.offer(new int[] {0, 0});
Set<Integer> vis = new HashSet<>();
vis.add(0);
while (!q.isEmpty()) {
var p = q.pollFirst();
int cur = p[0], t = p[1];
if (cur == (1 << (n + 1)) - 2) {
return t;
}
int nxt = 0;
for (int i = 1; i <= n; ++i) {
if ((cur & d[i]) == d[i]) {
nxt |= 1 << i;
}
}
nxt ^= cur;
if (Integer.bitCount(nxt) <= k) {
if (vis.add(nxt | cur)) {
q.offer(new int[] {nxt | cur, t + 1});
}
} else {
int x = nxt;
while (nxt > 0) {
if (Integer.bitCount(nxt) == k && vis.add(nxt | cur)) {
q.offer(new int[] {nxt | cur, t + 1});
}
nxt = (nxt - 1) & x;
}
}
}
return 0;
}
}using pii = pair<int, int>;
class Solution {
public:
int minNumberOfSemesters(int n, vector<vector<int>>& relations, int k) {
vector<int> d(n + 1);
for (auto& e : relations) {
d[e[1]] |= 1 << e[0];
}
queue<pii> q;
q.push({0, 0});
unordered_set<int> vis{{0}};
while (!q.empty()) {
auto [cur, t] = q.front();
q.pop();
if (cur == (1 << (n + 1)) - 2) {
return t;
}
int nxt = 0;
for (int i = 1; i <= n; ++i) {
if ((cur & d[i]) == d[i]) {
nxt |= 1 << i;
}
}
nxt ^= cur;
if (__builtin_popcount(nxt) <= k) {
if (!vis.count(nxt | cur)) {
vis.insert(nxt | cur);
q.push({nxt | cur, t + 1});
}
} else {
int x = nxt;
while (nxt) {
if (__builtin_popcount(nxt) == k && !vis.count(nxt | cur)) {
vis.insert(nxt | cur);
q.push({nxt | cur, t + 1});
}
nxt = (nxt - 1) & x;
}
}
}
return 0;
}
};func minNumberOfSemesters(n int, relations [][]int, k int) int {
d := make([]int, n+1)
for _, e := range relations {
d[e[1]] |= 1 << e[0]
}
type pair struct{ v, t int }
q := []pair{pair{0, 0}}
vis := map[int]bool{0: true}
for len(q) > 0 {
p := q[0]
q = q[1:]
cur, t := p.v, p.t
if cur == (1<<(n+1))-2 {
return t
}
nxt := 0
for i := 1; i <= n; i++ {
if (cur & d[i]) == d[i] {
nxt |= 1 << i
}
}
nxt ^= cur
if bits.OnesCount(uint(nxt)) <= k {
if !vis[nxt|cur] {
vis[nxt|cur] = true
q = append(q, pair{nxt | cur, t + 1})
}
} else {
x := nxt
for nxt > 0 {
if bits.OnesCount(uint(nxt)) == k && !vis[nxt|cur] {
vis[nxt|cur] = true
q = append(q, pair{nxt | cur, t + 1})
}
nxt = (nxt - 1) & x
}
}
}
return 0
}