oj.uz

Submission #959554

# Submission time Handle Problem Language Result Execution time Memory
959554 2024-04-08T12:34:51 Z NemanjaSo2005 Split the Attractions (IOI19_split) C++17
40 / 100
 95 ms 27488 KB 
#include "split.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=1e5+5;
ll N,a,b,c,siz[maxn],cent;
int rod[maxn],vel[maxn],ima[maxn];
bool prosli[maxn],blok[maxn];
vector<int> graf[maxn],stablo[maxn],A,B,C,V,res;
vector<pair<int,int>> ostale;
void maketree(int gde){
   prosli[gde]=true;
   for(int p:graf[gde])
      if(!prosli[p]){
         stablo[gde].push_back(p);
         stablo[p].push_back(gde);
         maketree(p);
      }
      else
         ostale.push_back({p,gde});
}
int dfs1(int gde,int pret){
   siz[gde]=1;
   for(int p:stablo[gde])
      if(p!=pret)
         siz[gde]+=dfs1(p,gde);
   return siz[gde];
}
int findcentr(int gde,int pret){
   for(int p:stablo[gde]){
      if(p==pret)
         continue;
      if(siz[p]>=N/2+1)
         return findcentr(p,gde);
   }
   return gde;
}
int collect(int gde,int pret,int kol){
   if(kol==0)
      return 0;
   if(prosli[gde])
      return 0;
   prosli[gde]=true;
   //cout<<"COLLECT "<<gde<<" "<<kol<<endl;
   V.push_back(gde);
   int ret=1;
   kol--;
   for(int p:stablo[gde]){
      if(p==pret)
         continue;
      if(blok[p])
         continue;
      if(prosli[p])
         continue;
      int v=collect(p,gde,kol);
      kol-=v;
      ret+=v;
      if(kol==0)
         return ret;
   }
   return ret;
}
int getpar(int x){
   if(rod[x]==x)
      return x;
   rod[x]=getpar(rod[x]);
   return rod[x];
}
int spoj(int a,int b){
 //  cout<<"SPOJ "<<a<<" "<<b<<endl;
   a=getpar(a);
   b=getpar(b);
   if(a==b)
      return a;
   if(vel[a]>vel[b]){
      ima[a]+=ima[b];
      rod[b]=a;
      return a;
   }
   else{
      ima[b]+=ima[a];
      rod[a]=b;
      vel[b]=max(vel[b],vel[a]+1);
      return b;
   }
}
void sveujedan(int gde,int pret){
   spoj(gde,pret);
   for(int p:stablo[gde])
      if(p!=pret and p!=cent)
         sveujedan(p,gde);
}
void resavaj(){
   for(int x:stablo[cent])
      sveujedan(x,x);
   for(int i=1;i<=N;i++)
      prosli[i]=false;
   for(int x:stablo[cent]){
      int r=getpar(x);
      //cout<<r<<" "<<ima[r]<<endl;
      if(ima[r]>=a){
       //  cout<<"OVDE"<<endl;
         blok[cent]=true;
         collect(r,r,a);
         A=V;
         blok[cent]=false;
         for(int x:V)
            blok[x]=true;
         V.clear();
         collect(cent,cent,b);
         B=V;
         return;
      }
   }
   for(auto e:ostale){
      int x=e.first;
      int y=e.second;
      int z=spoj(a,b);
      stablo[x].push_back(y);
      stablo[y].push_back(x);

      if(ima[z]>=b){
         blok[cent]=true;
         collect(z,z,b);
         B=V;
         blok[cent]=false;
         for(int x:V)
            blok[x]=true;
         V.clear();
         collect(cent,cent,a);
         A=V;
         return;
      }
      if(ima[z]>=a){
         blok[cent]=true;
         collect(z,z,a);
         A=V;
         blok[cent]=false;
         for(int x:V)
            blok[x]=true;
         V.clear();
         collect(cent,cent,b);
         B=V;
         return;

      }
   }
}
vector<int> find_split(int n, int aa, int bb, int cc, vector<int> p, vector<int> q) {
	N=n;
	for(int i=1;i<=N;i++){
      rod[i]=i;
      ima[i]=vel[i]=1;
	}
	for(int i=1;i<=N;i++)
      res.push_back(0);
	a=aa;
	b=bb;
	c=cc;
	for(int i=0;i<p.size();i++){
      int x=p[i];
      int y=q[i];
      x++;
      y++;
      graf[x].push_back(y);
      graf[y].push_back(x);
	}

	if(a>b)
      swap(a,b);
   if(b>c)
      swap(b,c);
   if(a>b)
      swap(a,b);

   maketree(1);
   dfs1(1,1);
   cent=findcentr(1,1);
   dfs1(cent,cent);

   resavaj(); /// Procesira centroid
   if(A.size()!=0){
      for(int i=1;i<=N;i++)
         prosli[i]=false;
      for(int x:A)
         prosli[x]=true;
      for(int x:B)
         prosli[x]=true;
      for(int i=1;i<=N;i++)
         if(prosli[i]==false)
            C.push_back(i);
      if(aa==B.size())
         swap(A,B);
      if(aa==C.size())
         swap(A,C);
      if(bb==C.size())
         swap(B,C);

      for(int x:A)
         res[x-1]=1;
      for(int x:B)
         res[x-1]=2;
      for(int x:C)
         res[x-1]=3;

      return res;
   }
	return res;
}

