728x90
SMALL
2021.10.27 - [PS/백준] - 백준 1005 (C++) ACM Craft
ACM Craft와 유사.
https://www.acmicpc.net/problem/1516
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <cstring>
using namespace std;
using ll = long long;
const int MAX = 511;
int t, n, k, w;
int inDegree[MAX];
vector<int> v[MAX];
int d[MAX];
void topologySort() {
int result[MAX];
queue<int> q;
for (int i = 1; i <= n; i++) {
if (inDegree[i] == 0) q.push(i);
result[i] = d[i];
}
for (int i = 1; i <= n; i++) {
int cur = q.front();
q.pop();
// cout << cur << " ";
for (auto nxt : v[cur]) {
inDegree[nxt]--;
result[nxt] = max(result[nxt], result[cur] + d[nxt]);
if (inDegree[nxt] == 0) {
q.push(nxt);
}
}
}
for (int i = 1; i <= n; i++) cout << result[i] << '\n';
}
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> d[i];
while (1) {
int a;
cin >> a;
if (a == -1) {
break;
}
v[a].push_back(i);
inDegree[i]++;
}
}
topologySort();
return 0;
}
728x90
LIST
'PS > BOJ' 카테고리의 다른 글
백준 17352 (C++) 여러분의 다리가 되어 드리겠습니다! (0) | 2021.11.10 |
---|---|
백준 10409 (C++) 서버 (2) | 2021.11.07 |
백준 1005 (C++) ACM Craft (0) | 2021.10.27 |
백준 17608 (C++) 막대기 (0) | 2021.10.23 |
백준 2935 (C++) 소음 (출력 초과, 틀렸습니다) (0) | 2021.10.20 |