oj.uz

Submission #1071894

# Submission time Handle Problem Language Result Execution time Memory
1071894 2024-08-23T12:11:45 Z Faisal_Saqib Mechanical Doll (IOI18_doll) C++17
63 / 100
 101 ms 25100 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define vll vector<int>
#define ll int
void answer(std::vector<int> C, std::vector<int> X, std::vector<int> Y);
vector<int> XP,YP;
const int NM=1e6+10;
ll cp[NM],final[NM],label=0,father_of_all=-1;
vll fast_order(ll n)
{
    if(n==2)
        return {1,2};
    vll ans;
    ll hn=n/2;
    for(int i=1;i<=n;i+=2)
        ans.pb(i);
    vll hans(hn);
    vll np=fast_order(n/2);
    for(int j=0;j<hn;j++)
        hans[np[j]-1]=ans[j];
    ans.clear();
    for(auto i:hans)
        ans.pb(i);
    for(auto i:hans)
        ans.pb(i+1);
    return ans;
}
vll childx,childy,order_,npp;
int label_it(vll&p,int l,int r,bool lp=0)
{
	// cout<<"Range "<<l<<' '<<r<<' '<<" p: ";
	// for(int i=l;i<=r;i++)
	// {
	// 	cout<<p[i]<<' ';
	// }
	// cout<<endl;
	if((l-r)==0){
		// cout<<"Assigned ";
		if(p[l]==-NM)
		{
			// cout<<father_of_all<<endl;
			return father_of_all;
		}
		// cout<<p[l]<<endl;
		return p[l];
	}
	int mid=(l+r)/2;
	bool use=0;
	for(int i=l;i<=r;i++)
	{
		if(p[i]!=-NM)
		{
			use=1;
			break;
		}
	}
	label++;
	int usep=-label;
	int fk=-1;
	if(!use)
	{
		// all minus one is subtree
		// cout<<"Range "<<l<<' '<<r<<endl;
		// cout<<"Child: "<<father_of_all<<' '<<father_of_all<<endl;
		fk=childx.size();
		childx.pb(father_of_all);
		childy.pb(father_of_all);
	}
	else
	{
		int lc=label_it(p,l,mid,1);
		int rc=label_it(p,mid+1,r,1);
		fk=childx.size();
		childx.pb(lc);
		childy.pb(rc);
		// cout<<"Range "<<l<<' '<<r<<endl;
		// cout<<"Child: "<<XP.back()<<' '<<YP.back()<<endl;
	}
	// cout<<"Assigned to range "<<l<<' '<<r<<' ';
	// cout<<usep<<endl;
	order_.pb(fk);
	npp.pb(usep);
	return usep;
}
void create_circuit(int m, std::vector<int> a)
{
	XP.clear();
	YP.clear();
	label=0;
	vector<int> ans(m+1);
	vector<int> child[m+2];
	vector<int> cur;
	if(a.size()==16)
	{
		int v=a[0];
		child[0].push_back(v);
		for(int j=1;j<a.size();j++)
			child[v].push_back(a[j]);
		child[v].push_back(0);
		int lps=0;
		for(int j=0;j<=m;j++)
			ans[j]=-1;
		// cout<<"SZ: "<<child[v].size()<<endl;
		for(auto i:{0,v})
		{
			if(child[i].size()==0)continue;
			if(child[i].size()==1)
			{
				ans[i]=child[i][0];
			}
			else
			{
				ll pw=1;
				while(child[i].size()>pw)
					pw*=2;
				int zxp=child[i].size(),cpp=0;
				for(int j=zxp;j<pw;j++)
				{
					cp[cpp]=-NM;
					cpp++;
				}
				for(int j=0;j<child[i].size();j++)
				{
					cp[cpp]=child[i][j];
					cpp++;
				}
				vll order=fast_order(pw);
				vll fl(pw);
				for(int j=0;j<pw;j++)
				{
					order[j]--;
					fl[order[j]]=cp[j];
					final[order[j]]=cp[j];
				}
				// cout<<"final: ";
				// for(int j=0;j<pw;j++)
				// 	cout<<final[j]<<' ';
				// cout<<endl;
				// what switches?
				ll og=label;
				father_of_all=-label-1;
				// pw then
				// cout<<"Father "<<father_of_all<<endl;
				// cout<<"Do label\n";
				childx.clear();
				childy.clear();
				order_.clear();
				npp.clear();
				label_it(fl,0,pw-1);
				// cout<<"Order: ";
				// for(auto i:order_)
				// 	cout<<i<<' ';
				// cout<<endl;
				// cout<<"npp: ";
				// for(auto i:npp)
				// 	cout<<i<<' ';
				// cout<<endl;
				ll last=XP.size();
				for(int i=0;i<order_.size();i++)
				{
					XP.pb(0);
					YP.pb(0);
				}
				for(int i=0;i<order_.size();i++)
				{
					ll cur=-og-npp[i]-1;
					XP[last+cur]=(childx[i]);
					YP[last+cur]=(childy[i]);
				}
				ans[i]=father_of_all;
			}
			/*
			else if(child[i].size()==2) // solve atmost 2
			{
				// We need
				s++;
				ans[i]=-s;
				x.pb(child[i][0]);
				y.pb(child[i][1]);
			}
			else if(child[i].size()==3)
			{
				int s1=s+1;
				int s2=s+2;
				int s3=s+3;
				s+=3;
				ans[i]=-s1;
				// s1
					x.pb(-s2);
					y.pb(-s3);
				//s2
					x.pb(-s1);
					y.pb(child[i][1]);
				//s3
					x.pb(child[i][0]);
					y.pb(child[i][2]);
			}
			else if(child[i].size()==4)
			{
				int s1=s+1;
				int s2=s+2;
				int s3=s+3;
				s+=3;
				ans[i]=-s1;
				// s1
					x.pb(-s2);
					y.pb(-s3);
				//s2
					x.pb(child[i][0]);
					y.pb(child[i][2]);
				//s3
					x.pb(child[i][1]);
					y.pb(child[i][3]);
			}
			*/
		}

		// ans[cur.back()]=0;
		// cout<<"Ans: ";
		// for(int i=0;i<=m;i++)cout<<ans[i]<<' ';
		// cout<<endl;
		// for(int j=0;j<label;j++)
		// {
		// 	cout<<"Child of "<<-j-1<<' '<<XP[j]<<' '<<YP[j]<<endl;
		// }
		answer(ans,XP,YP);
	}
	else
	{
		cur.pb(0);
		for(int j=0;j<a.size();j++)
			cur.pb(a[j]);
		cur.pb(0);
		for(int j=1;j<cur.size();j++)
			child[cur[j-1]].push_back(cur[j]);
		int lps=0;
		for(int i=0;i<=m;i++)
		{
			if(child[i].size()==0)continue;
			if(child[i].size()==1)
			{
				ans[i]=child[i][0];
			}
			else
			{
				ll pw=1;
				while(child[i].size()>pw)
					pw*=2;
				int zxp=child[i].size(),cpp=0;
				for(int j=zxp;j<pw;j++)
				{
					cp[cpp]=-NM;
					cpp++;
				}
				for(int j=0;j<child[i].size();j++)
				{
					cp[cpp]=child[i][j];
					cpp++;
				}
				vll order=fast_order(pw);
				vll fl(pw);
				for(int j=0;j<pw;j++)
				{
					order[j]--;
					fl[order[j]]=cp[j];
					final[order[j]]=cp[j];
				}
				// cout<<"final: ";
				// for(int j=0;j<pw;j++)
				// 	cout<<final[j]<<' ';
				// cout<<endl;
				// what switches?
				ll og=label;
				father_of_all=-label-1;
				// pw then
				// cout<<"Father "<<father_of_all<<endl;
				// cout<<"Do label\n";
				childx.clear();
				childy.clear();
				order_.clear();
				npp.clear();
				label_it(fl,0,pw-1);
				// cout<<"X: ";
				// for(auto i:childx)
				// {
				// 	cout<<i<<' ';
				// }
				// cout<<endl;
				// cout<<"Y: ";
				// for(auto i:childy)
				// {
				// 	cout<<i<<' ';
				// }
				// cout<<endl;
				// cout<<"Order: ";
				// for(auto i:order_)
				// 	cout<<i<<' ';
				// cout<<endl;
				// cout<<"npp: ";
				// for(auto i:npp)
				// 	cout<<i<<' ';
				// cout<<endl;
				ll last=XP.size();
				for(int i=0;i<order_.size();i++)
				{
					XP.pb(0);
					YP.pb(0);
				}
				for(int i=0;i<order_.size();i++)
				{
					ll cur=-og-npp[i]-1;
					XP[last+cur]=(childx[i]);
					YP[last+cur]=(childy[i]);
				}
				ans[i]=father_of_all;
			}
			/*
			else if(child[i].size()==2) // solve atmost 2
			{
				// We need
				s++;
				ans[i]=-s;
				x.pb(child[i][0]);
				y.pb(child[i][1]);
			}
			else if(child[i].size()==3)
			{
				int s1=s+1;
				int s2=s+2;
				int s3=s+3;
				s+=3;
				ans[i]=-s1;
				// s1
					x.pb(-s2);
					y.pb(-s3);
				//s2
					x.pb(-s1);
					y.pb(child[i][1]);
				//s3
					x.pb(child[i][0]);
					y.pb(child[i][2]);
			}
			else if(child[i].size()==4)
			{
				int s1=s+1;
				int s2=s+2;
				int s3=s+3;
				s+=3;
				ans[i]=-s1;
				// s1
					x.pb(-s2);
					y.pb(-s3);
				//s2
					x.pb(child[i][0]);
					y.pb(child[i][2]);
				//s3
					x.pb(child[i][1]);
					y.pb(child[i][3]);
			}
			*/
		}
		// cout<<"ans\n";
		// for(int i=0;i<=m;i++)
		// {
		// 	cout<<ans[i]<<' ';
		// }
		// cout<<endl;
		// cout<<"xy\n";
		// cout<<XP.size()<<endl;
		// cout<<YP.size()<<endl;
		// for(auto i:XP)
		// {
		// 	cout<<i<<' ';
		// }
		// cout<<endl;
		// for(auto i:YP)
		// {
		// 	cout<<i<<' ';
		// }
		// cout<<endl;
		// for(int i=0;i<label;i++)
		// {
		// 	cout<<XP[i]<<' '<<YP[i]<<endl;
		// }
		answer(ans,XP,YP);
	}
}

