Submission #1195448


Source Code Expand

#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<stdlib.h>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
const long long d2=500000004;
vector<int> calc(long long a){
	if(a==1){
		return vector<int>(2,1);
	}
	if(a==2){
		vector<int>ret;
		ret.push_back(1);
		ret.push_back(2);
		ret.push_back(2);
		ret.push_back(1);
		return ret;
	}
	vector<int>tmp=calc((a-1)/2);
	vector<int>ret;
	int mv=0;
	for(int i=0;i<tmp.size();i++)mv=max(mv,tmp[i]);
	if(a%2==1){
		ret.push_back(mv+1);
		for(int i=0;i<tmp.size()/2;i++)ret.push_back(tmp[i]);
		ret.push_back(mv+1);
		for(int i=0;i<tmp.size()/2;i++)ret.push_back(tmp[tmp.size()/2+i]);
	}else{
		ret.push_back(mv+2);
		ret.push_back(mv+1);
		for(int i=0;i<tmp.size()/2;i++)ret.push_back(tmp[i]);
		ret.push_back(mv+1);
		for(int i=0;i<tmp.size()/2;i++)ret.push_back(tmp[tmp.size()/2+i]);
		ret.push_back(mv+2);
	}
	return ret;
}
//549,755,813,888
int main(){
	long long a;
	scanf("%lld",&a);
	vector<int>ret=calc(a);
	printf("%d\n",(int)(ret.size()));
	for(int i=0;i<ret.size();i++){
		if(i)printf(" ");
		printf("%d",ret[i]);
	}
	printf("\n");
}

Submission Info

Submission Time
Task C - Tautonym Puzzle
User tozangezan
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 1306 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:50:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld",&a);
                  ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 2
AC × 32
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt
All 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt
Case Name Status Exec Time Memory
00_example_01.txt AC 1 ms 256 KB
00_example_02.txt AC 1 ms 256 KB
01.txt AC 1 ms 256 KB
02.txt AC 1 ms 256 KB
03.txt AC 1 ms 256 KB
04.txt AC 1 ms 256 KB
05.txt AC 1 ms 256 KB
06.txt AC 1 ms 256 KB
07.txt AC 1 ms 256 KB
08.txt AC 1 ms 256 KB
09.txt AC 1 ms 256 KB
10.txt AC 1 ms 256 KB
11.txt AC 1 ms 256 KB
12.txt AC 1 ms 256 KB
13.txt AC 1 ms 256 KB
14.txt AC 1 ms 256 KB
15.txt AC 1 ms 256 KB
16.txt AC 1 ms 256 KB
17.txt AC 1 ms 256 KB
18.txt AC 1 ms 256 KB
19.txt AC 1 ms 256 KB
20.txt AC 1 ms 256 KB
21.txt AC 1 ms 256 KB
22.txt AC 1 ms 256 KB
23.txt AC 1 ms 256 KB
24.txt AC 1 ms 256 KB
25.txt AC 1 ms 256 KB
26.txt AC 1 ms 256 KB
27.txt AC 1 ms 256 KB
28.txt AC 1 ms 256 KB
29.txt AC 1 ms 256 KB
30.txt AC 1 ms 256 KB