oj.uz

Submission #82167

# Submission time Handle Problem Language Result Execution time Memory
82167 2018-10-29T10:46:52 Z KLPP Mechanical Doll (IOI18_doll) C++14
37 / 100
 106 ms 8484 KB 
#include "doll.h"
#include<iostream>
#include<vector>
using namespace std;

int reverse(int a,int exp){
	int ans=0;
	while(exp--){ans*=2;
		ans+=a%2;
		a/=2;
	}//cout<<endl;
	return ans;
}

void create_circuit(int M, std::vector<int> A) {
	A.push_back(0);
	int N = A.size();
	int pow=1;
	int exp=0;
	while(pow<N){
		pow*=2;
		exp++;
	}
	vector<int> C(M+1);
	for(int i=0;i<=M;i++)C[i]=-1;
	vector<int> X(pow-1);
	vector<int> Y(pow-1);
	for(int i=0;i<pow/2-1;i++){
		X[i]=2*(-i-1);
		Y[i]=2*(-i-1)-1;
		//cout<<-i-1<<" "<<X[i]<<" "<<Y[i]<<endl;
	}
	for(int i=pow/2;i<pow;i++){
		int orderX=2*i-pow;
		int orderY=2*i+1-pow;
		//cout<<orderX<<" "<<orderY<<endl;
		//cout<<reverse(orderX,exp)<<endl;
		//cout<<reverse(orderY,exp)<<endl;
		int rX=reverse(orderX,exp);
		int rY=reverse(orderY,exp);
		//cout<<rX<<" "<<rY<<endl;
		if(rX+N>=pow){
			X[i-1]=A[rX-pow+N];
		}else X[i-1]=-1;
		if(rY+N>=pow){
			Y[i-1]=A[rY-pow+N];
		}else Y[i-1]=-1;
	}
	//cout<<pow<<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 75 ms 7460 KB Output is partially correct
3 Partially correct 73 ms 7460 KB Output is partially correct
4 Partially correct 88 ms 7972 KB Output is partially correct

Subtask #6
28.0 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 204 KB Output is partially correct
2 Partially correct 75 ms 7460 KB Output is partially correct
3 Partially correct 73 ms 7460 KB Output is partially correct
4 Partially correct 88 ms 7972 KB Output is partially correct
5 Partially correct 92 ms 8484 KB Output is partially correct
6 Partially correct 92 ms 8240 KB Output is partially correct
7 Partially correct 92 ms 8244 KB Output is partially correct
8 Partially correct 92 ms 8116 KB Output is partially correct
9 Partially correct 74 ms 7496 KB Output is partially correct
10 Partially correct 95 ms 8060 KB Output is partially correct
11 Partially correct 101 ms 7956 KB Output is partially correct
12 Partially correct 75 ms 7496 KB Output is partially correct
13 Partially correct 84 ms 7616 KB Output is partially correct
14 Partially correct 78 ms 7716 KB Output is partially correct
15 Partially correct 91 ms 7716 KB Output is partially correct
16 Partially correct 3 ms 588 KB Output is partially correct
17 Correct 48 ms 5304 KB Output is correct
18 Partially correct 81 ms 7460 KB Output is partially correct
19 Partially correct 85 ms 7484 KB Output is partially correct
20 Partially correct 95 ms 7980 KB Output is partially correct
21 Partially correct 106 ms 7988 KB Output is partially correct
22 Partially correct 89 ms 8020 KB Output is partially correct