Compilation message

doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:98:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |   for(int j=1;j<a.size();j++)
      |               ~^~~~~~~~~
doll.cpp:115:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  115 |     while(child[i].size()>pw)
      |           ~~~~~~~~~~~~~~~^~~
doll.cpp:123:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |     for(int j=0;j<child[i].size();j++)
      |                 ~^~~~~~~~~~~~~~~~
doll.cpp:160:18: 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<order_.size();i++)
      |                 ~^~~~~~~~~~~~~~
doll.cpp:165:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  165 |     for(int i=0;i<order_.size();i++)
      |                 ~^~~~~~~~~~~~~~
doll.cpp:101:7: warning: unused variable 'lps' [-Wunused-variable]
  101 |   int lps=0;
      |       ^~~
doll.cpp:232:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  232 |   for(int j=0;j<a.size();j++)
      |               ~^~~~~~~~~
doll.cpp:235:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  235 |   for(int j=1;j<cur.size();j++)
      |               ~^~~~~~~~~~~
doll.cpp:248:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  248 |     while(child[i].size()>pw)
      |           ~~~~~~~~~~~~~~~^~~
doll.cpp:256:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  256 |     for(int j=0;j<child[i].size();j++)
      |                 ~^~~~~~~~~~~~~~~~
doll.cpp:305:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  305 |     for(int i=0;i<order_.size();i++)
      |                 ~^~~~~~~~~~~~~~
