# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1010215 | Unforgettablepl | Worst Reporter 4 (JOI21_worst_reporter4) | C++17 | 464 ms | 144972 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<vector<int>> adj(n+1);
vector<map<int,int>> DP(n+1);
vector<int> H(n+1);
vector<int> C(n+1);
vector<int> p(n+1);
vector<int> ind(n+1);
for(int i=1;i<=n;i++){
int a;
cin>>a>>H[i]>>C[i];
adj[a].emplace_back(i);
ind[a]++;p[i]=a;
}
queue<int> q;
vector<bool> visited(n+1);
for(int i=1;i<=n;i++)if(ind[i]==0)q.emplace(i);
while(!q.empty()){
auto x = q.front();q.pop();
visited[x]=true;
DP[x][0]=C[x];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |