模擬神題
神模擬題
模神擬題
//====================================================================||
// Name : sdfsdf.cpp ||
// Date : 2013/5/20 下午11:13:32 ||
// Author : GCA ||
// 6AE7EE02212D47DAD26C32C0FE829006 ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE\_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 1100
#define PII pair<int,int\>
#define PB push\_back
#define oo INT\_MAX
#define Set\_oo 0x3f
#define Is\_debug true
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int thow\[M\];
int pnum;
struct lc\_s{
int x;
int y;
}lc\[M\];
int lcnum;
int thownum;
int pe\[M\];
int penum;
int main() {
ios\_base::sync\_with\_stdio(0);
thownum=0;
for(int i=0;;i++){
int tmp;
scanf("%d",&tmp);
if(tmp==0)break;
thow\[i\]=tmp;
thownum++;
}
while(~scanf("%d",&pnum)&&pnum){
lcnum=0;
penum=0;
for(int i=0;;i++){
int x,y;
scanf("%d%d",&x,&y);
if(!(x+y))break;
lc\[i\].x=x;
lc\[i\].y=y;
lcnum++;
}
for(int i=0;;i++){
int t;
scanf("%d",&t);
if(!t)break;
pe\[i\]=t;
penum++;
}
int pnow\[pnum\];
bool pause\[pnum\];
Set(pause,0);
Set(pnow,0);
int nowturn=0;
int win=0;
for(int i=0;;i=(i+1)%thownum){
// debug("%d %d\\n",pnow\[0\],pnow\[1\]);
if(pause\[nowturn\]){
pause\[nowturn\]=false;
nowturn=(nowturn+1)%pnum;
continue;
}
if(pnow\[nowturn\]+thow\[i\]>100){
nowturn=(nowturn+1)%pnum;
continue;
}else if(pnow\[nowturn\]+thow\[i\]==100){
win=nowturn;
break;
}
pnow\[nowturn\]+=thow\[i\];
for(int j=0;j<lcnum;j++){
if(lc\[j\].x==pnow\[nowturn\]){
pnow\[nowturn\]=lc\[j\].y;
}
}
bool fg=false;
for(int j=0;j<penum;j++){
if(pe\[j\]<0&&pe\[j\]==-pnow\[nowturn\]){
pause\[nowturn\]=true;
break;
}else if(pe\[j\]>0&&pe\[j\]==pnow\[nowturn\]){
fg=true;
break;
}
}
if(!fg){
nowturn=(nowturn+1)%pnum;
}
}
printf("%d\\n",win+1);
}
}