oj.uz

Submission #959480

# Submission time Handle Problem Language Result Execution time Memory
959480 2024-04-08T09:38:35 Z NemanjaSo2005 Split the Attractions (IOI19_split) C++17
40 / 100
 1863 ms 23604 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;
mt19937_64 rng;
int perm[maxn];
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;
}
void reset(){
   for(int i=1;i<=N;i++){
      siz[i]=0;
      prosli[i]=false;
      blok[i]=false;
      stablo[i].clear();
   }
   A.clear();
   B.clear();
   C.clear();
   V.clear();
}
vector<int> find_split(int n, int aa, int bb, int cc, vector<int> p, vector<int> q) {
   rng.seed(1525);
	N=n;
	for(int i=1;i<=N;i++)
      perm[i]=i;
   for(int i=2;i<=N;i++)
      swap(perm[i],perm[rng()%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);

   int maxit=N;
   if(N>2500)
      maxit=200;

   for(int it=1;it<=maxit;it++){
      int x=perm[it];
      //cout<<x<<endl;

      reset();

      maketree(x);
      dfs1(x,x);
      cent=findcentr(x,x);
      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);
         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:82:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |  for(int i=0;i<p.size();i++){
      |              ~^~~~~~~~~
split.cpp:136:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  136 |          if(aa==B.size())
      |             ~~^~~~~~~~~~
split.cpp:138:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  138 |          if(aa==C.size())
      |             ~~^~~~~~~~~~
split.cpp:140:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  140 |          if(bb==C.size())
      |             ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5208 KB ok, correct split
2 Correct 1 ms 5212 KB ok, correct split
3 Correct 2 ms 5300 KB ok, correct split
4 Correct 1 ms 5212 KB ok, correct split
5 Correct 2 ms 5348 KB ok, correct split
6 Correct 2 ms 5212 KB ok, correct split
7 Correct 63 ms 19912 KB ok, correct split
8 Correct 65 ms 22976 KB ok, correct split
9 Correct 78 ms 20684 KB ok, correct split
10 Correct 70 ms 23456 KB ok, correct split
11 Correct 66 ms 23604 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5208 KB ok, correct split
2 Correct 1 ms 5208 KB ok, correct split
3 Correct 1 ms 5212 KB ok, correct split
4 Correct 88 ms 20200 KB ok, correct split
5 Correct 59 ms 16072 KB ok, correct split
6 Correct 65 ms 23368 KB ok, correct split
7 Correct 89 ms 21708 KB ok, correct split
8 Correct 80 ms 17760 KB ok, correct split
9 Correct 59 ms 16044 KB ok, correct split
10 Correct 54 ms 16584 KB ok, correct split
11 Correct 59 ms 16772 KB ok, correct split
12 Correct 45 ms 16584 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5208 KB ok, correct split
2 Correct 65 ms 16060 KB ok, correct split
3 Correct 22 ms 9684 KB ok, correct split
4 Correct 2 ms 5208 KB ok, correct split
5 Correct 65 ms 19144 KB ok, correct split
6 Correct 66 ms 19144 KB ok, correct split
7 Correct 77 ms 18124 KB ok, correct split
8 Correct 63 ms 18168 KB ok, correct split
9 Correct 73 ms 19124 KB ok, correct split
10 Correct 464 ms 8636 KB ok, no valid answer
11 Correct 681 ms 10248 KB ok, no valid answer
12 Correct 1206 ms 15532 KB ok, no valid answer
13 Correct 1863 ms 15260 KB ok, no valid answer
14 Correct 713 ms 15760 KB ok, no valid answer

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5212 KB ok, correct split
2 Correct 1 ms 5212 KB ok, no valid answer
3 Correct 1 ms 5212 KB ok, correct split
4 Correct 1 ms 5212 KB ok, correct split
5 Correct 1 ms 5212 KB ok, correct split
6 Correct 1 ms 5300 KB ok, correct split
7 Correct 2 ms 5212 KB ok, correct split
8 Correct 2 ms 5212 KB ok, correct split
9 Correct 3 ms 5720 KB ok, correct split
10 Correct 3 ms 5464 KB ok, correct split
11 Correct 2 ms 5212 KB ok, correct split
12 Correct 3 ms 5468 KB ok, correct split
13 Correct 2 ms 5212 KB ok, correct split
14 Correct 1 ms 5212 KB ok, correct split
15 Correct 2 ms 5224 KB ok, correct split
16 Correct 1 ms 5212 KB ok, correct split
17 Correct 2 ms 5148 KB ok, correct split
18 Correct 2 ms 5212 KB ok, correct split
19 Correct 2 ms 5212 KB ok, correct split
20 Correct 2 ms 5468 KB ok, correct split
21 Correct 3 ms 5468 KB ok, correct split
22 Correct 3 ms 5464 KB ok, correct split
23 Correct 3 ms 5468 KB ok, correct split
24 Correct 3 ms 5724 KB ok, correct split
25 Correct 3 ms 5468 KB ok, correct split
26 Incorrect 123 ms 5700 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 5208 KB ok, correct split
2 Correct 1 ms 5212 KB ok, correct split
3 Correct 2 ms 5300 KB ok, correct split
4 Correct 1 ms 5212 KB ok, correct split
5 Correct 2 ms 5348 KB ok, correct split
6 Correct 2 ms 5212 KB ok, correct split
7 Correct 63 ms 19912 KB ok, correct split
8 Correct 65 ms 22976 KB ok, correct split
9 Correct 78 ms 20684 KB ok, correct split
10 Correct 70 ms 23456 KB ok, correct split
11 Correct 66 ms 23604 KB ok, correct split
12 Correct 2 ms 5208 KB ok, correct split
13 Correct 1 ms 5208 KB ok, correct split
14 Correct 1 ms 5212 KB ok, correct split
15 Correct 88 ms 20200 KB ok, correct split
16 Correct 59 ms 16072 KB ok, correct split
17 Correct 65 ms 23368 KB ok, correct split
18 Correct 89 ms 21708 KB ok, correct split
19 Correct 80 ms 17760 KB ok, correct split
20 Correct 59 ms 16044 KB ok, correct split
21 Correct 54 ms 16584 KB ok, correct split
22 Correct 59 ms 16772 KB ok, correct split
23 Correct 45 ms 16584 KB ok, correct split
24 Correct 1 ms 5208 KB ok, correct split
25 Correct 65 ms 16060 KB ok, correct split
26 Correct 22 ms 9684 KB ok, correct split
27 Correct 2 ms 5208 KB ok, correct split
28 Correct 65 ms 19144 KB ok, correct split
29 Correct 66 ms 19144 KB ok, correct split
30 Correct 77 ms 18124 KB ok, correct split
31 Correct 63 ms 18168 KB ok, correct split
32 Correct 73 ms 19124 KB ok, correct split
33 Correct 464 ms 8636 KB ok, no valid answer
34 Correct 681 ms 10248 KB ok, no valid answer
35 Correct 1206 ms 15532 KB ok, no valid answer
36 Correct 1863 ms 15260 KB ok, no valid answer
37 Correct 713 ms 15760 KB ok, no valid answer
38 Correct 1 ms 5212 KB ok, correct split
39 Correct 1 ms 5212 KB ok, no valid answer
40 Correct 1 ms 5212 KB ok, correct split
41 Correct 1 ms 5212 KB ok, correct split
42 Correct 1 ms 5212 KB ok, correct split
43 Correct 1 ms 5300 KB ok, correct split
44 Correct 2 ms 5212 KB ok, correct split
45 Correct 2 ms 5212 KB ok, correct split
46 Correct 3 ms 5720 KB ok, correct split
47 Correct 3 ms 5464 KB ok, correct split
48 Correct 2 ms 5212 KB ok, correct split
49 Correct 3 ms 5468 KB ok, correct split
50 Correct 2 ms 5212 KB ok, correct split
51 Correct 1 ms 5212 KB ok, correct split
52 Correct 2 ms 5224 KB ok, correct split
53 Correct 1 ms 5212 KB ok, correct split
54 Correct 2 ms 5148 KB ok, correct split
55 Correct 2 ms 5212 KB ok, correct split
56 Correct 2 ms 5212 KB ok, correct split
57 Correct 2 ms 5468 KB ok, correct split
58 Correct 3 ms 5468 KB ok, correct split
59 Correct 3 ms 5464 KB ok, correct split
60 Correct 3 ms 5468 KB ok, correct split
61 Correct 3 ms 5724 KB ok, correct split
62 Correct 3 ms 5468 KB ok, correct split
63 Incorrect 123 ms 5700 KB jury found a solution, contestant did not
64 Halted 0 ms 0 KB -