oj.uz

답안 #199084

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
199084 2020-01-29T07:34:40 Z dennisstar Telegraph (JOI16_telegraph) C++17
0 / 100
 5 ms 760 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define ryan bear
#define em emplace
#define eb emplace_back
#define sq(X) ((X)*(X))
#define all(V) (V).begin(), (V).end()
#define chk_init memset(chk, 0, sizeof(chk))
#define unq(V) (V).erase(unique(all(V)), (V).end())
using namespace std;
typedef long long ll;
typedef vector<ll> vlm;
typedef vector<int> vim;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

int N, A[100010], chk[100010], cy[100010];
ll C[100010], S, ans, M1[100010], M2[100010];

int main() {
	scanf("%d", &N);
	for (int i=1; i<=N; i++) scanf("%d %lld", &A[i], &C[i]), S+=C[i];

	for (int i=1; !chk[i]; i=A[i]) chk[i]=1;
	chk[N+1]=1;
	for (int i=1; chk[i]&&i<=N+1; i++) if (i==N+1) { puts("0"); return 0; }
	chk_init;

	for (int i=1; i<=N; i++) if (!chk[i]) {
		int j; for (j=i; !chk[j]; j=A[j]) chk[j]=i;
		if (chk[j]==i) for (j=i; !cy[j]; j=A[j]) cy[j]=1;
	}
	for (int i=1; i<=N; i++) M1[A[i]]=max(M1[A[i]], C[i]);
	for (int i=1; i<=N; i++) if (!cy[i]) M2[A[i]]=max(M2[A[i]], C[i]);
	for (int i=1; i<=N; i++) ans+=M1[i];
	ll mx;
	for (int i=1; i<=N; i++) if (cy[i]) {
		mx=-(1ll<<60);
		for (int j=i; cy[j]; j=A[j]) {
			mx=max(mx, M2[j]-M1[j]);
			cy[j]=0;
		}
		ans+=mx;
	}
	printf("%lld\n", S-ans);
	return 0;
}

Compilation message

telegraph.cpp: In function 'int main()':
telegraph.cpp:22:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
telegraph.cpp:23:57: 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 %lld", &A[i], &C[i]), S+=C[i];
                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 30.0

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

Subtask #3
0 / 30.0

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

Subtask #4
0 / 30.0

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