| #include "testlib.h" |
| #include <vector> |
|
|
| namespace { |
| constexpr int MAX_N = 3000 + 50, T = 3000; |
| int cnt_query, full_score,best_score; |
| int co[MAX_N][MAX_N], n, dir[8][2]={{0,1},{0,-1},{1,0},{-1,0},{1,1},{-1,-1},{1,-1},{-1,1}}; |
| double vis[MAX_N]; |
| struct node{ |
| int x,y; |
| bool valid(){ |
| return (x>=1)&&(x<=T)&&(y>=1)&&(y<=T); |
| } |
| bool validr(){ |
| return (x>=1)&&(y>=1)&&co[x][y]==0; |
| } |
|
|
| int dis(node b){ |
| return abs(x-b.x)+abs(y-b.y); |
| } |
| }s; |
| node n0={0,0}; |
| std::vector<node> v,bl; |
| |
| |
| |
| |
| |
| |
| node nest(){ |
| int id=0; |
| for(int i=0;i<v.size();i++){ |
| vis[i]=0; |
| for(int j=0;j<bl.size();j++){ |
| vis[i]+=1.0/v[i].dis(bl[j]); |
| } |
| if(vis[i]<vis[id]) id=i; |
| } |
| return v[id]; |
| } |
| node solve(node t){ |
| if(!co[t.x][t.y]) bl.push_back(t); |
| co[t.x][t.y]=1; |
| node ny; |
| v.clear(); |
| for(int i=0;i<8;i++){ |
| ny.x=s.x+dir[i][0]; |
| ny.y=s.y+dir[i][1]; |
| if(ny.validr()) v.push_back(ny); |
| } |
| if(v.empty()) return n0; |
| if(v.size()==1) return v[0]; |
| |
| return nest(); |
| } |
|
|
| } |
|
|
| void succe(){ |
| println(0,0); |
| full_score = 1; |
| double score=full_score*std::min(1.0,std::max(0.0,1.0*(T-cnt_query)/(T-best_score))); |
| double unbounded_score=full_score*std::max(0.0,1.0*(T-cnt_query)/(T-best_score)); |
| quitp(score, "cnt_query=%d, Ratio: %.4f, RatioUnbounded: %.4f", cnt_query,score, unbounded_score); |
| exit(0); |
| } |
| int main(int argc, char* argv[]) { |
| registerInteraction(argc, argv); |
| s.x=inf.readInt(),s.y=inf.readInt(); |
| println(s.x,s.y); |
|
|
| best_score=ans.readInt(); |
| node m,nx; |
| for(cnt_query=1;cnt_query<=T;cnt_query++){ |
| m.x=ouf.readInt(); |
| m.y=ouf.readInt(); |
| if(!m.valid()) quitf(_wa, "Invalid coordinate"); |
| nx=solve(m); |
| if(nx.x==n0.x && nx.y==n0.y) succe(); |
| println(nx.x,nx.y); |
| s=nx; |
| } |
| |
| |
| |
| |
| quitf(_wa, "Too many queries"); |
| return 0; |
| } |
