集训考试2

今天四道原题:
T1:BZOJ1179 APIO2009抢掠计划
缩点+spfa最长路
T2:bzoj2081Beads
枚举每一个可能的k(调和级数$O(nologn)$),然后字符串hash+map(set)记录出现数

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<set>
#include<vector>
#include<map>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
const int N=1e6+10,x=129000;  
typedef unsigned long long ull;   
using namespace std;  
int n,m,a[N],maxn;ull s1[N],s2[N],xp[N];  
vector<int> num;map<ull,int> mp;  
ull calhash(int l,int r)  {  if (l<=r)  return s1[r]-s1[l-1]*xp[r-l+1];  else return s2[r]-s2[l+1]*xp[l-r+1];}  
void solve (int x)  
{  
  if (maxn*x>n) return;  
  int ans=0;  
  mp.clear();  
  for (int i=1;i<=n;i+=x)  
  if (i+x-1<=n)  {  
    ull t=calhash(i,i+x-1)*calhash(i+x-1,i);  
    if(!mp[t]) ans++,mp[t]=1;   
  }  
  if (ans>maxn) maxn=ans,num.clear();  
  if (ans==maxn) num.push_back(x);  
}  
int main()  
{  
    scanf("%d",&n);  
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);  
    xp[0]=1;  
    fo(i,1,n) xp[i]=xp[i-1]*x;  
    fo(i,1,n) s1[i]=s1[i-1]*x+a[i];  
    fod(i,n,1)s2[i]=s2[i+1]*x+a[i];  
    fo(i,1,n) solve(i);  
    printf("%d %d\n",maxn,num.size());  
    for(int i=0;i<num.size();i++)  
    if(i!=num.size()-1) printf("%d ",num[i]);  
    else printf("%d\n",num[i]);  
}  

T3:RNQOJ 86
裸最短路

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<queue>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int N=1e2+10;
const double G=10.000000,eps=0.000001,inf=1000000.00000;
int n,v,len=0,last[N],vis[N];
double dis[N];
struct Edge{int from,to,next;double val;Edge(int from=0,int to=0,int next=0,double val=0):from(from),to(to),next(next),val(val){}}e[N*N<<1];
struct Node{int x,y;}a[N];
void add_edge(int u,int v,double w){e[++len]=Edge(u,v,last[u],w);last[u]=len;}
#define sqr(x) ((x)*(x))
double getdis(int x1,int y1,int x2,int y2){return sqrt(sqr(double(x1*1.000)-double(x2*1.000))+sqr(double(y1*1.000)-double(y2*1.000)))+eps;}
double caldis(int dis){return sqrt(double(dis*1.000)*2/G)+eps;}
void addedge(int i,int j){add_edge(j,i,caldis(a[j].y-a[i].y));}
void SPFA(int s){
    queue<int>q;
    memset(vis,0,sizeof(vis));
    fo(i,1,n) dis[i]=inf;
    dis[s]=0;
    q.push(s);vis[s]=1;
    while(!q.empty()){
        int cur=q.front(); q.pop();
        vis[cur]=0;
        for(int i=last[cur];i;i=e[i].next){
            int id=e[i].to;
            if(dis[id]>dis[cur]+e[i].val){
                dis[id]=dis[cur]+e[i].val;
                if(!vis[id]){
                    q.push(id);
                    vis[id]=1;
                }
            }
        }
    }
} 
int main()
{
    scanf("%d%d",&n,&v);
    for(int fa,i=1;i<=n;i++) {
        scanf("%d%d%d",&a[i].x,&a[i].y,&fa);
        if(i==1)continue;
        double w=getdis(a[i].x,a[i].y,a[fa].x,a[fa].y)/double(v*1.000)+eps;
        add_edge(i,fa,w);
        add_edge(fa,i,w);
    }
    for(int i=1;i<=n-1;i++) {
        for(int j=i+1;j<=n;j++) {
            if(a[i].x==a[j].x) addedge(i,j);
        }
    }
    for(int i=1;i<=n;i++) {
        for(int j=1;j<=n;j++) {
            if(a[i].x==a[j].x&&a[i].y<a[j].y&&i!=j)addedge(i,j);
        }
    }
    SPFA(1);
    printf("%.2lf\n",dis[n]);
    return 0;
}

T4:
RNQOJ PID84
有时间补太菜了,做不来