oj.uz

Submission #99966

# Submission time Handle Problem Language Result Execution time Memory
99966 2019-03-09T03:19:18 Z tinjyu Mechanical Doll (IOI18_doll) C++14
9 / 100
 193 ms 11536 KB 
#include <iostream>
#include <vector>
#include "doll.h"
using namespace std;
int l[1000000],r[1000000],num[25],d[1000000];

void create_circuit(int M, std::vector<int> A) {
  int n = A.size(); 
  n++;
  A[n-1]=-1;
  int t=1,p=0;
	while(t<n)
	{
		t*=2;
		p++;
	}
  std::vector<int> C(M + 1);
  C[0] = -1;
  for (int i = 1; i <= M; ++i) {
    C[i] = 1;
  }
  std::vector<int> X(t-1), Y(t-1);
  for (int k = 0; k < n; ++k) {
    X[k] = Y[k] = A[k];
  }
 
	num[1]=-1;
	for(int i=1;i<=t+1;i++)
	{
		num[1]++;
		for(int j=1;j<=p+1;j++)
		{
			if(num[j]==2)
			{
				num[j]=0;
				num[j+1]++;
			}
			else break;
		}
		int q=1;
		for(int j=p;j>=1;j--)
		{
			d[i]+=q*num[j];
			q*=2;
		}
	}
	for(int i=1;i<=t-1;i++)
	{
		l[i]=(i*2)*-1;
		r[i]=(i*2+1)*-1;
		if(i*2>t-1)l[i]=-1;
		if(i*2+1>t-1)r[i]=-1;
	}
	//for(int i=1;i<=t-1;i++)cout<<l[i]<<" ";
	//cout<<endl;
	//for(int i=1;i<=t-1;i++)cout<<r[i]<<" ";
	//cout<<endl;
	for(int i=1;i<=n;i++)
	{
		if(d[i]%2==1)r[(t+d[i])/2]=A[i-1];
		else l[(t+d[i])/2]=A[i-1];
		//cout<<d[i]%2<<" "<<(t+d[i])/2<<endl;
	}
	//for(int i=t/2;i<=t-1;i++)cout<<l[i]<<" "<<r[i]<<" ";
  	//cout<<endl;
	  C[0]=-1;
  	for(int i=1;i<=M;i++)C[i]=-1;
  	if(n==t)C[A[n-1]]=0;
  	else r[t-1]=0;
	//cout<<endl;
	for(int i=0;i<t-1;i++)X[i]=l[i+1];
	//cout<<endl;
	for(int i=0;i<t-1;i++)Y[i]=r[i+1];
	
	//for(int i=0;i<t-1;i++)cout<<X[i]<<" ";
	//cout<<endl;
	//for(int i=0;i<t-1;i++)cout<<Y[i]<<" ";
	//cout<<endl;
  	answer(C, X, Y);
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
9.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 204 KB Output is partially correct
2 Partially correct 76 ms 10588 KB Output is partially correct
3 Partially correct 102 ms 10572 KB Output is partially correct
4 Partially correct 89 ms 11068 KB Output is partially correct

Subtask #6
0.0 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 204 KB Output is partially correct
2 Partially correct 76 ms 10588 KB Output is partially correct
3 Partially correct 102 ms 10572 KB Output is partially correct
4 Partially correct 89 ms 11068 KB Output is partially correct
5 Partially correct 193 ms 11536 KB Output is partially correct
6 Partially correct 96 ms 11324 KB Output is partially correct
7 Partially correct 95 ms 11448 KB Output is partially correct
8 Partially correct 100 ms 11176 KB Output is partially correct
9 Partially correct 78 ms 10584 KB Output is partially correct
10 Partially correct 93 ms 11204 KB Output is partially correct
11 Partially correct 131 ms 11072 KB Output is partially correct
12 Partially correct 82 ms 10564 KB Output is partially correct
13 Partially correct 84 ms 10692 KB Output is partially correct
14 Partially correct 96 ms 10820 KB Output is partially correct
15 Partially correct 83 ms 10884 KB Output is partially correct
16 Partially correct 3 ms 588 KB Output is partially correct
17 Incorrect 52 ms 5976 KB wrong motion
18 Halted 0 ms 0 KB -