2017-10-04-afternoon

注意完全平方数统计时的特判

 #include <cstdio>

 inline void read(int &x)
 {
     x=; register char ch=getchar();
     for(; ch>''||ch<''; ) ch=getchar();
     for(; ch>=''&&ch<=''; ch=getchar()) x=x*+ch-'';
 }
 const int N();
 int n,cnt[N],ans;

 inline void Update(int x)
 {
     int i;
     for(i=; i*i<x; ++i)
         if(x%i==) cnt[i]++,cnt[x/i]++;
     if(i*i==x) cnt[i]++;
 }

 int Presist()
 {
     freopen("a.in","r",stdin);
     freopen("a.out","w",stdout);

     read(n);
     for(int op,x; n--; )
     {
         read(op),read(x);
         if(op==) Update(x);
         else ans^=cnt[x];
     }
     printf("%d\n",ans);
     return ;
 }

 int Aptal=Presist();
 int main(int argc,char**argv){;}

AC

 #include <cstring>
 #include <cstdio>

 #define LL long long
 inline void read(int &x)
 {
     x=; register char ch=getchar();
     for(; ch>''||ch<''; ) ch=getchar();
     for(; ch>=''&&ch<=''; ch=getchar()) x=x*+ch-'';
 }
 const int N(3e5+);

 int cnt[][N],val[N],dad[N];
 int sumedge,head[N];
 struct Edge {
     int v,next,w;
     Edge(int v=,int next=,int w=):v(v),next(next),w(w){}
 }edge[N<<];
 inline void ins(int u,int v,int w)
 {
     cnt[][u]++; cnt[][v]++;
     edge[++sumedge]=Edge(v,head[u],w); head[u]=sumedge;
     edge[++sumedge]=Edge(u,head[v],w); head[v]=sumedge;
 }

 bool vis[N];
 long long ans;

 inline void Add(int u)
 {
     for(; dad[u]; u=dad[u]) cnt[][dad[u]]++;
 }
 void DFS(int u,int fa,int pre)
 {
     for(int v,i=head[u]; i; i=edge[i].next)
     {
         v=edge[i].v;
         if(vis[v]||fa==v||edge[i].w==pre) continue;
         cnt[][v]++, dad[v]=u;
         DFS(v,u,edge[i].w); Add(v); dad[v]=;
     }
 }

 int Presist()
 {
     freopen("b.in","r",stdin);
     freopen("b.out","w",stdout);
     int n; read(n);
     for(int i=; i<=n; ++i) read(val[i]);
     for(int u,v,w,i=; i<n; ++i)
         read(u),read(v),read(w),ins(u,v,w);
     for(int i=; i<=n; ++i)
         if(cnt[][i]==) vis[i]=,DFS(i,,);
     for(int i=; i<=n; ++i)
         if(!vis[i]) vis[i]=,DFS(i,,);
     for(int i=; i<=n; ++i)
         ans+=1ll*cnt[][i]*val[i];
     printf("%I64d\n",ans);
     return ;
 }

 int Aptal=Presist();
 int main(int argc,char**argv){;}

额。。想法有问题

 /*
 呃呃呃
 */

未完成