oj.uz

답안 #1068584

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1068584 2024-08-21T10:46:59 Z Faisal_Saqib 자동 인형 (IOI18_doll) C++17
53 / 100
 86 ms 22728 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;
}
void label_it(vll p)
{
	if(p.size()==1)return;
	vll np;
	for(int i=0;i<p.size();i+=2)
	{
		label++;
		np.pb(-label);
		if(p[i]==-NM)// problem
			p[i]=father_of_all;
		if(p[i+1]==-NM)
			p[i+1]=father_of_all;
		XP.pb(p[i]);
		YP.pb(p[i+1]);
	}
	label_it(np);
}
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;
	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;
			// ll cnt_minus=pw-(ll)child[i].size();
			// for(int j=0,k=0;j<pw;)
			// {
			// 	if(cnt_minus>0)
			// 	{
			// 		cp[j]=-NM;
			// 		cp[j+1]=child[i][k];
			// 		k++;
			// 		j+=2;
			// 		cnt_minus--;
			// 	}
			// 	else
			// 	{
			// 		cp[j]=child[i][k];
			// 		k++;
			// 		j++;
			// 	}
			// }
			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?
			father_of_all=-label-pw+1;
			// pw then
			label_it(fl);
			// cout<<"AT "<<i<<' '<<label<<endl;;
			ans[i]=-label;
		}
		/*
		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";
	// for(int i=0;i<label;i++)
	// {
	// 	cout<<XP[i]<<' '<<YP[i]<<endl;
	// }
	answer(ans,XP,YP);
}

Compilation message

doll.cpp: In function 'void label_it(std::vector<int>)':
doll.cpp:33:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |  for(int i=0;i<p.size();i+=2)
      |              ~^~~~~~~~~
doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:55:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |  for(int j=0;j<a.size();j++)
      |              ~^~~~~~~~~
doll.cpp:58:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |  for(int j=1;j<cur.size();j++)
      |              ~^~~~~~~~~~~
doll.cpp:71:25: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   71 |    while(child[i].size()>pw)
      |          ~~~~~~~~~~~~~~~^~~
doll.cpp:97:17: 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<child[i].size();j++)
      |                ~^~~~~~~~~~~~~~~~
doll.cpp:60:6: warning: unused variable 'lps' [-Wunused-variable]
   60 |  int lps=0;
      |      ^~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 20 ms 7140 KB Output is correct
3 Correct 15 ms 5840 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 7 ms 3932 KB Output is correct
6 Correct 22 ms 8916 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 20 ms 7140 KB Output is correct
3 Correct 15 ms 5840 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 7 ms 3932 KB Output is correct
6 Correct 22 ms 8916 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 34 ms 10800 KB Output is correct
9 Correct 39 ms 12232 KB Output is correct
10 Correct 62 ms 15648 KB Output is correct
11 Correct 0 ms 2396 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 20 ms 7140 KB Output is correct
3 Correct 15 ms 5840 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 7 ms 3932 KB Output is correct
6 Correct 22 ms 8916 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 34 ms 10800 KB Output is correct
9 Correct 39 ms 12232 KB Output is correct
10 Correct 62 ms 15648 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 64 ms 15316 KB Output is correct
15 Correct 43 ms 10044 KB Output is correct
16 Correct 52 ms 13040 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 63 ms 15064 KB Output is correct
21 Correct 1 ms 2648 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
9.0000000036 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 2392 KB Output is partially correct
2 Correct 25 ms 13224 KB Output is correct
3 Partially correct 44 ms 17712 KB Output is partially correct
4 Partially correct 54 ms 17872 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 2392 KB Output is partially correct
2 Correct 25 ms 13224 KB Output is correct
3 Partially correct 44 ms 17712 KB Output is partially correct
4 Partially correct 54 ms 17872 KB Output is partially correct
5 Partially correct 86 ms 15256 KB Output is partially correct
6 Partially correct 76 ms 16028 KB Output is partially correct
7 Partially correct 72 ms 15900 KB Output is partially correct
8 Partially correct 71 ms 16320 KB Output is partially correct
9 Partially correct 45 ms 18272 KB Output is partially correct
10 Partially correct 71 ms 22728 KB Output is partially correct
11 Partially correct 64 ms 16064 KB Output is partially correct
12 Partially correct 43 ms 11760 KB Output is partially correct
13 Partially correct 59 ms 11372 KB Output is partially correct
14 Partially correct 53 ms 11172 KB Output is partially correct
15 Partially correct 53 ms 10828 KB Output is partially correct
16 Partially correct 2 ms 2652 KB Output is partially correct
17 Partially correct 35 ms 9784 KB Output is partially correct
18 Partially correct 37 ms 10672 KB Output is partially correct
19 Partially correct 52 ms 10164 KB Output is partially correct
20 Partially correct 62 ms 12664 KB Output is partially correct
21 Partially correct 71 ms 14792 KB Output is partially correct
22 Partially correct 60 ms 11936 KB Output is partially correct