oj.uz

답안 #120360

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
120360 2019-06-24T08:54:24 Z nvmdava Islands (IOI08_islands) C++17
18 / 100
 576 ms 131072 KB 
#include <bits/stdc++.h>
using namespace std;
#define N 1000001

vector<pair<int, long long> > adj[N];
bool in[N];
vector<int> s;
vector<int> cyc;
vector<long long> dp;
bool inCyc[N];
long long res;

long long dfs(int v, int p){
	long long b1 = 0, b2 = 0;
	for(auto xx : adj[v]){
		int x = xx.first;
		long long c = xx.second;
		
		if(inCyc[x] || p == x) continue;
		auto q = dfs(x, v);
		
		long long up;
		up = q + c;
		if(b1 < up){
			b2 = b1;
			b1 = up;
		} else b2 = max(b2, up);
	}
	res = max(res, b1 + b2);
	return b1;
}

long long ans = 0;
unordered_map<int, unordered_map<int, long long> > lol; 
vector<long long> p;
vector<int> cyc2;
vector<long long> dp2, p2;
void solve(){
	dp.clear();
	p.clear();
	p2.clear();
	cyc.clear();
	cyc2.clear();
	dp2.clear();
	res = 0;
	for(int x : s){
		if(inCyc[x]) {	
			p.push_back(p.empty() ? 0 : p.back() + lol[x][cyc.back()]);
			cyc.push_back(x);
			dp.push_back(dfs(x, 0));
		}
	}
	long long full = p.back() + lol[cyc[0]][cyc.back()];
	long long tmp = dp[0] - p[0];
	for(int i = 1; i < cyc.size(); i++){
		res = max(res, tmp + dp[i] + p[i]);
		tmp = max(tmp, dp[i] - p[i]);
	}
	cyc2.push_back(cyc[0]);
	dp2.push_back(dp[0]);
	p2.push_back(0);
	for(int i = cyc.size() - 1; i > 0; i--){
		p2.push_back(p2.back() + lol[cyc[i]][cyc2.back()]);
		cyc2.push_back(cyc[i]);
		dp2.push_back(dp[i]);
	}
	
	tmp = dp2[0] - p2[0];
	for(int i = 1; i < cyc.size(); i++){
		res = max(res, tmp + dp2[i] + p2[i]);
		tmp = max(tmp, dp2[i] - p2[i]);
	}
	ans += res;
}

int trav(int i, int p){
	s.push_back(i);
	in[i] = 1;
	int res = 0;
	bool ok = 0;
	for(auto xx : adj[i]){
		int x = xx.first;
		if(p == x && ok == 0){
			ok = 1;	
			continue;
		}
		if(in[x]){
			res = x;
			continue;
		}
		int t = trav(x, i);
		if(res < t)res = t;
	}
	if(res) inCyc[i] = 1;
	if(res == i) return 0;
	return res;
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	
	for(int i = 1; i <= n; i++){
		int e;
		long long l;
		cin>>e>>l;
		adj[e].push_back({i, l});
		adj[i].push_back({e, l});
		lol[e][i] = max(lol[e][i], l);
		lol[i][e] = max(lol[i][e], l);
	}
	
	for(int i = 1; i <= n; i++){
		if(in[i]) continue;
		s.clear();		
		trav(i, 0);
		solve();
	}
	
	cout<<ans;
}

Compilation message

islands.cpp: In function 'void solve()':
islands.cpp:55:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 1; i < cyc.size(); i++){
                 ~~^~~~~~~~~~~~
islands.cpp:69:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 1; i < cyc.size(); i++){
                 ~~^~~~~~~~~~~~
islands.cpp:53:12: warning: unused variable 'full' [-Wunused-variable]
  long long full = p.back() + lol[cyc[0]][cyc.back()];
            ^~~~

Subtask #1
18.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 23936 KB Output is correct
2 Incorrect 23 ms 23936 KB Output isn't correct
3 Incorrect 24 ms 23936 KB Output isn't correct
4 Correct 22 ms 23808 KB Output is correct
5 Correct 22 ms 23808 KB Output is correct
6 Correct 23 ms 23928 KB Output is correct
7 Incorrect 23 ms 23852 KB Output isn't correct
8 Incorrect 24 ms 23888 KB Output isn't correct
9 Incorrect 22 ms 23808 KB Output isn't correct
10 Correct 23 ms 23936 KB Output is correct
11 Correct 22 ms 23936 KB Output is correct

Subtask #2
0 / 3.0

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

Subtask #3
0 / 4.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 137 ms 39520 KB Output is correct
2 Incorrect 153 ms 51788 KB Output isn't correct

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 354 ms 78160 KB Output is correct
2 Correct 411 ms 90376 KB Output is correct
3 Incorrect 469 ms 111288 KB Output isn't correct

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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