제출 #581072

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
581072		zaneyu	Aliens (IOI07_aliens)	C++14	100 / 100	2 ms	256 KiB

aliens

/*input
19 19 19
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld long double
#define pii pair<ll,int>
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=500+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?"":"");
    return out;
}
int mult(ll a,ll b){
    if(a<0) a+=MOD;
    return (a*b)%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
#define int ll
int n;
bool query(int x,int y){
    if(x<=0 or y<=0 or x>n or y>n){
        return false;
    }
    cout<<"examine "<<x<<' '<<y<<endl;
    string s;
    cin>>s;
    return (s=="true");
}
int32_t main(){
    //ios::sync_with_stdio(false),cin.tie(0);
    int x0,y0;
    cin>>n>>x0>>y0;
    int z=1;
    while(x0+z<=n){
        if(!query(x0+z,y0)) break;
        z*=2;
    }
    int l=x0+(z/2),r=x0+z;
    while(l<r){
        int mid=(l+r+1)/2;
        if(query(mid,y0)) l=mid;
        else r=mid-1;
    }
    int rs=l;
    z=1;
    while(x0-z>0){
        if(!query(x0-z,y0)) break;
        z*=2;
    }
    l=x0-z,r=x0-(z/2);
    
    while(l<r){
        int mid=(l+r)/2;
        if(query(mid,y0)) r=mid;
        else l=mid+1;
    }
    z=1;
    int ls=l;
    while(y0+z<=n){
        if(!query(x0,y0+z)) break;
        z*=2;
    }
    l=y0+(z/2),r=y0+z;
    while(l<r){
        int mid=(l+r+1)/2;
        if(query(x0,mid)) l=mid;
        else r=mid-1;
    }
    int us=l;
    int len=(rs-ls+1);
    int ds=us-len+1;
    len*=2;
    int lls=ls-len;
    while(query(lls,y0)) lls-=len;
    int rrs=rs+len;
    while(query(rrs,y0)) rrs+=len;
    int dds=ds-len;
    while(query(x0,dds)) dds-=len;
    int uus=us+len;
    while(query(x0,uus)) uus+=len;
    //cout<<lls<<' '<<rrs<<'\n';
    cout<<"solution "<<(lls+rrs)/2<<' '<<(dds+uus)/2<<'\n';
}

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