/*
9 10
4 2 3
0 1
0 2
0 3
0 4
0 6
0 8
1 7
3 7
4 5
5 6
*/

Compilation message

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:160:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  160 |  for(int i=0;i<p.size();i++){
      |              ~^~~~~~~~~
split.cpp:192:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  192 |       if(aa==B.size())
      |          ~~^~~~~~~~~~
split.cpp:194:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  194 |       if(aa==C.size())
      |          ~~^~~~~~~~~~
split.cpp:196:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  196 |       if(bb==C.size())
      |          ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 6748 KB ok, correct split
2 Correct 3 ms 6744 KB ok, correct split
3 Correct 3 ms 6748 KB ok, correct split
4 Correct 1 ms 6748 KB ok, correct split
5 Correct 2 ms 6756 KB ok, correct split
6 Correct 2 ms 6748 KB ok, correct split
7 Correct 88 ms 27000 KB ok, correct split
8 Correct 74 ms 24040 KB ok, correct split
9 Correct 90 ms 23484 KB ok, correct split
10 Correct 73 ms 27104 KB ok, correct split
11 Correct 95 ms 27488 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6744 KB ok, correct split
2 Correct 2 ms 6748 KB ok, correct split
3 Correct 2 ms 6748 KB ok, correct split
4 Correct 81 ms 24296 KB ok, correct split
5 Correct 61 ms 18540 KB ok, correct split
6 Correct 88 ms 27140 KB ok, correct split
7 Correct 66 ms 24272 KB ok, correct split
8 Correct 95 ms 22252 KB ok, correct split
9 Correct 61 ms 18552 KB ok, correct split
10 Correct 46 ms 18900 KB ok, correct split
11 Correct 65 ms 19112 KB ok, correct split
12 Correct 53 ms 19440 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB ok, correct split
2 Correct 60 ms 18368 KB ok, correct split
3 Correct 22 ms 11220 KB ok, correct split
4 Correct 1 ms 6744 KB ok, correct split
5 Correct 71 ms 21520 KB ok, correct split
6 Correct 65 ms 21388 KB ok, correct split
7 Correct 65 ms 20980 KB ok, correct split
8 Correct 65 ms 22676 KB ok, correct split
9 Correct 61 ms 20936 KB ok, correct split
10 Correct 20 ms 10444 KB ok, no valid answer
11 Correct 40 ms 12544 KB ok, no valid answer
12 Correct 68 ms 19040 KB ok, no valid answer
13 Correct 81 ms 18956 KB ok, no valid answer
14 Correct 57 ms 19000 KB ok, no valid answer

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6600 KB ok, correct split
2 Correct 2 ms 6744 KB ok, no valid answer
3 Correct 1 ms 6768 KB ok, correct split
4 Correct 1 ms 6748 KB ok, correct split
5 Correct 2 ms 6748 KB ok, correct split
6 Correct 2 ms 6748 KB ok, correct split
7 Correct 2 ms 6748 KB ok, correct split
8 Correct 1 ms 6752 KB ok, correct split
9 Correct 3 ms 7004 KB ok, correct split
10 Correct 3 ms 7004 KB ok, correct split
11 Correct 2 ms 6748 KB ok, correct split
12 Correct 3 ms 7004 KB ok, correct split
13 Correct 2 ms 6768 KB ok, correct split
14 Correct 1 ms 6748 KB ok, correct split
15 Correct 2 ms 6748 KB ok, correct split
16 Correct 2 ms 6748 KB ok, correct split
17 Correct 1 ms 6748 KB ok, correct split
18 Correct 2 ms 6748 KB ok, correct split
19 Correct 2 ms 6748 KB ok, correct split
20 Correct 3 ms 6748 KB ok, correct split
21 Correct 3 ms 7004 KB ok, correct split
22 Correct 3 ms 7004 KB ok, correct split
23 Correct 3 ms 7000 KB ok, correct split
24 Correct 2 ms 7032 KB ok, correct split
25 Correct 3 ms 7004 KB ok, correct split
26 Incorrect 4 ms 7088 KB jury found a solution, contestant did not
27 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 6748 KB ok, correct split
2 Correct 3 ms 6744 KB ok, correct split
3 Correct 3 ms 6748 KB ok, correct split
4 Correct 1 ms 6748 KB ok, correct split
5 Correct 2 ms 6756 KB ok, correct split
6 Correct 2 ms 6748 KB ok, correct split
7 Correct 88 ms 27000 KB ok, correct split
8 Correct 74 ms 24040 KB ok, correct split
9 Correct 90 ms 23484 KB ok, correct split
10 Correct 73 ms 27104 KB ok, correct split
11 Correct 95 ms 27488 KB ok, correct split
12 Correct 2 ms 6744 KB ok, correct split
13 Correct 2 ms 6748 KB ok, correct split
14 Correct 2 ms 6748 KB ok, correct split
15 Correct 81 ms 24296 KB ok, correct split
16 Correct 61 ms 18540 KB ok, correct split
17 Correct 88 ms 27140 KB ok, correct split
18 Correct 66 ms 24272 KB ok, correct split
19 Correct 95 ms 22252 KB ok, correct split
20 Correct 61 ms 18552 KB ok, correct split
21 Correct 46 ms 18900 KB ok, correct split
22 Correct 65 ms 19112 KB ok, correct split
23 Correct 53 ms 19440 KB ok, correct split
24 Correct 1 ms 6748 KB ok, correct split
25 Correct 60 ms 18368 KB ok, correct split
26 Correct 22 ms 11220 KB ok, correct split
27 Correct 1 ms 6744 KB ok, correct split
28 Correct 71 ms 21520 KB ok, correct split
29 Correct 65 ms 21388 KB ok, correct split
30 Correct 65 ms 20980 KB ok, correct split
31 Correct 65 ms 22676 KB ok, correct split
32 Correct 61 ms 20936 KB ok, correct split
33 Correct 20 ms 10444 KB ok, no valid answer
34 Correct 40 ms 12544 KB ok, no valid answer
35 Correct 68 ms 19040 KB ok, no valid answer
36 Correct 81 ms 18956 KB ok, no valid answer
37 Correct 57 ms 19000 KB ok, no valid answer
38 Correct 2 ms 6600 KB ok, correct split
39 Correct 2 ms 6744 KB ok, no valid answer
40 Correct 1 ms 6768 KB ok, correct split
41 Correct 1 ms 6748 KB ok, correct split
42 Correct 2 ms 6748 KB ok, correct split
43 Correct 2 ms 6748 KB ok, correct split
44 Correct 2 ms 6748 KB ok, correct split
45 Correct 1 ms 6752 KB ok, correct split
46 Correct 3 ms 7004 KB ok, correct split
47 Correct 3 ms 7004 KB ok, correct split
48 Correct 2 ms 6748 KB ok, correct split
49 Correct 3 ms 7004 KB ok, correct split
50 Correct 2 ms 6768 KB ok, correct split
51 Correct 1 ms 6748 KB ok, correct split
52 Correct 2 ms 6748 KB ok, correct split
53 Correct 2 ms 6748 KB ok, correct split
54 Correct 1 ms 6748 KB ok, correct split
55 Correct 2 ms 6748 KB ok, correct split
56 Correct 2 ms 6748 KB ok, correct split
57 Correct 3 ms 6748 KB ok, correct split
58 Correct 3 ms 7004 KB ok, correct split
59 Correct 3 ms 7004 KB ok, correct split
60 Correct 3 ms 7000 KB ok, correct split
61 Correct 2 ms 7032 KB ok, correct split
62 Correct 3 ms 7004 KB ok, correct split
63 Incorrect 4 ms 7088 KB jury found a solution, contestant did not
64 Halted 0 ms 0 KB -