oj.uz

Submission #233020

# Submission time Handle Problem Language Result Execution time Memory
233020 2020-05-18T23:20:37 Z FieryPhoenix Islands (IOI08_islands) C++11
70 / 100
 896 ms 131076 KB 
#include <bits/stdc++.h>
using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
typedef long double ld;
#define INF 2001001001
#define MOD 1000000007
#define f first
#define s second

int N;
int L[1000001];
vector<pair<int,int>>adj[1000001];
bool vis[1000001];
ll ans;
int from[1000001];
vector<int>cycle,adjDis;
vector<ll>deepest;
int bad,bad2;
ll maxCur;

void findCycle(int node, int par){
  //cout<<"findCycle: "<<node<<endl;
  vis[node]=true;
  for (auto p:adj[node]){
    if (cycle.size()==0 && vis[p.first] && p.first!=par){ //found cycle
      //cout<<"found cycle"<<endl;
      int cur=node;
      while (cur!=p.first){
	cycle.push_back(cur);
	cur=from[cur];
      }
      cycle.push_back(p.first);
    }
    else if (!vis[p.first]){
      from[p.first]=node;
      findCycle(p.first,node);
    }
  }
}

ll maxDis,maxNode;

void findFarthest(int node0, int par0, ll dis0){
  maxDis=-1; maxNode=-1;
  queue<pair<pair<int,int>,ll>>q;
  q.push({{node0,par0},dis0});
  while (!q.empty()){
    pair<pair<int,int>,ll>P=q.front();
    q.pop();
    int node=P.f.f;
    int par=P.f.s;
    ll dis=P.s;
    if (dis>maxDis){
      maxDis=dis;
      maxNode=node;
    }
    for (auto p:adj[node]){
      if (p.first!=par && p.first!=bad && p.first!=bad2)
        q.push({{p.first,node},dis+p.second});
    }
  }
}
    

ll findDiameter(int node){
  findFarthest(node,node,0);
  int newNode=maxNode;
  findFarthest(newNode,newNode,0);
  return maxDis;
}

map<pair<int,int>,int>mp;
ll pref[1000001],suff[1000001],pref2[1000001],suff2[1000001];

int main()
{
  //ios_base::sync_with_stdio(0);cin.tie(0);
  //freopen (".in","r",stdin);
  //freopen (".out","w",stdout);
  scanf("%d",&N);
  for (int i=1;i<=N;i++){
    int Y;
    scanf("%d%d",&Y,&L[i]);
    int x=i,y=Y;
    if (x>y) swap(x,y);
    mp[{x,y}]=max(mp[{x,y}],L[i]);
  }
  for (auto it:mp){
    //cout<<"edge: "<<it.first.first<<' '<<it.first.second<<endl;
    adj[it.first.first].push_back({it.first.second,it.second});
    adj[it.first.second].push_back({it.first.first,it.second});
  }
  for (int i=1;i<=N;i++)
    if (!vis[i]){
      //cout<<"Component: "<<i<<endl;
      cycle.clear();
      adjDis.clear();
      deepest.clear();
      findCycle(i,i);
      /*
      cout<<"Cycle: ";
      for (int x:cycle)
      	cout<<x<<' ';
      cout<<endl;
      */
      if (cycle.size()==0){
	//cout<<"multiEdge: "<<findDiameter(i)<<endl;
	ans+=findDiameter(i);
	continue;
      }
      maxCur=0;
      int C=cycle.size();
      for (int i=0;i<C;i++){
	pref[i]=0;
	suff[i]=0;
	pref2[i]=0;
	suff2[i]=0;
	int inFront=cycle[(i+1)%C];
	int inBack=cycle[(i-1+C)%C];
	adjDis.push_back(mp[{min(cycle[i],inFront),max(cycle[i],inFront)}]);
	bad=inFront;
	bad2=inBack;
	maxCur=max(maxCur,findDiameter(cycle[i]));
	findFarthest(cycle[i],cycle[i],0);
	deepest.push_back(maxDis);
      }
      for (int i=0;i<C;i++){
	if (i>0){
	  pref[i]=pref[i-1]+adjDis[i-1];
	  pref2[i]=max(pref2[i-1],pref[i]+deepest[i]);
	}
	else
	  pref2[i]=deepest[i];
      }
      /*
      cout<<"deepest: "<<' ';
      for (int x:deepest)
	cout<<x<<' ';
      cout<<endl;
      cout<<"adjDis: "<<' ';
      for (int x:adjDis)
	cout<<x<<' ';
      cout<<endl;
      cout<<"pref: ";
      for (int i=0;i<C;i++)
	cout<<pref[i]<<' ';
      cout<<endl;
      */
      for (int i=C-1;i>=0;i--){
	if (i+1<C){
	  suff[i]=suff[i+1]+adjDis[i];
	  suff2[i]=max(suff2[i+1],suff[i]+deepest[i]);
	}
	else
	  suff2[i]=deepest[i];
      }
      for (int i=0;i+1<C;i++){
	//cout<<i<<": "<<adjDis.back()<<' '<<pref2[i]<<' '<<suff2[i+1]<<endl;
	maxCur=max(maxCur,adjDis.back()+pref2[i]+suff2[i+1]);
      }
      ll sweep=0;
      for (int i=0;i<C;i++){
	maxCur=max(maxCur,sweep+deepest[i]);
	sweep=max(sweep,(ll)deepest[i]);
	sweep+=adjDis[i];
      }
      ans+=maxCur;
      //cout<<"maxCur: "<<maxCur<<endl;
    }
  cout<<ans<<endl;
  return 0;
}

Compilation message

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

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23808 KB Output is correct
2 Correct 18 ms 23936 KB Output is correct
3 Correct 18 ms 23936 KB Output is correct
4 Correct 18 ms 23808 KB Output is correct
5 Correct 17 ms 23936 KB Output is correct
6 Correct 17 ms 23808 KB Output is correct
7 Correct 17 ms 23808 KB Output is correct
8 Correct 18 ms 23936 KB Output is correct
9 Correct 17 ms 23936 KB Output is correct
10 Correct 17 ms 23808 KB Output is correct
11 Correct 17 ms 23808 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 24064 KB Output is correct
2 Correct 18 ms 23936 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 24064 KB Output is correct
2 Correct 22 ms 24576 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 25728 KB Output is correct
2 Correct 66 ms 29688 KB Output is correct
3 Correct 37 ms 26232 KB Output is correct
4 Correct 27 ms 24960 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 32056 KB Output is correct
2 Correct 140 ms 37280 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 48120 KB Output is correct
2 Correct 316 ms 57580 KB Output is correct
3 Correct 384 ms 70380 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 488 ms 68924 KB Output is correct
2 Correct 606 ms 103692 KB Output is correct
3 Correct 880 ms 118440 KB Output is correct
4 Runtime error 726 ms 131076 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 884 ms 131076 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 896 ms 131076 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -