oj.uz

답안 #216620

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
216620 2020-03-27T16:33:30 Z songc Islands (IOI08_islands) C++14
90 / 100
 776 ms 131076 KB 
#include <bits/stdc++.h>
#define pb push_back
#define all(v) v.begin(),v.end()
#define fi first
#define se second
#define INF (1ll<<60)
using namespace std;
typedef long long LL;
typedef pair<LL,LL> pii;
 
int N, M;
LL ans, ret;
int P[1000010], W[1000010];
bool chk[1000010];
vector<int> adj[1000010];
vector<LL> V, S;
 
int cyc(int u){
	if (chk[u]) return u;
	chk[u] = true;
	int r = cyc(P[u]);
	if (r){
		V.pb(u), S.pb(W[u]);
		return (r==u)?0:r;
	}
	chk[u] = false;
	return 0;
}
 
LL dfs(int u){
	LL mx=0;
	chk[u] = true;
	for (int v : adj[u]){
		if (chk[v]) continue;
		LL r = dfs(v) + W[v];
		ret = max(ret, mx+r);
		mx = max(mx, r);
	}
	return mx;
}
 
void dia(int u){
	V.clear(), S.clear();
	cyc(u);
	reverse(all(V)); reverse(all(S));
	for (LL &v : V) v = dfs(v);
	M = V.size();
	for (int i=M-1; i>0; i--) swap(S[i], S[i-1]);
	for (int i=1; i<M; i++) S[i] += S[i-1];
	LL m1=-INF, m2=-INF;
	for (int i=0; i<M; i++){
		ret = max(ret, m1+S[i]+V[i]);
		ret = max(ret, m2-S[i]+V[i]+S[M-1]);
		m1 = max(m1, V[i]-S[i]);
		m2 = max(m2, V[i]+S[i]);
	}
}
 
int main(){
	scanf("%d", &N);
	for (int i=1; i<=N; i++){
		scanf("%d %d", &P[i], &W[i]);
		adj[P[i]].pb(i);
	}
	for (int i=1; i<=N; i++){
		if (chk[i]) continue;
		dia(i);
		ans+=ret, ret=0;
	}
	printf("%lld\n", ans);
	return 0;
}

Compilation message

islands.cpp: In function 'int main()':
islands.cpp:60:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
islands.cpp:62:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &P[i], &W[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 23808 KB Output is correct
2 Correct 19 ms 23808 KB Output is correct
3 Correct 20 ms 23936 KB Output is correct
4 Correct 19 ms 23808 KB Output is correct
5 Correct 20 ms 23808 KB Output is correct
6 Correct 20 ms 23808 KB Output is correct
7 Correct 19 ms 23808 KB Output is correct
8 Correct 18 ms 23808 KB Output is correct
9 Correct 19 ms 23808 KB Output is correct
10 Correct 19 ms 23808 KB Output is correct
11 Correct 18 ms 23808 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 23936 KB Output is correct
2 Correct 20 ms 23936 KB Output is correct

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 23936 KB Output is correct
2 Correct 22 ms 24192 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 24696 KB Output is correct
2 Correct 34 ms 26624 KB Output is correct
3 Correct 30 ms 24704 KB Output is correct
4 Correct 23 ms 24320 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 27772 KB Output is correct
2 Correct 56 ms 29560 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 32040 KB Output is correct
2 Correct 112 ms 40780 KB Output is correct
3 Correct 130 ms 46692 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 166 ms 38420 KB Output is correct
2 Correct 240 ms 55824 KB Output is correct
3 Correct 225 ms 73044 KB Output is correct
4 Correct 323 ms 79068 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 331 ms 37212 KB Output is correct
2 Correct 627 ms 96468 KB Output is correct
3 Correct 307 ms 47624 KB Output is correct
4 Correct 400 ms 80604 KB Output is correct
5 Correct 390 ms 78296 KB Output is correct
6 Correct 776 ms 51960 KB Output is correct
7 Correct 436 ms 111680 KB Output is correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 412 ms 131076 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -