oj.uz

Submission #959472

# Submission time Handle Problem Language Result Execution time Memory
959472 2024-04-08T09:29:03 Z NemanjaSo2005 Split the Attractions (IOI19_split) C++17
40 / 100
 92 ms 24372 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;
bool prosli[maxn],blok[maxn];
vector<int> graf[maxn],stablo[maxn],A,B,C,V,res;
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);
      }
}
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;
   //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;
      int v=collect(p,gde,kol);
      kol-=v;
      ret+=v;
      if(kol==0)
         return ret;
   }
   return ret;
}
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++)
      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);
/*
	cout<<"STABLO"<<endl;
	for(int i=1;i<=N;i++){
      cout<<i<<": ";
      for(int x:stablo[i])
         cout<<x<<" ";
      cout<<endl;
	}*/

	dfs1(1,1);
	cent=findcentr(1,1);
	dfs1(cent,cent);
	int koji=-1;
	for(int x:stablo[cent])
      if(siz[x]>=a)
         koji=x;

   if(koji!=-1){
      blok[cent]=true;
      collect(koji,koji,a);
      A=V;
      V.clear();
      blok[cent]=false;
      blok[koji]=true;
      collect(cent,cent,b);
      B=V;

      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);

     /* cout<<"ABC"<<endl;
      for(int x:A)
         cout<<x<<" ";
      cout<<endl;
      for(int x:B)
         cout<<x<<" ";
      cout<<endl;
      for(int x:C)
         cout<<x<<" ";
      cout<<endl;
*/
      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:61:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |  for(int i=0;i<p.size();i++){
      |              ~^~~~~~~~~
split.cpp:126:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  126 |       if(aa==B.size())
      |          ~~^~~~~~~~~~
split.cpp:128:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |       if(aa==C.size())
      |          ~~^~~~~~~~~~
split.cpp:130:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  130 |       if(bb==C.size())
      |          ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB ok, correct split
2 Correct 2 ms 4956 KB ok, correct split
3 Correct 6 ms 4956 KB ok, correct split
4 Correct 2 ms 4956 KB ok, correct split
5 Correct 3 ms 4956 KB ok, correct split
6 Correct 1 ms 4956 KB ok, correct split
7 Correct 63 ms 23884 KB ok, correct split
8 Correct 61 ms 21316 KB ok, correct split
9 Correct 61 ms 20936 KB ok, correct split
10 Correct 77 ms 24112 KB ok, correct split
11 Correct 64 ms 24372 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB ok, correct split
2 Correct 1 ms 4956 KB ok, correct split
3 Correct 1 ms 4956 KB ok, correct split
4 Correct 75 ms 21528 KB ok, correct split
5 Correct 56 ms 16844 KB ok, correct split
6 Correct 67 ms 23884 KB ok, correct split
7 Correct 60 ms 21452 KB ok, correct split
8 Correct 92 ms 19480 KB ok, correct split
9 Correct 61 ms 16668 KB ok, correct split
10 Correct 56 ms 17036 KB ok, correct split
11 Correct 47 ms 16852 KB ok, correct split
12 Correct 52 ms 17352 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB ok, correct split
2 Correct 55 ms 16564 KB ok, correct split
3 Correct 21 ms 9812 KB ok, correct split
4 Correct 2 ms 4956 KB ok, correct split
5 Correct 59 ms 19084 KB ok, correct split
6 Correct 65 ms 18888 KB ok, correct split
7 Correct 57 ms 18892 KB ok, correct split
8 Correct 65 ms 19912 KB ok, correct split
9 Correct 63 ms 18888 KB ok, correct split
10 Correct 18 ms 8664 KB ok, no valid answer
11 Correct 25 ms 10456 KB ok, no valid answer
12 Correct 48 ms 16136 KB ok, no valid answer
13 Correct 57 ms 15848 KB ok, no valid answer
14 Correct 49 ms 16528 KB ok, no valid answer

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB ok, correct split
2 Correct 2 ms 4956 KB ok, no valid answer
3 Correct 2 ms 4956 KB ok, correct split
4 Correct 1 ms 4952 KB ok, correct split
5 Correct 1 ms 4952 KB ok, correct split
6 Correct 1 ms 4956 KB ok, correct split
7 Correct 2 ms 5208 KB ok, correct split
8 Correct 2 ms 4956 KB ok, correct split
9 Correct 3 ms 5468 KB ok, correct split
10 Correct 5 ms 5472 KB ok, correct split
11 Correct 2 ms 4956 KB ok, correct split
12 Correct 3 ms 5468 KB ok, correct split
13 Correct 1 ms 4956 KB ok, correct split
14 Correct 2 ms 4956 KB ok, correct split
15 Correct 1 ms 4956 KB ok, correct split
16 Correct 1 ms 4956 KB ok, correct split
17 Correct 1 ms 5136 KB ok, correct split
18 Correct 1 ms 4956 KB ok, correct split
19 Correct 2 ms 4956 KB ok, correct split
20 Correct 2 ms 5212 KB ok, correct split
21 Correct 2 ms 5468 KB ok, correct split
22 Correct 4 ms 5468 KB ok, correct split
23 Correct 3 ms 5468 KB ok, correct split
24 Correct 3 ms 5468 KB ok, correct split
25 Correct 3 ms 5468 KB ok, correct split
26 Incorrect 3 ms 5472 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 2 ms 4956 KB ok, correct split
2 Correct 2 ms 4956 KB ok, correct split
3 Correct 6 ms 4956 KB ok, correct split
4 Correct 2 ms 4956 KB ok, correct split
5 Correct 3 ms 4956 KB ok, correct split
6 Correct 1 ms 4956 KB ok, correct split
7 Correct 63 ms 23884 KB ok, correct split
8 Correct 61 ms 21316 KB ok, correct split
9 Correct 61 ms 20936 KB ok, correct split
10 Correct 77 ms 24112 KB ok, correct split
11 Correct 64 ms 24372 KB ok, correct split
12 Correct 2 ms 4956 KB ok, correct split
13 Correct 1 ms 4956 KB ok, correct split
14 Correct 1 ms 4956 KB ok, correct split
15 Correct 75 ms 21528 KB ok, correct split
16 Correct 56 ms 16844 KB ok, correct split
17 Correct 67 ms 23884 KB ok, correct split
18 Correct 60 ms 21452 KB ok, correct split
19 Correct 92 ms 19480 KB ok, correct split
20 Correct 61 ms 16668 KB ok, correct split
21 Correct 56 ms 17036 KB ok, correct split
22 Correct 47 ms 16852 KB ok, correct split
23 Correct 52 ms 17352 KB ok, correct split
24 Correct 2 ms 4952 KB ok, correct split
25 Correct 55 ms 16564 KB ok, correct split
26 Correct 21 ms 9812 KB ok, correct split
27 Correct 2 ms 4956 KB ok, correct split
28 Correct 59 ms 19084 KB ok, correct split
29 Correct 65 ms 18888 KB ok, correct split
30 Correct 57 ms 18892 KB ok, correct split
31 Correct 65 ms 19912 KB ok, correct split
32 Correct 63 ms 18888 KB ok, correct split
33 Correct 18 ms 8664 KB ok, no valid answer
34 Correct 25 ms 10456 KB ok, no valid answer
35 Correct 48 ms 16136 KB ok, no valid answer
36 Correct 57 ms 15848 KB ok, no valid answer
37 Correct 49 ms 16528 KB ok, no valid answer
38 Correct 1 ms 4956 KB ok, correct split
39 Correct 2 ms 4956 KB ok, no valid answer
40 Correct 2 ms 4956 KB ok, correct split
41 Correct 1 ms 4952 KB ok, correct split
42 Correct 1 ms 4952 KB ok, correct split
43 Correct 1 ms 4956 KB ok, correct split
44 Correct 2 ms 5208 KB ok, correct split
45 Correct 2 ms 4956 KB ok, correct split
46 Correct 3 ms 5468 KB ok, correct split
47 Correct 5 ms 5472 KB ok, correct split
48 Correct 2 ms 4956 KB ok, correct split
49 Correct 3 ms 5468 KB ok, correct split
50 Correct 1 ms 4956 KB ok, correct split
51 Correct 2 ms 4956 KB ok, correct split
52 Correct 1 ms 4956 KB ok, correct split
53 Correct 1 ms 4956 KB ok, correct split
54 Correct 1 ms 5136 KB ok, correct split
55 Correct 1 ms 4956 KB ok, correct split
56 Correct 2 ms 4956 KB ok, correct split
57 Correct 2 ms 5212 KB ok, correct split
58 Correct 2 ms 5468 KB ok, correct split
59 Correct 4 ms 5468 KB ok, correct split
60 Correct 3 ms 5468 KB ok, correct split
61 Correct 3 ms 5468 KB ok, correct split
62 Correct 3 ms 5468 KB ok, correct split
63 Incorrect 3 ms 5472 KB jury found a solution, contestant did not
64 Halted 0 ms 0 KB -