# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1011524 | pcc | Telegraph (JOI16_telegraph) | C++17 | 22 ms | 5492 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 ll long long
#define pii pair<int,int>
#define fs first
#define sc second
#define pll pair<ll,ll>
const int mxn = 1e5+10;
pii arr[mxn];
int deg[mxn];
queue<int> q;
int N;
ll dp[mxn][2];
ll sum = 0;
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>N;
for(int i = 1;i<=N;i++){
cin>>arr[i].fs>>arr[i].sc;
sum += arr[i].sc;
deg[arr[i].fs]++;
}
for(int i = 1;i<=N;i++)if(!deg[i])q.push(i);
while(!q.empty()){
auto now = q.front();
dp[now][1] = max(dp[now][1],dp[now][0]);
q.pop();
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |