oj.uz

답안 #302297

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
302297 2020-09-18T15:25:09 Z Hemimor Islands (IOI08_islands) C++14
15 / 100
 632 ms 131076 KB 
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=1e9+7;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};

int n;
vvp g;
vi vis,deg;
ll res;

ll dfs(int v,int pre=-1){
	vl a(2,0);
	for(auto p:g[v]){
		int u=p.first;
		if(!deg[u]&&u!=pre) a.push_back(dfs(u,v)+p.second);
	}
	sort(a.rbegin(),a.rend());
	res=max(res,a[0]+a[1]);
	return a[0];
}

ll f(int v){
	res=0;
	vi a;
	vis[v]--;
	queue<int> q;
	q.push(v);
	while(!q.empty()){
		v=q.front();q.pop();
		a.push_back(v);
		for(auto p:g[v]){
			int u=p.first;
			if(!vis[u]){
				vis[u]++;
				q.push(u);
			}
		}
	}
	for(auto i:a) if(deg[i]==1) q.push(i);
	while(!q.empty()){
		v=q.front();q.pop();
		deg[v]--;
		for(auto p:g[v]){
			int u=p.first;
			if(deg[u]){
				deg[u]--;
				if(deg[u]==1) q.push(u);
			}
		}
	}
	int len=0;
	for(auto i:a) if(deg[i]){
		v=i;
		len++;
	}
	int now=v,pre=-1,pw=-1;
	vi b;
	vl c,d;
	ll t=0;
	do{
		b.push_back(now);
		c.push_back(t);
		vp tmp;
		for(auto p:g[now]){
			int u=p.first;
			tmp.push_back(p);
			if(u!=pre){
				pre=now;
				pw=p.second;
				now=u;
				t+=p.second;
				break;
			}
		}
		if(len==2&&b.size()==2){
			if(tmp[0].second==pw) swap(tmp[0],tmp[1]);
			now=v;
			t+=tmp[0].second;
		}
	}while(now!=v);
	int m=b.size();
	d=vl(m);
	ll res=0,mx=-INF;
	for(int i=0;i<m;i++) d[i]=dfs(b[i]);
	for(int i=0;i<m;i++){
		res=max(res,c[i]+d[i]+mx);
		mx=max(mx,-c[i]+d[i]);
	}
	mx=-INF;
	for(int i=0;i<m;i++){
		res=max(res,t-c[i]+d[i]+mx);
		mx=max(mx,c[i]+d[i]);
	}
	return res;
}

int main(){
	scanf("%d",&n);
	g=vvp(n);
	vis=deg=vi(n);
	for(int u=0;u<n;u++){
		int v,w;
		scanf("%d%d",&v,&w);
		v--;
		g[u].push_back({v,w});
		g[v].push_back({u,w});
		deg[u]++,deg[v]++;
	}
	ll sum=0;
	for(int i=0;i<n;i++) if(!vis[i]) sum+=f(i);
	printf("%lld\n",sum);
}

Compilation message

islands.cpp: In function 'int main()':
islands.cpp:130:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  130 |  scanf("%d",&n);
      |  ~~~~~^~~~~~~~~
islands.cpp:135:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  135 |   scanf("%d%d",&v,&w);
      |   ~~~~~^~~~~~~~~~~~~~

Subtask #1
15.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Runtime error 442 ms 131076 KB Execution killed with signal 9
3 Correct 1 ms 384 KB Output is correct
4 Incorrect 1 ms 256 KB Output isn't correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Runtime error 446 ms 131072 KB Execution killed with signal 9
8 Runtime error 445 ms 131076 KB Execution killed with signal 9
9 Incorrect 1 ms 256 KB Output isn't correct
10 Incorrect 1 ms 416 KB Output isn't correct
11 Correct 1 ms 384 KB Output is correct

Subtask #2
0 / 3.0

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

Subtask #3
0 / 4.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 232 ms 27768 KB Output is correct
2 Runtime error 632 ms 131076 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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