제출 #134883

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
134883		onjo0127	Telegraph (JOI16_telegraph)	C++11	70 / 100	1078 ms	16212 KiB

telegraph

#include <bits/stdc++.h>
using namespace std;

const long long INF = 1LL * 1e18;
int N, A[100009], C[100009], D[100009], vs[100009];
bool fin[100009];
vector<vector<int> > R;
vector<int> T[100009];
long long ans;

void go(vector<int> &S, int x, int c) {
	S.push_back(x);
	vs[x] = c;
	if(vs[A[x]]) {
		if(!fin[x] && vs[A[x]] == c) {
			vector<int> stk;
			while(1) {
				int tmp = S.back(); S.pop_back();
				stk.push_back(tmp);
				if(tmp == A[x]) break;
			}
			for(auto& it: stk) fin[it] = 1;
			reverse(stk.begin(), stk.end());
			R.push_back(stk);
		}
	}
	else go(S, A[x], c);
}

void dfs(int x) {
	D[x] = 0;
	long long s = 0;
	for(auto& it: T[x]) {
		dfs(it);
		D[x] = max(D[x], C[it]);
		s += C[it];
	}
	ans += s - D[x];
}

int main() {
	scanf("%d",&N);
	for(int i=1; i<=N; i++) scanf("%d%d",&A[i],&C[i]);
	for(int i=1; i<=N; i++) if(!vs[i]) {
		vector<int> S;
		go(S, i, i);
	}
		
	// printf("rings: %d\n", R.size());
	// for(auto& it: R) {
	// 	puts("ring");
	// 	for(auto& jt: it) printf("%d ",jt);
	// 	puts("");
	// }
	// puts("\n");

	bool f = 1;
	for(int i=1; i<=N; i++) if(!fin[i]) {
		// printf("tree edge: %d -> %d\n", A[i], i);
		T[A[i]].push_back(i);
		f = 0;
	}
	if(f && (int)R.size() == 1) return !printf("0");
	for(int i=1; i<=N; i++) if(fin[i]) dfs(i);
	for(auto& it: R) {
		long long mn = INF;
		for(int i=0; i<it.size(); i++) {
			long long s = 0;
			int pr = it[i];
			for(int j=i+1; j<it.size(); j++) {
				s += min(C[pr], D[it[j]]);
				pr = it[j];
			}
			for(int j=0; j<i; j++) {
				s += min(C[pr], D[it[j]]);
				pr = it[j];
			}
			s += C[pr];
			mn = min(mn, s);
		}
		ans += mn;
	}
	printf("%lld", ans);
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

telegraph.cpp: In function 'int main()':
telegraph.cpp:67:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0; i<it.size(); i++) {
                ~^~~~~~~~~~
telegraph.cpp:70:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int j=i+1; j<it.size(); j++) {
                   ~^~~~~~~~~~
telegraph.cpp:42:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&N);
  ~~~~~^~~~~~~~~
telegraph.cpp:43:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1; i<=N; i++) scanf("%d%d",&A[i],&C[i]);
                          ~~~~~^~~~~~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 30 / 30
• Subtask 3: 30 / 30
• Subtask 4: 0 / 30