oj.uz

답안 #1071840

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1071840 2024-08-23T11:47:48 Z Faisal_Saqib 자동 인형 (IOI18_doll) C++17
37 / 100
 100 ms 26404 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)
	{
		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]);
		}
		*/
	}
	for(int j=1;j<=m;j++)
		ans[j]=-1;
	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:97:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |   for(int j=0;j<a.size();j++)
      |               ~^~~~~~~~~
doll.cpp:102:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |   for(int j=1;j<cur.size();j++)
      |               ~^~~~~~~~~~~
doll.cpp:115:25: 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:17: 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:172:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  172 |    for(int i=0;i<order_.size();i++)
      |                ~^~~~~~~~~~~~~~
doll.cpp:177:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  177 |    for(int i=0;i<order_.size();i++)
      |                ~^~~~~~~~~~~~~~
doll.cpp:104:6: warning: unused variable 'lps' [-Wunused-variable]
  104 |  int lps=0;
      |      ^~~
doll.cpp:237:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  237 |   for(int j=0;j<a.size();j++)
      |               ~^~~~~~~~~
doll.cpp:240:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  240 |   for(int j=1;j<cur.size();j++)
      |               ~^~~~~~~~~~~
doll.cpp:253:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  253 |     while(child[i].size()>pw)
      |           ~~~~~~~~~~~~~~~^~~
doll.cpp:261:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  261 |     for(int j=0;j<child[i].size();j++)
      |                 ~^~~~~~~~~~~~~~~~
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:315:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  315 |     for(int i=0;i<order_.size();i++)
      |                 ~^~~~~~~~~~~~~~
doll.cpp:242:7: warning: unused variable 'lps' [-Wunused-variable]
  242 |   int lps=0;
      |       ^~~

Subtask #1
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 2396 KB wrong motion
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 2396 KB wrong motion
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 2396 KB wrong motion
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 2396 KB wrong motion
2 Halted 0 ms 0 KB -

Subtask #5
9.0000000036 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 2396 KB Output is partially correct
2 Correct 33 ms 16272 KB Output is correct
3 Partially correct 52 ms 22048 KB Output is partially correct
4 Partially correct 59 ms 22780 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 2396 KB Output is partially correct
2 Correct 33 ms 16272 KB Output is correct
3 Partially correct 52 ms 22048 KB Output is partially correct
4 Partially correct 59 ms 22780 KB Output is partially correct
5 Partially correct 82 ms 16716 KB Output is partially correct
6 Partially correct 85 ms 17532 KB Output is partially correct
7 Partially correct 100 ms 17432 KB Output is partially correct
8 Partially correct 99 ms 17780 KB Output is partially correct
9 Partially correct 56 ms 20296 KB Output is partially correct
10 Partially correct 80 ms 26404 KB Output is partially correct
11 Partially correct 96 ms 19728 KB Output is partially correct
12 Partially correct 60 ms 13180 KB Output is partially correct
13 Partially correct 55 ms 12104 KB Output is partially correct
14 Partially correct 57 ms 11960 KB Output is partially correct
15 Partially correct 57 ms 11688 KB Output is partially correct
16 Partially correct 2 ms 2648 KB Output is partially correct
17 Partially correct 39 ms 10748 KB Output is partially correct
18 Partially correct 43 ms 11400 KB Output is partially correct
19 Partially correct 42 ms 11216 KB Output is partially correct
20 Partially correct 58 ms 14156 KB Output is partially correct
21 Partially correct 65 ms 17748 KB Output is partially correct
22 Partially correct 60 ms 13368 KB Output is partially correct