Poetize9
A.communicate (部分分搞了90,仙人掌我哪会啊。。)
B.queue 暴力(被我暴力水过了???)
C.signal 位运算+瞎搞?(ll加错地方,爆0滚粗(还好有暴力40分)
A
90分版
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 10010
#define M 12010
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*f;
}
int n,m,q,h[N],num=0,fa[N][20],dep[N],tot=0,Log[N];
ll dis[N],d[1010][1010];
bool vis[N],exist[N][N];
struct edge{
int to,next,val;
}data[M<<1];
struct Edge{
int u,v,val;
}cir[2010];
inline void add(int x,int y,int val){
if(exist[x][y]) return;
cir[++tot].u=x;cir[tot].v=y;cir[tot].val=val;
exist[x][y]=exist[y][x]=1;
}
void dfs(int x){
vis[x]=1;
for(int i=1;i<=n;++i){
if(!fa[x][i-1]) break;
fa[x][i]=fa[fa[x][i-1]][i-1];
}
for(int i=h[x];i;i=data[i].next){
int y=data[i].to;if(y==fa[x][0]) continue;
if(vis[y]){add(x,y,data[i].val);continue;}
fa[y][0]=x;dep[y]=dep[x]+1;dis[y]=dis[x]+data[i].val;dfs(y);
}
}
inline int lca(int x,int y){
if(dep[x]<dep[y]) swap(x,y);
int t=dep[x]-dep[y];
for(int i=Log[t];i>=0;--i)
if(t&(1<<i)) x=fa[x][i];
if(x==y) return x;
for(int i=Log[n];i>=0;--i)
if(fa[x][i]!=fa[y][i]) x=fa[x][i],y=fa[y][i];
return fa[x][0];
}
void spfa(int s){
queue<int>qu;memset(vis,0,sizeof(vis));memset(d[s],inf,sizeof(d[s]));
qu.push(s);d[s][s]=0;vis[s]=1;
while(!qu.empty()){
int x=qu.front();qu.pop();vis[x]=0;
for(int i=h[x];i;i=data[i].next){
int y=data[i].to;
if(d[s][x]+data[i].val<d[s][y]){
d[s][y]=d[s][x]+data[i].val;if(!vis[y]) vis[y]=1,qu.push(y);
}
}
}
}
void solve0(){
for(int i=1;i<=n;++i) spfa(i);
while(q--){
int x=read(),y=read();printf("%lld\n",d[x][y]);
}
}
int main(){
// freopen("communicate1.in","r",stdin);
n=read();m=read();q=read();Log[0]=-1;
for(int i=1;i<=n;++i) Log[i]=Log[i>>1]+1;
for(int i=1;i<=m;++i){
int x=read(),y=read(),v=read();
data[++num].to=y;data[num].next=h[x];h[x]=num;data[num].val=v;
data[++num].to=x;data[num].next=h[y];h[y]=num;data[num].val=v;
}if(n<=1000){solve0();return 0;}dfs(1);
while(q--){
int x=read(),y=read(),t=lca(x,y);
ll res=dis[x]+dis[y]-dis[t]*2;
for(int i=1;i<=tot;++i){
int u=cir[i].u,v=cir[i].v,val=cir[i].val;
int t1=lca(u,x),t2=lca(v,y);
res=min(res,dis[x]+dis[u]-2*dis[t1]+dis[y]+dis[v]-2*dis[t2]+val);
t1=lca(v,x);t2=lca(u,y);
res=min(res,dis[x]+dis[v]-2*dis[t1]+dis[y]+dis[u]-2*dis[t2]+val);
}printf("%lld\n",res);
}return 0;
}
B
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 1000010
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*f;
}
int n,q[10000010],h=1e6+1,t=1e6,ed=1e6;
int main(){
// freopen("queue.in","r",stdin);
n=read();
while(n--){
int x=read();
if(x>0) q[--h]=x;
if(x==0){
int tmp=t;
for(int i=h;i<=tmp&&t-h+1<=n;++i) q[++t]=q[i];
}if(x==-1){
if(h>t) continue;
printf("%d\n",q[h++]);
}
}return 0;
}
C
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 1000010
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*f;
}
int n,a[N],bin[31];
ll ans1=0,ans2=0,ans3=0;
void solve0(){
for(int i=1;i<=n;++i){
int res1=a[i],res2=a[i],res3=a[i];
ans1+=res1;ans2+=res2;ans3+=res3;
for(int j=i+1;j<=n;++j){
res1^=a[j];res2&=a[j];res3|=a[j];
ans1+=res1*2,ans2+=res2*2,ans3+=res3*2;
}
}
printf("%.3f %.3f %.3f",ans1*1.0/(n*n),ans2*1.0/(n*n),ans3*1.0/(n*n));
}
int main(){
// freopen("signal.in","r",stdin);
n=read();for(int i=1;i<=n;++i) a[i]=read();
if(n<=1000){solve0();return 0;}
bin[0]=1;
for(int i=1;i<=30;++i) bin[i]=bin[i-1]<<1;
for(int i=1;i<=n;++i) ans1+=a[i];ans2=ans3=ans1;
for(int j=0;j<=30;++j){
int res=(a[1]>>j)&1;ll cnt1=0;
for(int i=2;i<=n;++i){
int x=(a[i]>>j)&1;res^=x;if(res) cnt1++;
}ans1+=cnt1*2*bin[j];
for(int i=2;i<=n;++i){
if(a[i-1]&bin[j]) cnt1=n-i+1-cnt1;
if(a[i]&bin[j]) cnt1--;
ans1+=(ll)cnt1*2*bin[j];
}
int r=2;cnt1=0;
for(int i=1;i<=n;++i){
if(!(a[i]&bin[j])) continue;
if(r<=i) r=i+1;
while(r<=n&&(a[r]&bin[j])) ++r;cnt1+=r-1-i;
}ans2+=cnt1*2*bin[j];
r=2;cnt1=0;//0的个数
for(int i=1;i<=n;++i){
if(a[i]&bin[j]) continue;
if(r<=i) r=i+1;
while(r<=n&&!(a[r]&bin[j])) ++r;cnt1+=r-1-i;
}cnt1=(ll)n*(n-1)-2*cnt1;ans3+=(ll)cnt1*bin[j];
}
printf("%.3f %.3f %.3f",ans1*1.0/((ll)n*n),ans2*1.0/((ll)n*n),ans3*1.0/((ll)n*n));
return 0;
}