oj.uz

답안 #1102750

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1102750 2024-10-18T18:56:44 Z _rain_ Islands (IOI08_islands) C++14
57 / 100
 426 ms 131072 KB 
#include<bits/stdc++.h>
using namespace std;

#define name "main"
typedef long long ll;
typedef pair<int,int> ii;
#define fi first
#define se second

const int N = (int)1e6;
vector<ii> ke[N+2];
int cost[N+2],gi[N+2],en[N+2],l[N+2],vis[N+2],n,cha[N+2],arr[N+2],sz=0,times=0;
ll dep[N+2]={},pre[N+2]={},f[N+2]={};
bool com[N+2];
void add_edge(int u , int v , int w){
	ke[u].push_back({v,w});
	ke[v].push_back({u,w});
}
void search(int u , int p){
	vis[u] = ++times;
	for (auto& x:ke[u]){
		int v=x.fi,w=x.se;
		if (v==p) continue;
		if (!vis[v]) {
			cha[v]=u;
			gi[v]=w;
			search(v,u);
		}
		else{
			if (vis[v]<vis[u]) continue;
			++sz;
			arr[sz]=v;cost[sz]=w;
			for (; v!=u; v=cha[v]){
				++sz;
				arr[sz]=cha[v];
				cost[sz]=gi[v];
			}
		}
	}
	return ;
}
// the component has at most 1 cycle inside ~
ll mx,ans=0;
int pos,root;
void dfs(int u , int p , ll s){
	if (mx < s){
		mx = s;
		pos = u;
	}
	for (auto& x:ke[u]){
		int v=x.fi,w=x.se;
		if ((com[v]&&v!=root)||v==p) continue;
		dfs(v,u,s+w);
	}
	return;
}
void giai(){
	ll addmore = -1;
	for (int i = 1; i <= sz; ++i) com[arr[i]] = true;
	for (int i = 1; i <= sz; ++i){
		mx=pos=root=-1;
		dfs(arr[i],0,0);
		dep[i]=mx;
		root=arr[i];
		dfs(pos,0,0);
		addmore = max(addmore,mx);
		pre[i]=pre[i-1]+cost[i];
	}
	for (int i = sz + 1; i <= sz*2; ++i){
		cost[i] = cost[i-sz];
		dep[i] = dep[i-sz];
		pre[i]=pre[i-1]+cost[i];
	}
	for (int i=1; i<=sz*2; ++i) f[i]=dep[i]-pre[i];
	deque<int> q;
	for (int i = 1; i <= sz*2; ++i){
		while (q.size() && f[q.back()]<=f[i]) q.pop_back();
		while (q.size() && q.front()<i-sz+1) q.pop_front();
		if (q.size()){
			addmore = max(addmore,pre[i]+dep[i]+f[q.front()]);
		}
		q.push_back(i);
	}
	ans+=addmore;
}

int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);

	cin>>n;
	for (int i=1; i<=n; ++i){
		cin>>en[i]>>l[i];
		add_edge(i,en[i],l[i]);
	}
	for (int i=1; i<=n; ++i){
		if (!vis[i]){
			sz = times = 0;
			search(i,i);
			giai();
		}
	}
	cout<<ans;
	exit(0);
}

Subtask #1
30.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 42576 KB Output is correct
2 Incorrect 7 ms 42708 KB Output isn't correct
3 Correct 7 ms 42832 KB Output is correct
4 Correct 6 ms 42576 KB Output is correct
5 Correct 7 ms 42720 KB Output is correct
6 Correct 7 ms 42576 KB Output is correct
7 Correct 6 ms 42780 KB Output is correct
8 Correct 7 ms 42576 KB Output is correct
9 Correct 7 ms 42684 KB Output is correct
10 Correct 8 ms 42576 KB Output is correct
11 Correct 8 ms 42576 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 43000 KB Output is correct
2 Correct 8 ms 42832 KB Output is correct

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 42832 KB Output is correct
2 Correct 10 ms 43088 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 43492 KB Output is correct
2 Correct 18 ms 45648 KB Output is correct
3 Correct 13 ms 43776 KB Output is correct
4 Correct 11 ms 43212 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 46920 KB Output is correct
2 Correct 30 ms 48476 KB Output is correct

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 54600 KB Output is correct
2 Incorrect 65 ms 60964 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 67912 KB Output is correct
2 Correct 147 ms 101884 KB Output is correct
3 Incorrect 176 ms 120620 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 198 ms 92564 KB Output is correct
2 Runtime error 426 ms 131072 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 256 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -