梦熊CSPS模拟草稿

#include<bits/stdc++.h>
using namespace std;
#define int long long struct q{int x,xx,y,yy;int v;
}s[100];void init(){s[1].v=1;s[2].v=1;for(int i=3;i<=90;i++){s[i].v=s[i-1].v+s[i-2].v;}s[1].x=-1,s[1].xx=0,s[1].y=1,s[1].yy=0;s[2].x=-1,s[2].xx=0,s[2].y=0,s[2].yy=-1;for(int i=3;i<=90;i++){//cnt%4==3 右下角if(i%4==3){s[i].x=s[i-1].xx;s[i].yy=s[i-1].yy;s[i].xx=s[i].x+s[i].v;s[i].y=s[i].yy+s[i].v;} //cnt%4==0 右上角if(i%4==0){s[i].xx=s[i-1].xx;s[i].yy=s[i-1].y;s[i].x=s[i].xx-s[i].v;s[i].y=s[i].yy+s[i].v;} //cnt%4==1 左上角if(i%4==1){s[i].y=s[i-1].y;s[i].xx=s[i-1].x;s[i].yy=s[i].y-s[i].v;s[i].x=s[i].xx-s[i].v;} //cnt%4==2 左下角if(i%4==2){s[i].x=s[i-1].x;s[i].y=s[i-1].yy;s[i].xx=s[i].x+s[i].v;s[i].yy=s[i].x-s[i].v;} }
}int find(int x,int y){for(int i=1;i<=90;i++){if(x<=s[i].xx and x>=s[i].x and y>=s[i].yy and y<=s[i].y){return s[i].v;}}return -1;
}int ans[100100];
int c=0;main(void){freopen("fibonacci2.in","r",stdin);ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);init();int T;cin>>T;while(T--){int x,y;cin>>x>>y;ans[++c]=find(x,y);if(c==3){cout<<x<<' '<<y<<endl;int pos=16;cout<<s[pos].x<<' '<<s[pos].xx<<' '<<s[pos].y<<' '<<s[pos].yy<<endl;cout<<s[pos].v<<endl;}
//		cout<<find(x,y)<<endl;}freopen("fibonacci2.ans","r",stdin);for(int i=1;i<=c;i++){int x;cin>>x;if(x!=ans[i]){cout<<"WA!"<<endl;cout<<"num:"<<i<<endl;cout<<"ans:"<<x<<' '<<"real:"<<ans[i]<<endl;exit(0);}}
}