传送门 dingguagua
A:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1822
紫书有介绍,每个蚂蚁碰撞返回相当于两者擦身而过并互换编号,注意按输入位置输出;
B:没看,应该不难;
C:呵呵;
D:注意整数取整是本身,
E:http://acm.fzu.edu.cn/problem.php?pid=2105
因为数都小于16,可以建4棵线段树,分别维护二进制数每一位的值;
F:http://acm.hdu.edu.cn/showproblem.php?pid=3986
两边Dijkstra预处理1为起点和n为起点的最短路,然后枚举并删除最短路上的每条边重新跑Dijkstra进行更新;
WA的原因竟然是因为没有开long long?,数据比较小,不应该啊;
A的代码
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
using namespace std;
typedef long long ll;
ll L,T,n,G,cnt,inf=2147483647;
const ll MAXN=20001;
bool vis[MAXN];
struct hh {ll num,q;char ss;}ma[MAXN],a[MAXN],gg[MAXN];
void init()
{
memset(ma,0,sizeof(ma));
memset(a,0,sizeof(a));
memset(vis,0,sizeof(vis));
memset(gg,0,sizeof(gg));
return;
}
bool cmp (hh xx,hh yy) {return xx.num < yy.num;}
void solve()
{
cin>>G;
inf*=inf;
while(G--)
{
++cnt;
printf("Case #%lld:\n",cnt);
init();
scanf("%lld%lld%lld",&L,&T,&n);
for(ll i=1;i<=n;i++) cin>>a[i].num>>a[i].ss,a[i].q=i;
for(ll i=1;i<=n;i++)
{
if(a[i].num+T>L && a[i].ss=='R') ma[i].ss='H',ma[i].num=inf;
else if(a[i].num-T<0 && a[i].ss=='L') ma[i].ss='H',ma[i].num=-1;
else if(a[i].ss=='R') ma[i].num=a[i].num+T,ma[i].ss='R';
else if(a[i].ss=='L') ma[i].num=a[i].num-T,ma[i].ss='L';
}
sort(ma+1,ma+n+1,cmp);
sort(a+1,a+n+1,cmp);
for(ll i=1;i<=n;i++)
{
gg[a[i].q]=ma[i];
if( (ma[i].num==ma[i-1].num || ma[i].num==ma[i+1].num) && ma[i].ss!='H' )
vis[a[i].q]=1;
}
for(ll i=1;i<=n;i++)
{
if(gg[i].ss=='H')
cout<<"Fell off"<<"\n";
else if(vis[i])
cout<<gg[i].num<<" Turning"<<"\n";
else
cout<<gg[i].num<<" "<<gg[i].ss<<"\n";
}
cout<<"\n";
}
return;
}
int main()
{
solve();
return 0;
}
F的代码
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<string>
using namespace std;
typedef long long ll;
const ll MAXN=100009;
ll fst[MAXN<<1],nxt[MAXN<<1],dis[MAXN][2],diss[MAXN];
ll tot,T,n,m,ans,inf=2147483647;
struct hh {ll f,t,c;}ma[MAXN<<1];
struct sh {ll num,d;};
bool operator < (sh a,sh b) {return a.d > b.d;}
priority_queue<sh>q;
void build(ll f,ll t,ll c)
{
ma[++tot]=(hh){f,t,c};
nxt[tot]=fst[f];
fst[f]=tot;
return;
}
void init(ll n)
{
for(ll i=1;i<=n;i++) dis[i][0]=dis[i][1]=inf;
memset(fst,0,sizeof(fst));
memset(nxt,0,sizeof(nxt));
ans=-1,tot=0;
return;
}
void Dijkstra(ll sx,ll st)
{
dis[sx][st]=0;
q.push((sh){sx,0});
while(!q.empty())
{
ll x=q.top().num;
q.pop();
for(ll i=fst[x];i;i=nxt[i])
{
ll v=ma[i].t;
if(dis[v][st]>dis[x][st]+ma[i].c)
{
dis[v][st]=dis[x][st]+ma[i].c;
q.push((sh){v,dis[v][st]});
}
}
}
return;
}
void Dijkstra_()
{
for(ll i=1;i<=n;i++) diss[i]=inf;
diss[1]=0;
q.push((sh){1,0});
while(!q.empty())
{
ll x=q.top().num;
q.pop();
for(ll i=fst[x];i;i=nxt[i])
{
ll v=ma[i].t;
if(diss[v]>diss[x]+ma[i].c)
{
diss[v]=diss[x]+ma[i].c;
q.push((sh){v,diss[v]});
}
}
}
return;
}
void solve()
{
cin>>T;
while(T--)
{
scanf("%lld%lld",&n,&m);
init(n);
for(ll i=1;i<=m;i++)
{
ll x,y,z;
scanf("%lld%lld%lld",&x,&y,&z);
build(x,y,z);
build(y,x,z);
}
Dijkstra(1,0),Dijkstra(n,1);
for(ll i=1;i<=n;i++)
{
for(ll j=fst[i];j;j=nxt[j])
{
ll v=ma[j].t,cc=ma[j].c;
if(dis[i][0]+dis[v][1]+ma[j].c==dis[n][0])
{
ma[j].c=inf;
Dijkstra_();
ma[j].c=cc;
ans=max(ans,diss[n]);
}
}
}
if(ans==inf)
cout<<-1<<"\n";
else
cout<<ans<<"\n";
}
return;
}
int main()
{
solve();
return 0;
}