doll.cpp:310:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  310 |     for(int i=0;i<order_.size();i++)
      |                 ~^~~~~~~~~~~~~~
doll.cpp:237:7: warning: unused variable 'lps' [-Wunused-variable]
  237 |   int lps=0;
      |       ^~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 18 ms 7240 KB Output is correct
3 Correct 19 ms 5804 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 7 ms 5980 KB Output is correct
6 Correct 22 ms 8916 KB Output is correct
7 Correct 1 ms 348 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 18 ms 7240 KB Output is correct
3 Correct 19 ms 5804 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 7 ms 5980 KB Output is correct
6 Correct 22 ms 8916 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 58 ms 10756 KB Output is correct
9 Correct 37 ms 12044 KB Output is correct
10 Correct 51 ms 15648 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 18 ms 7240 KB Output is correct
3 Correct 19 ms 5804 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 7 ms 5980 KB Output is correct
6 Correct 22 ms 8916 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 58 ms 10756 KB Output is correct
9 Correct 37 ms 12044 KB Output is correct
10 Correct 51 ms 15648 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 68 ms 15340 KB Output is correct
15 Correct 34 ms 9792 KB Output is correct
16 Correct 53 ms 13048 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 89 ms 15092 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct

Subtask #5
9.0000000036 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 2396 KB Output is partially correct
2 Correct 29 ms 15368 KB Output is correct
3 Partially correct 87 ms 21168 KB Output is partially correct
4 Partially correct 54 ms 21272 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 2396 KB Output is partially correct
2 Correct 29 ms 15368 KB Output is correct
3 Partially correct 87 ms 21168 KB Output is partially correct
4 Partially correct 54 ms 21272 KB Output is partially correct
5 Partially correct 76 ms 15248 KB Output is partially correct
6 Partially correct 99 ms 16016 KB Output is partially correct
7 Partially correct 71 ms 15892 KB Output is partially correct
8 Partially correct 101 ms 16344 KB Output is partially correct
9 Partially correct 51 ms 19352 KB Output is partially correct
10 Partially correct 76 ms 25100 KB Output is partially correct
11 Partially correct 71 ms 18288 KB Output is partially correct
12 Partially correct 56 ms 12372 KB Output is partially correct
13 Partially correct 53 ms 11320 KB Output is partially correct
14 Partially correct 46 ms 10980 KB Output is partially correct
15 Partially correct 48 ms 10776 KB Output is partially correct
16 Partially correct 3 ms 2648 KB Output is partially correct
17 Partially correct 72 ms 9724 KB Output is partially correct
18 Partially correct 38 ms 10664 KB Output is partially correct
19 Partially correct 38 ms 10304 KB Output is partially correct
20 Partially correct 69 ms 12524 KB Output is partially correct
21 Partially correct 72 ms 16212 KB Output is partially correct
22 Partially correct 56 ms 12100 KB Output is partially correct