# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1048574 | 2024-08-08T08:28:08 Z | 5시간 대회를 2시간으로 즐길 수 있다니 완전 럭키비키잖아~(#11095) | Light Bulbs (EGOI24_lightbulbs) | C++17 | 1 ms | 344 KB |
#include <bits/stdc++.h> using namespace std; int n; int pos[100]; int arr[100][100]; int query() { printf("?\n"); for(int i=0;i<n;i++) { for(int j=0;j<n;j++) { printf("%d",arr[i][j]); } printf("\n"); } fflush(stdout); int x; scanf("%d",&x); return x; } void answer() { printf("!\n"); for(int i=0;i<n;i++) { for(int j=0;j<n;j++) { printf("%d",arr[i][j]); } printf("\n"); } fflush(stdout); } int solve(int x) { memset(arr,0,sizeof(arr)); for(int i=0;i<n;i++) { arr[x][i]=true; } int got=query(); if (query()==n*n) { answer(); return -1; } int gv=(n*n-got)/(n-1); int lo=-1; int hi=n-1; while (lo+1<hi) { int mid=(lo+hi)/2; memset(arr,0,sizeof(arr)); int got1; if (mid!=0) { for(int i=0;i<=mid;i++) { arr[x][i]=true; } if (query()==(mid+1)*n) { lo=mid; } else { hi=mid; } } else { for(int i=mid+1;i<n;i++) { arr[x][i]=1; } int val=(n-gv)*n+gv; if (query()==val) { hi=mid; } else { lo=mid; } } } return hi; } int main(void) { scanf("%d",&n); bool flag=true; for(int i=0;i<n;i++) { int got=solve(i); if (got==-1) { return 0; } pos[i]=got; } memset(arr,0,sizeof(arr)); for(int i=0;i<n;i++) { arr[i][pos[i]]=1; } answer(); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Incorrect | 0 ms | 344 KB | The lamps do not light up the entire grid |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Incorrect | 0 ms | 344 KB | The lamps do not light up the entire grid |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Incorrect | 0 ms | 344 KB | The lamps do not light up the entire grid |
5 | Halted | 0 ms | 0 KB | - |