제출 #198900

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
198900		arnold518	Islands (IOI08_islands)	C++14	90 / 100	2081 ms	130532 KiB

islands

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

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e6;

int N;
vector<pii> adj[MAXN+1];
pii to[MAXN+1];
ll ans, val;

bool vis[MAXN+1];
vector<int> cyc;
ll A[MAXN+1], D[MAXN+1];
int AS, DS;

ll dfs(int now, ll dep)
{
	vis[now]=true;
	ll ret=dep;

	ll ta=0, tb=0;

	for(pii &nxt : adj[now])
	{
		if(vis[nxt.first]) continue;
		ll p=dfs(nxt.first, dep+nxt.second);
		ret=max(ret, p);
		if(p>ta) tb=ta, ta=p;
		else if(p>tb) tb=p;
	}
	val=max(val, ta+tb-dep-dep);
	return ret;
}

int main()
{
	int i, j;

	scanf("%d", &N);
	for(i=1; i<=N; i++)
	{
		int v, w;
		scanf("%d%d", &v, &w);
		to[i]={v, w};
		adj[v].push_back({i, w});
	}

	for(i=1; i<=N; i++)
	{
		if(vis[i]) continue;

		int now=i;
		cyc=vector<int>(0);
		while(!vis[now])
		{
			cyc.push_back(now);
			vis[now]=1;
			now=to[now].first;
		}

		reverse(cyc.begin(), cyc.end());
		while(!cyc.empty() && cyc.back()!=now) vis[cyc.back()]=0, cyc.pop_back();
		reverse(cyc.begin(), cyc.end());

		AS=DS=0;
		ll s=0; val=0;

		D[DS++]=0;
		for(i=0; i<cyc.size(); i++) A[AS++]=dfs(cyc[i], 0);
		for(i=0; i<cyc.size(); i++) D[DS++]=(D[DS-1]+to[cyc[i]].second), s+=to[cyc[i]].second;
		DS--;

		ll t=-1e18;
		for(j=0; j<cyc.size(); j++)
		{
			if(j) val=max(val, D[j]+A[j]+t);
			t=max(t, A[j]-D[j]);
		}

		t=-1e18;
		for(j=0; j<cyc.size(); j++)
		{
			if(j) val=max(val, s-D[j]+A[j]+t);
			t=max(t, D[j]+A[j]);
		}

		ans+=val;
	}
	printf("%lld", ans);
}

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

islands.cpp: In function 'int main()':
islands.cpp:73:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(i=0; i<cyc.size(); i++) A[AS++]=dfs(cyc[i], 0);
            ~^~~~~~~~~~~
islands.cpp:74:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(i=0; i<cyc.size(); i++) D[DS++]=(D[DS-1]+to[cyc[i]].second), s+=to[cyc[i]].second;
            ~^~~~~~~~~~~
islands.cpp:74:35: warning: operation on 'DS' may be undefined [-Wsequence-point]
   for(i=0; i<cyc.size(); i++) D[DS++]=(D[DS-1]+to[cyc[i]].second), s+=to[cyc[i]].second;
                                 ~~^~
islands.cpp:78:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(j=0; j<cyc.size(); j++)
            ~^~~~~~~~~~~
islands.cpp:85:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(j=0; j<cyc.size(); j++)
            ~^~~~~~~~~~~
islands.cpp:43:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
islands.cpp:47:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &v, &w);
   ~~~~~^~~~~~~~~~~~~~~~

• Subtask 1: 33 / 33
• Subtask 2: 3 / 3
• Subtask 3: 4 / 4
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 0 / 10