#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define sp <<' '<<
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
#define cont(x) for(auto el:x) cout<<el<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;
#define DEBUG(x) cout<<#x sp x<<endl;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int n;
cin>>n;
vector<string> grid(n);
vector<string> res(n);
vector<string> cev(n);
FOR(i,n){
FOR(j,n){
grid[i]+='0';
res[i]+='H';
cev[i]+='0';
}
}
int ans;
bool f=false;
FOR(i,n){
FOR(j,n){
grid[i][j]='1';
}
cout<<'?'<<endl;
cont(grid);
cout<<endl;
cin>>ans;
int once=ans;
if(ans!=n){
ans-=n;
int vert=ans/(n-1); //kaç tanesi vertical
if(vert==n){
FOR(j,n) cev[i][j]='1';
f=true;
break;
}
FOR(j,n){
if(vert==0) break;
if(vert==1 and j==n-1){
res[i][j]='V';
break;
}
grid[i][j]='0';
cout<<'?'<<endl;
cont(grid);
cin>>ans;
assert(n-1>0);
ans-=(n-1);
int deg=ans/(n-1);
if(ans==once-(n-1)){
//this cell is vertical
res[i][j]='V';
vert--;
}
grid[i][j]='1';
}
}
//else all horizontal
FOR(j,n){
grid[i][j]='0';
}
}
if(!f){
FOR(i,n){
FOR(j,n){
if(res[i][j]=='H'){
cev[i][j]='1';
break;
}
}
}
}
cout<<"!"<<endl;
cont(cev);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |