| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 117185 | JohnTitor | Treasure (different grader from official contest) (CEOI13_treasure2) | C++11 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i=(j); i<=(k); i++)
#define FFOR(i, j, k) for(int i=(j); i<(k); i++)
#define DFOR(i, j, k) for(int i=(j); i>=(k); i--)
#define bug(x) cerr<<#x<<" = "<<(x)<<'\n'
#define pb push_back
#define mp make_pair
#define bit(s, i) (((s)>>(i))&1LL)
#define mask(i) ((1LL<<(i)))
#define builtin_popcount __builtin_popcountll
#define __builtin_popcount __builtin_popcountll
using ll=long long; using ld=long double;
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); const ld pi=acos(0)*2;
template <typename T> inline void read(T &x){char c; bool nega=0; while((!isdigit(c=getchar()))&&(c!='-')); if(c=='-'){nega=1; c=getchar();} x=c-48; while(isdigit(c=getchar())) x=x*10+c-48; if(nega) x=-x;}
template <typename T> inline void writep(T x){if(x>9) writep(x/10); putchar(x%10+48);}
template <typename T> inline void write(T x){if(x<0){ putchar('-'); x=-x;} writep(x);}
template <typename T> inline void writeln(T x){write(x); putchar('\n');}
#define taskname "Treasure"
int ask(int x0, int y0, int x1, int y1){
printf("%d %d %d %d\n", x0, y0, x1, y1);
fflush(stdout);
int ans=0;
read(ans);
return ans;
}
int n;
int c[101][101];
void solve(int x0, int y0, int x1, int y1, int sum){
if(sum==0) return;
if(sum==(x1-x0+1)*(y1-y0+1)){
FOR(i, x0, x1) FOR(j, y0, y1) c[i][j]=1;
return;
}
else{
if(x1-x0>y1-y0){
int mx=(x1+x0)/2;
int half=ask(x0, y0, mx, y1);
solve(x0, y0, mx, y1, half);
solve(mx+1, y0, x1, y1, sum-half);
}
else{
int my=(y1+y0)/2;
int half=ask(x0, y0, x1, my);
solve(x0, y0, x1, my, half);
solve(x0, my+1, x1, y1, sum-half);
}
}
}
int main(){
#ifdef Aria
if(fopen(taskname".in", "r"))
freopen(taskname".in", "r", stdin);
#endif // Aria
read(n);
solve(1, 1, n, n, ask(1, 1, n, n));
puts("END");
FOR(i, 1, n){
FOR(j, 1, n) putchar(c[i][j]+'0');
putchar('\n');
}
fflush(stdout);
}