Gym 100851J Jump(构造)

n01sn/2,nn/2,n,0n+500
n/2n/20n/2,i0n0
n1+1+1=n+1,499n/2
O(n)GG
便s01sn/20.0250n/2


代码:

#include <map>
#include <set>
#include <ctime>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#pragma comment(linker,"/STACK:102400000,102400000")

using namespace std;
#define   MAX           1000005
#define   MAXN          1000005
#define   maxnode       205
#define   sigma_size    26
#define   lson          l,m,rt<<1
#define   rson          m+1,r,rt<<1|1
#define   lrt           rt<<1
#define   rrt           rt<<1|1
#define   middle        int m=(r+l)>>1
#define   LL            long long
#define   ull           unsigned long long
#define   mem(x,v)      memset(x,v,sizeof(x))
#define   lowbit(x)     (x&-x)
#define   pii           pair<int,int>
#define   bits(a)       __builtin_popcount(a)
#define   mk            make_pair
#define   limit         10000

//const int    prime = 999983;
const int    INF   = 0x3f3f3f3f;
const LL     INFF  = 0x3f3f;
const double pi    = acos(-1.0);
const double inf   = 1e18;
const double eps   = 1e-4;
const LL    mod    = 772002;
const ull    mx    = 133333331;

/*****************************************************/
inline void RI(int &x) {
      char c;
      while((c=getchar())<'0' || c>'9');
      x=c-'0';
      while((c=getchar())>='0' && c<='9') x=(x<<3)+(x<<1)+c-'0';
 }
/*****************************************************/

int now[1005];
int vis[1005];
int main(){
    //freopen("froggy.in","r",stdin);
    //freopen("froggy.out","w",stdout);
    int n;
    cin>>n;
    srand(time(NULL));
    while(1){
        for(int i=1;i<=n;i++) now[i]=rand()%2;
        for(int i=1;i<=n;i++) printf("%d",now[i]);
        cout<<endl;
        int t;
        cin>>t;
        if(t==n) return 0;
        if(t==n/2) break;
    }
    vis[1]=now[1];
    now[1]=!now[1];
    for(int i=2;i<=n;i++){
        now[i]=!now[i];
        for(int j=1;j<=n;j++) printf("%d",now[j]);
        cout<<endl;
        int t;
        cin>>t;
        if(t==n/2) vis[i]=now[i];
        else vis[i]=!now[i];
        now[i]=!now[i];
    }
    for(int i=1;i<=n;i++) printf("%d",vis[i]);
    cout<<endl;
    int t;
    cin>>t;
    if(t==n) return 0;
    for(int i=1;i<=n;i++) printf("%d",!vis[i]);
    cout<<endl;
    return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值