oj.uz

답안 #67992

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
67992 2018-08-15T16:56:29 Z hamzqq9 Binary Subsequences (info1cup17_binary) C++14
100 / 100
 676 ms 652 KB 
#include<bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define umax(x,y) x=max(x,y)
#define umin(x,y) x=min(x,y)
#define ll long long
#define ii pair<int,int>
#define iii pair<int,ii>
#define sz(x) ((int) x.size())
#define orta ((bas+son)>>1)
#define all(x) x.begin(),x.end()
#define dbgs(x) cerr<<(#x)<<" --> "<<(x)<<" "
#define dbg(x) cerr<<(#x)<<" --> "<<(x)<<endl;getchar()
#define pw(x) (1<<(x))
#define inf 1000000000
#define MOD 1000000007
#define N 100003
#define MAX 10000006
#define LOG 30
using namespace std;

int n,t,sz;
bool res[N];

int exg(int x,int y) {

	int step=0;

	while(x>0) {

		step+=y/x;

		y%=x;

		swap(x,y);

	}

	return step-1+(y!=1)*inf;

}

void solve(int n) {

	int k=n+2;
	int ans=0;
	int best=inf;
	int x,y;

	for(int i=1;i<=k/2;i++) {

		int step=exg(i,k-i);

		if(step<inf) {

			++ans;

			if(step<best) {

				best=step;

				x=i,y=k-i;

			}


		}
	
	}

	printf("%d\n",ans*2);

	int tur=0;

	while(x>0) {

		for(int i=1;i<=y/x;i++) res[sz++]=tur;

		y%=x;

		swap(x,y);

		tur^=1;

	}

	sz--;

	while(sz) {--sz;putchar('0'+res[sz]);putchar(' ');}

	puts("");

}

int main() {

	//freopen("input.txt","r",stdin);

	scanf("%d",&t);

	while(t--) {

		scanf("%d",&n);

		solve(n);

	}

}

Compilation message

binary.cpp: In function 'int main()':
binary.cpp:101:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&t);
  ~~~~~^~~~~~~~~
binary.cpp:105:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n);
   ~~~~~^~~~~~~~~
binary.cpp: In function 'void solve(int)':
binary.cpp:50:8: warning: 'y' may be used uninitialized in this function [-Wmaybe-uninitialized]
  int x,y;
        ^
binary.cpp:50:6: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
  int x,y;
      ^

Subtask #1
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 504 KB Output is correct

Subtask #2
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 604 KB Output is correct
2 Correct 57 ms 604 KB Output is correct
3 Correct 56 ms 604 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 676 ms 604 KB Output is correct
2 Correct 673 ms 604 KB Output is correct
3 Correct 662 ms 652 KB Output is correct