#include<algorithm>
#include<cassert>
using namespace std;
#define FOR(i, a, b) for(int i=(a), _b=(b); i<_b; i++)
const int DEBUG=0;
const int HOME=0;
const int MAXK=40;
const int BASE=100000000;
typedef long long LL;
struct bigInt{
int dg[5];
int len;
bigInt(LL v=0){
memset(dg, 0, sizeof dg);
len=5;
FOR(i, 0, len){ dg[i]=v%BASE; v/=BASE; }
while(len>1 && dg[len-1]==0) len--;
}
bool operator<=(const bigInt b)const{
if(len<b.len) return true;
if(len>b.len) return false;
for(int i=len-1; i>=0; i--){
if(dg[i]<b.dg[i]) return true;
if(dg[i]>b.dg[i]) return false;
}
return true;
}
bool operator==(const bigInt b)const{
if(len!=b.len) return false;
for(int i=len-1; i>=0; i--) if(dg[i]!=b.dg[i]) return false;
return true;
}
static void outdg(int n){
char s[10];
sprintf(s,"%d",n);
FOR(l, strlen(s), 8) putchar('0');
printf("%s",s);
}
void output(){
printf("%d",dg[len-1]);
for(int i=len-2; i>=0; --i) outdg(dg[i]);
}
void outputn(){
printf("%d",dg[len-1]);
for(int i=len-2; i>=0; --i) outdg(dg[i]);
putchar('\n');
}
};
bigInt operator+(const bigInt a, const bigInt b){
bigInt ret;
int len=max(a.len, b.len), c=0, v;
FOR(i, 0, len){
v=a.dg[i]+b.dg[i]+c;
ret.dg[i]=v%BASE;
c=v/BASE;
assert(ret.dg[i]>=0 && ret.dg[i]<BASE);
}
if(c) ret.dg[len++]=c;
ret.len=len;
assert(len>0 && ret.dg[len-1]);
return ret;
}
bigInt operator-(const bigInt a, const bigInt b){
bigInt ret;
int len=a.len, c=0, v;
FOR(i, 0, len){
v=a.dg[i]-b.dg[i]-c;
c=v<0?1:0;
ret.dg[i]=c?v+BASE:v;
assert(ret.dg[i]>=0 && ret.dg[i]<BASE);
}
while(len>1 && ret.dg[len-1]==0) len--;
ret.len=len;
assert(len>0);
return ret;
}
int k;
LL p, q, u, v;
bigInt pow[81];
bigInt solve(bigInt u, bigInt v, int sz, bigInt h, bigInt t){
bigInt half, t2, t3, t4, r=u, c=v;
half=pow[sz-1]; t2=t+t; t3=t2+t; t4=t3+t;
if(half<=r) r=r-half; if(half<=c) c=c-half;
int type= u==r ? (v==c?1:2) : (v==c?3:4);
if(!sz) return h;
if(DEBUG){
printf("\nToa do: "); u.output(); printf(","); v.outputn();
printf("Loai : %d\n", type);
printf("Thu tu: "); h.output(); printf("/"); t.outputn();
}
if(type==1) return solve(r, half-c-bigInt(1), sz-1, t+bigInt(1)-h, t4);
if(type==2) return solve(r, c, sz-1, t3+h, t4);
if(type==3) return solve(half-r-bigInt(1), half-c-bigInt(1), sz-1, t+h, t4);
return solve(half-r-bigInt(1), c, sz-1, t3+bigInt(1)-h, t4);
}
int main(){
if(HOME){
freopen("gifts.inp", "r", stdin);
freopen("gifts.out", "w", stdout);
}
pow[0]=bigInt(1);
FOR(i, 1, 81) pow[i]=pow[i-1]+pow[i-1];
if(HOME) scanf("%d %I64d %I64d %I64d %I64d", &k, &p, &q, &u, &v);
else scanf("%d %lld %lld %lld %lld", &k, &p, &q, &u, &v);
solve(bigInt(p), bigInt(q), k, bigInt(1), bigInt(1)).output();
putchar(' ');
solve(bigInt(u), bigInt(v), k, bigInt(1), bigInt(1)).outputn();
return 0;
}
CPP.zip_SPOJ-HOTELS.cpp_circular game spoj_cpp_segment tree_usac
版权申诉
185 浏览量
2022-09-21
08:09:07
上传
评论
收藏 98KB ZIP 举报
CPP.zip_SPOJ-HOTELS.cpp_circular game spoj_cpp_segment tree_usac （112个子文件） 
NKGIFTS.cpp 3KB LUBENICA.cpp 3KB MATCH2.cpp 2KB CLOCK.cpp 2KB QBGAME.cpp 2KB NKFLOW.cpp 2KB LEM3.cpp 2KB QBSELECT.cpp 2KB QBBISHOP.cpp 2KB NKMARS.cpp 2KB ASSIGN1.cpp 2KB NKTEAM2.cpp 2KB THREE.cpp 2KB PBCFIBO.cpp 2KB floyd.cpp 2KB NKMSG.cpp 2KB QBROBOT.cpp 2KB HUGEKNAP.cpp 2KB MESSAGE.cpp 2KB NKMINES.cpp 2KB CTREE.cpp 2KB KDEL.cpp 2KB PTREE.cpp 2KB VMUNCH.cpp 2KB HEAP1.cpp 2KB NKBM.cpp 2KB MATCH1.cpp 2KB PBCSEQ.cpp 1KB KAGAIN.cpp 1KB kruskal.cpp 1KB CWAY.cpp 1KB QBSQUARE.cpp 1KB NKTEAM1.cpp 1KB SHHV.cpp 1KB nkrez.cpp 1KB NKLINEUP.cpp 1KB MINK.cpp 1KB COND.cpp 1KB SUBSTR.cpp 1KB NKLEAGUE.cpp 1KB VBOARD.cpp 1KB QBRECT.cpp 1KB nkpalin.cpp 1KB BCDIV.cpp 1KB QBMSEQ.cpp 1KB pcircle.cpp 1KB VDANGER.cpp 1KB NKSEQ.cpp 1KB DIGIT0.cpp 1KB VCOLDWAT.cpp 1KB VBGRASS.cpp 1KB latgach.cpp 1KB NKMOBILE.cpp 1KB NKSTEP.cpp 1KB nktheme.cpp 1KB NKJUMP.cpp 1KB pnumber.cpp 1KB QBMAX.cpp 1KB MYSTERY.CPP 1KB LIS.cpp 1KB NKCABLE.cpp 1KB VCOWFLIX.cpp 1KB MAXARR1.cpp 1KB VSTEPS.cpp 1KB liq.cpp 1KB NKTICK.cpp 1KB MULONE.cpp 1KB DISNEY1.cpp 1006B NKLP.cpp 978B DISNEY2.cpp 964B VRATF.cpp 907B QBSEQ.cpp 887B CHEAT.cpp 878B IOIBIN.cpp 872B QBHV.cpp 861B NKSGAME.cpp 783B NKINV.cpp 770B post.cpp 529B NSP.cpp 417B
COND.exe 73KB floyd.exe 58KB BALLGAME.PAS 6KB V8SORT.PAS 5KB MATCH2.PAS 4KB BIGNUM.PAS 4KB SPSUM.PAS 3KB GSS.PAS 3KB NTHUGE.PAS 3KB CRATE.PAS 3KB CRUELL.PAS 3KB MATCH1.PAS 3KB SUMS.PAS 3KB MAXCUB.PAS 2KB NUMBERS.PAS 2KB CPRIME.PAS 2KB MAXARR2.PAS 1KB NTTREE.PAS 1KB CREC01.PAS 1KB MAXARR1.PAS 1KB MATMA.PAS 1KB共 112 条
- 1
- 2
资源评论
