oj.uz

답안 #1011518

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1011518 2024-06-30T14:46:22 Z pcc Telegraph (JOI16_telegraph) C++17
0 / 100
 0 ms 344 KB 
#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],dp2[mxn][4];
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();
		q.pop();
		auto [nxt,d] = arr[now];
		deg[nxt]--;
		dp[nxt][0] = max(dp[nxt][0],max(dp[now][0],dp[now][1]));
		dp[nxt][1] = max(dp[nxt][1],max(dp[now][0],dp[now][1])+d);
		if(!deg[nxt])q.push(nxt);
	}
	ll ans = 0;
	for(int ii = 1;ii<=N;ii++){
		if(!deg[ii])continue;
		int now = ii;
		vector<pii> v;
		ll tans = 0;
		priority_queue<ll,vector<ll>,less<ll>> pq;
		do{
			deg[now] = 0;
			auto [nxt,d] = arr[now];
			pq.push(dp[nxt][1]-dp[nxt][0]-d);
			ans += dp[nxt][0]+d;
			now = nxt;
		}while(now != ii);

		if(pq.size() == N)continue;
		ans += pq.top();pq.pop();
		while(pq.top()>0){
			ans += pq.top();
			pq.pop();
		}

	}
	cout<<sum-ans<<'\n';
	return 0;
}

Compilation message

telegraph.cpp: In function 'int main()':
telegraph.cpp:51:16: warning: comparison of integer expressions of different signedness: 'std::priority_queue<long long int, std::vector<long long int>, std::less<long long int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   51 |   if(pq.size() == N)continue;
      |      ~~~~~~~~~~^~~~
telegraph.cpp:41:6: warning: unused variable 'tans' [-Wunused-variable]
   41 |   ll tans = 0;
      |      ^~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -