제출 #584486

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
584486		Dan4Life	Aliens (IOI07_aliens)	C++17	0 / 100	4 ms	452 KiB

aliens

#include <bits/stdc++.h>
using namespace std;
int n, m, l, r, u, d, X, Y, bx, by;
map<pair<int,int>,int> M;

int query(int x, int y){
    if(x<1 or y<1 or x>n or y>n) return -1;
    if(M.count({x,y})) return M[{x,y}];
    cout << "examine " << x << " " << y << endl;
    string s; cin >> s; return M[{x,y}]=(s=="true");
}

int32_t main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n >> X >> Y; M[{X,Y}]=1;
    while(query(X-l-1,Y)>0) l++;
    while(query(X+r+1,Y)>0) r++;
    while(query(X,Y-d-1)>0) d++;
    m = l+r+1; u = m-d-1;
    int bx = X-l, by = Y-d;
    while(query(bx-m, by-m)>0) bx-=m, by-=m;
    while(query(bx, by-m)>0) by-=m;
    while(query(bx-m, by)>0) bx-=m;
    int ansx = bx+m*2+m/2, ansy = by+m*2+m/2; 
    cout << "solution " << ansx << " " << ansy << endl;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10