oj.uz

Submission #959562

# Submission time Handle Problem Language Result Execution time Memory
959562 2024-04-08T12:42:07 Z NemanjaSo2005 Split the Attractions (IOI19_split) C++17
100 / 100
 129 ms 28232 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,int pret){
   prosli[gde]=true;
   for(int p:graf[gde])
      if(!prosli[p]){
         stablo[gde].push_back(p);
         stablo[p].push_back(gde);
         maketree(p,gde);
      }
      else
         if(p!=pret)
            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;
      if(x==cent or y==cent)
         continue;
      int z=spoj(x,y);
      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,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;
}

Compilation message

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

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6748 KB ok, correct split
2 Correct 2 ms 6748 KB ok, correct split
3 Correct 3 ms 6748 KB ok, correct split
4 Correct 2 ms 6748 KB ok, correct split
5 Correct 2 ms 6744 KB ok, correct split
6 Correct 1 ms 6748 KB ok, correct split
7 Correct 72 ms 25428 KB ok, correct split
8 Correct 87 ms 22604 KB ok, correct split
9 Correct 66 ms 22012 KB ok, correct split
10 Correct 76 ms 25928 KB ok, correct split
11 Correct 71 ms 25900 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6748 KB ok, correct split
2 Correct 2 ms 6748 KB ok, correct split
3 Correct 2 ms 6748 KB ok, correct split
4 Correct 79 ms 22380 KB ok, correct split
5 Correct 62 ms 16844 KB ok, correct split
6 Correct 70 ms 25700 KB ok, correct split
7 Correct 64 ms 22736 KB ok, correct split
8 Correct 83 ms 19908 KB ok, correct split
9 Correct 56 ms 16588 KB ok, correct split
10 Correct 49 ms 17356 KB ok, correct split
11 Correct 51 ms 17352 KB ok, correct split
12 Correct 45 ms 17408 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6744 KB ok, correct split
2 Correct 63 ms 16844 KB ok, correct split
3 Correct 22 ms 10584 KB ok, correct split
4 Correct 1 ms 6748 KB ok, correct split
5 Correct 64 ms 19732 KB ok, correct split
6 Correct 72 ms 19352 KB ok, correct split
7 Correct 83 ms 19060 KB ok, correct split
8 Correct 62 ms 20680 KB ok, correct split
9 Correct 62 ms 18888 KB ok, correct split
10 Correct 19 ms 9608 KB ok, no valid answer
11 Correct 27 ms 11132 KB ok, no valid answer
12 Correct 52 ms 16336 KB ok, no valid answer
13 Correct 58 ms 16072 KB ok, no valid answer
14 Correct 50 ms 16584 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB ok, correct split
2 Correct 1 ms 6748 KB ok, no valid answer
3 Correct 1 ms 6748 KB ok, correct split
4 Correct 1 ms 6748 KB ok, correct split
5 Correct 1 ms 6572 KB ok, correct split
6 Correct 2 ms 6744 KB ok, correct split
7 Correct 2 ms 6744 KB ok, correct split
8 Correct 2 ms 6744 KB ok, correct split
9 Correct 4 ms 7004 KB ok, correct split
10 Correct 3 ms 7056 KB ok, correct split
11 Correct 2 ms 6748 KB ok, correct split
12 Correct 3 ms 7004 KB ok, correct split
13 Correct 1 ms 6748 KB ok, correct split
14 Correct 2 ms 6748 KB ok, correct split
15 Correct 2 ms 6744 KB ok, correct split
16 Correct 2 ms 6748 KB ok, correct split
17 Correct 2 ms 6748 KB ok, correct split
18 Correct 2 ms 6744 KB ok, correct split
19 Correct 3 ms 6748 KB ok, correct split
20 Correct 2 ms 6748 KB ok, correct split
21 Correct 3 ms 7000 KB ok, correct split
22 Correct 3 ms 7004 KB ok, correct split
23 Correct 3 ms 7004 KB ok, correct split
24 Correct 3 ms 7004 KB ok, correct split
25 Correct 4 ms 7004 KB ok, correct split
26 Correct 3 ms 7004 KB ok, correct split
27 Correct 3 ms 7004 KB ok, correct split
28 Correct 4 ms 7004 KB ok, correct split
29 Correct 2 ms 6772 KB ok, correct split
30 Correct 3 ms 7004 KB ok, correct split
31 Correct 2 ms 6744 KB ok, correct split
32 Correct 2 ms 6744 KB ok, correct split
33 Correct 1 ms 6748 KB ok, correct split
34 Correct 4 ms 7004 KB ok, correct split
35 Correct 3 ms 7000 KB ok, correct split
36 Correct 3 ms 6748 KB ok, correct split
37 Correct 3 ms 7256 KB ok, correct split
38 Correct 3 ms 7004 KB ok, correct split
39 Correct 3 ms 7004 KB ok, correct split
40 Correct 3 ms 7004 KB ok, correct split
41 Correct 2 ms 6748 KB ok, correct split
42 Correct 2 ms 6748 KB ok, correct split
43 Correct 3 ms 7004 KB ok, correct split
44 Correct 3 ms 7004 KB ok, correct split
45 Correct 3 ms 7004 KB ok, correct split
46 Correct 3 ms 7000 KB ok, correct split
47 Correct 3 ms 7004 KB ok, no valid answer
48 Correct 3 ms 7004 KB ok, correct split
49 Correct 3 ms 7004 KB ok, correct split
50 Correct 2 ms 6748 KB ok, no valid answer
51 Correct 1 ms 6748 KB ok, no valid answer
52 Correct 3 ms 6744 KB ok, no valid answer
53 Correct 4 ms 7004 KB ok, no valid answer
54 Correct 2 ms 7004 KB ok, no valid answer
55 Correct 3 ms 7004 KB ok, no valid answer
56 Correct 3 ms 7036 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6748 KB ok, correct split
2 Correct 2 ms 6748 KB ok, correct split
3 Correct 3 ms 6748 KB ok, correct split
4 Correct 2 ms 6748 KB ok, correct split
5 Correct 2 ms 6744 KB ok, correct split
6 Correct 1 ms 6748 KB ok, correct split
7 Correct 72 ms 25428 KB ok, correct split
8 Correct 87 ms 22604 KB ok, correct split
9 Correct 66 ms 22012 KB ok, correct split
10 Correct 76 ms 25928 KB ok, correct split
11 Correct 71 ms 25900 KB ok, correct split
12 Correct 2 ms 6748 KB ok, correct split
13 Correct 2 ms 6748 KB ok, correct split
14 Correct 2 ms 6748 KB ok, correct split
15 Correct 79 ms 22380 KB ok, correct split
16 Correct 62 ms 16844 KB ok, correct split
17 Correct 70 ms 25700 KB ok, correct split
18 Correct 64 ms 22736 KB ok, correct split
19 Correct 83 ms 19908 KB ok, correct split
20 Correct 56 ms 16588 KB ok, correct split
21 Correct 49 ms 17356 KB ok, correct split
22 Correct 51 ms 17352 KB ok, correct split
23 Correct 45 ms 17408 KB ok, correct split
24 Correct 2 ms 6744 KB ok, correct split
25 Correct 63 ms 16844 KB ok, correct split
26 Correct 22 ms 10584 KB ok, correct split
27 Correct 1 ms 6748 KB ok, correct split
28 Correct 64 ms 19732 KB ok, correct split
29 Correct 72 ms 19352 KB ok, correct split
30 Correct 83 ms 19060 KB ok, correct split
31 Correct 62 ms 20680 KB ok, correct split
32 Correct 62 ms 18888 KB ok, correct split
33 Correct 19 ms 9608 KB ok, no valid answer
34 Correct 27 ms 11132 KB ok, no valid answer
35 Correct 52 ms 16336 KB ok, no valid answer
36 Correct 58 ms 16072 KB ok, no valid answer
37 Correct 50 ms 16584 KB ok, no valid answer
38 Correct 1 ms 6748 KB ok, correct split
39 Correct 1 ms 6748 KB ok, no valid answer
40 Correct 1 ms 6748 KB ok, correct split
41 Correct 1 ms 6748 KB ok, correct split
42 Correct 1 ms 6572 KB ok, correct split
43 Correct 2 ms 6744 KB ok, correct split
44 Correct 2 ms 6744 KB ok, correct split
45 Correct 2 ms 6744 KB ok, correct split
46 Correct 4 ms 7004 KB ok, correct split
47 Correct 3 ms 7056 KB ok, correct split
48 Correct 2 ms 6748 KB ok, correct split
49 Correct 3 ms 7004 KB ok, correct split
50 Correct 1 ms 6748 KB ok, correct split
51 Correct 2 ms 6748 KB ok, correct split
52 Correct 2 ms 6744 KB ok, correct split
53 Correct 2 ms 6748 KB ok, correct split
54 Correct 2 ms 6748 KB ok, correct split
55 Correct 2 ms 6744 KB ok, correct split
56 Correct 3 ms 6748 KB ok, correct split
57 Correct 2 ms 6748 KB ok, correct split
58 Correct 3 ms 7000 KB ok, correct split
59 Correct 3 ms 7004 KB ok, correct split
60 Correct 3 ms 7004 KB ok, correct split
61 Correct 3 ms 7004 KB ok, correct split
62 Correct 4 ms 7004 KB ok, correct split
63 Correct 3 ms 7004 KB ok, correct split
64 Correct 3 ms 7004 KB ok, correct split
65 Correct 4 ms 7004 KB ok, correct split
66 Correct 2 ms 6772 KB ok, correct split
67 Correct 3 ms 7004 KB ok, correct split
68 Correct 2 ms 6744 KB ok, correct split
69 Correct 2 ms 6744 KB ok, correct split
70 Correct 1 ms 6748 KB ok, correct split
71 Correct 4 ms 7004 KB ok, correct split
72 Correct 3 ms 7000 KB ok, correct split
73 Correct 3 ms 6748 KB ok, correct split
74 Correct 3 ms 7256 KB ok, correct split
75 Correct 3 ms 7004 KB ok, correct split
76 Correct 3 ms 7004 KB ok, correct split
77 Correct 3 ms 7004 KB ok, correct split
78 Correct 2 ms 6748 KB ok, correct split
79 Correct 2 ms 6748 KB ok, correct split
80 Correct 3 ms 7004 KB ok, correct split
81 Correct 3 ms 7004 KB ok, correct split
82 Correct 3 ms 7004 KB ok, correct split
83 Correct 3 ms 7000 KB ok, correct split
84 Correct 3 ms 7004 KB ok, no valid answer
85 Correct 3 ms 7004 KB ok, correct split
86 Correct 3 ms 7004 KB ok, correct split
87 Correct 2 ms 6748 KB ok, no valid answer
88 Correct 1 ms 6748 KB ok, no valid answer
89 Correct 3 ms 6744 KB ok, no valid answer
90 Correct 4 ms 7004 KB ok, no valid answer
91 Correct 2 ms 7004 KB ok, no valid answer
92 Correct 3 ms 7004 KB ok, no valid answer
93 Correct 3 ms 7036 KB ok, no valid answer
94 Correct 74 ms 21452 KB ok, correct split
95 Correct 129 ms 28232 KB ok, correct split
96 Correct 89 ms 26048 KB ok, correct split
97 Correct 23 ms 10968 KB ok, correct split
98 Correct 27 ms 11232 KB ok, correct split
99 Correct 42 ms 15044 KB ok, correct split
100 Correct 103 ms 22884 KB ok, correct split
101 Correct 78 ms 21288 KB ok, correct split
102 Correct 77 ms 21140 KB ok, correct split
103 Correct 68 ms 20676 KB ok, correct split
104 Correct 78 ms 23416 KB ok, correct split
105 Correct 38 ms 13552 KB ok, correct split
106 Correct 75 ms 23268 KB ok, correct split
107 Correct 65 ms 17964 KB ok, correct split
108 Correct 64 ms 18132 KB ok, correct split
109 Correct 113 ms 22976 KB ok, correct split
110 Correct 98 ms 22724 KB ok, correct split
111 Correct 87 ms 22720 KB ok, correct split
112 Correct 98 ms 22976 KB ok, correct split
113 Correct 87 ms 23020 KB ok, correct split
114 Correct 10 ms 8660 KB ok, correct split
115 Correct 9 ms 8404 KB ok, correct split
116 Correct 87 ms 22008 KB ok, correct split
117 Correct 93 ms 22064 KB ok, correct split
118 Correct 58 ms 18028 KB ok, correct split
119 Correct 56 ms 18020 KB ok, correct split
120 Correct 64 ms 22688 KB ok, correct split
121 Correct 60 ms 17356 KB ok, no valid answer
122 Correct 56 ms 17304 KB ok, no valid answer
123 Correct 104 ms 24768 KB ok, no valid answer
124 Correct 108 ms 24716 KB ok, no valid answer
125 Correct 55 ms 19032 KB ok, no valid answer
126 Correct 38 ms 16596 KB ok, no valid answer
127 Correct 70 ms 19652 KB ok, no valid answer