# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67991 | 2018-08-15T16:54:59 Z | hamzqq9 | Binary Subsequences (info1cup17_binary) | C++14 | 900 ms | 712 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; } 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++) { if(__gcd(i,k-i)==1) { ++ans; int step=exg(i,k-i); 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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 108 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 41 ms | 484 KB | Output is correct |
2 | Correct | 89 ms | 616 KB | Output is correct |
3 | Correct | 81 ms | 616 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 897 ms | 712 KB | Output is correct |
2 | Execution timed out | 1075 ms | 712 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |