在本地怎么做网站,全椒做网站,不一样维度的网站,青岛建站程序前言
开学后#xff0c;新学年新气象#xff0c;学校题库也迎来了新的改动#xff0c;界面大改变#xff0c;也可以比赛了。 所以这周就有比赛了#xff0c;而在纪中被虐习惯后回来渴望继续被虐就来参加提高组模拟赛#xff08;反正今年也参加提高组#xff09; 成绩 …前言
开学后新学年新气象学校题库也迎来了新的改动界面大改变也可以比赛了。 所以这周就有比赛了而在纪中被虐习惯后回来渴望继续被虐就来参加提高组模拟赛反正今年也参加提高组 成绩
只放Rank 1∼10Rank1∼10Rank\ 1\sim10
RankRankRankPersonPersonPersonScoreScoreScore12015hjw2015hjw2015hjw20022015yjy2015yjy2015yjy14032017myself2017myself2017myself12042015lzx2015lzx2015lzx10052017xxy2017xxy2017xxy8062017xjq2017xjq2017xjq7062015trx2015trx2015trx7082015cjx2015cjx2015cjx6092017lw2017lw2017lw40102017zyc2017zyc2017zyc20102017hzb2017hzb2017hzb20102017lrz2017lrz2017lrz20102017hjq2017hjq2017hjq20 正题 T1:nssl1141,jzoj3470−T1:nssl1141,jzoj3470−T1:nssl1141,jzoj3470-最短路【SPFASPFASPFA,暴力】
博客链接:https://blog.csdn.net/Mr_wuyongcong/article/details/82529745 nssl1142,jzoj3487−nssl1142,jzoj3487−nssl1142,jzoj3487-剑与魔法【堆,贪心】
博客链接:https://blog.csdn.net/Mr_wuyongcong/article/details/82529832 T3:nssl1143,jzoj3493−T3:nssl1143,jzoj3493−T3:nssl1143,jzoj3493-三角形【排序,数学,几何】
博客链接:https://blog.csdn.net/Mr_wuyongcong/article/details/82529996 一些codecodecode T3随机数据
#includecstdlib
#includecstdio
#includectime
#define random(x) rand()%x
using namespace std;
int n,x,y,a[1000][1000];
int main()
{srand(time(0));freopen(data.in,w,stdout);n500;printf(500\n);for(int i1;in;i){xrandom(100);yrandom(100);while(a[x][y])xrandom(100),yrandom(100);a[x][y]true;printf(%d %d\n,x,y);}
} T3暴力
#includecstdio
#includealgorithm
#define N 3010
#define gcd(x,y) abs(__gcd(x,y))
using namespace std;
int n,ans,x[N],y[N];
bool check(int x1,int y1,int x2,int y2,int x3,int y3)
{if(x1x2) swap(x1,x2),swap(y1,y2);if(x1x3) swap(x1,x3),swap(y1,y3);if(x2x3) swap(x2,x3),swap(y2,y3);//if(!(y1y2y2y3||y1y2y2y3)) return true;int a1x2-x1,a2x3-x2,b1y2-y1,b2y3-y2;if(!a1!a2||!b2!b1) return false;if(!a1||!a2||!b1||!b2) return true;int g1gcd(a1,b1),g2gcd(a2,b2);a1/g1;a2/g2;b1/g1;b2/g2;if(a1a2b1b2)return false;
}
int main()
{freopen(data.in,r,stdin);freopen(data.ans1,w,stdout);scanf(%d,n);for(int i1;in;i)scanf(%d%d,x[i],y[i]);for(int i3;in;i)for(int j2;ji;j)for(int k1;kj;k)if(check(x[k],y[k],x[j],y[j],x[i],y[i])){//printf(%d,%d %d,%d %d,%d\n,x[k],y[k],x[j],y[j],x[i],y[i]);ans;}printf(%d,ans);
} T3对拍程序
#includewindows.h
#includectime
#includecstdio
using namespace std;
int main()
{while(true){system(sjxr.exe);system(sjx1.exe);double stclock();system(sjx2.exe);double edclock();if(system(fc data.ans1 data.ans2)){printf(WA);return 0;}else{printf(AC time:%0.2lf\n,ed-st);}}
} T1 WA40代码
#includecstdio
#includequeue
#includecstring
#define N 50010
using namespace std;
struct line{int to,next,w;
}a[N*2];
int n,m,x,y,w,k,s,t,f[N],v[N],tot,ls[N],ans;
queueint q;
void addl()
{scanf(%d%d%d,x,y,w);a[tot].toy;a[tot].ww;a[tot].nextls[x];ls[x]tot;
}
void spfa(int x)
{memset(f,127/3,sizeof(f));q.push(x);v[x]1;f[x]0;while(!q.empty()){int xq.front();q.pop();for(int ils[x];i;ia[i].next){int ya[i].to;if(f[x]a[i].wf[y]){f[y]f[x]a[i].w;if(!v[y]){v[y]true;q.push(y);}}}v[x]false;}
}
int main()
{scanf(%d%d%d%d%d,n,m,k,s,t);for(int i1;im;i)addl();spfa(s);for(int i1;ik;i){scanf(%d,x);if(f[x]707406378){printf(-1);return 0;}ansf[x];spfa(x);}if(f[t]707406378){printf(-1);return 0;}ansf[t];printf(%d,ans);
} T2 WA10程序
#includecstdio
#includealgorithm
#define N 200010
using namespace std;
int cnt,n,m,rp[N],e[N],get[N],ans,a[N],let,num;
char ch[2];
void up(int x)
{while(x1a[x1]a[x]){swap(a[x1],a[x]);x1;}
}
void down(int x)
{int yx1;while(ynuma[y]a[x]||y1numa[y1]a[x]){if(a[y]a[y1]) y;swap(a[x],a[y]);xy;y1;}
}
int main()
{scanf(%d,cnt);for(int i1;icnt;i){scanf(%s ,ch);if(ch[0]c){scanf(%d,rp[n]);}else scanf(%d,e[m]),get[m]n,e[m]--;}let1;num0;for(int i1;in;i){if(nume[let]||letm){a[num]rp[i];up(num);}else if(a[1]rp[i]){a[1]rp[i];down(1);}while(get[let]ilet!m){let;while(nume[let]){swap(a[1],a[num]);num--;down(1);}}}if(nume[let]){printf(-1);return 0;}int ans0;for(int i1;inum;i) ansa[i];printf(%d,ans);
} T3 WA70代码
#includecstdio
#includecstring
#includealgorithm
#define N 3010
#define gcd(x,y) abs(__gcd(x,y))
#define p 300007
#define hashmath(x,y) abs(xyx*y*y)%p
using namespace std;
int n,ans,x[N],y[N],num[p];
struct node{int a,b;
}hash[p];
int locate(node x)
{int wzhashmath(x.a,x.b);while(num[wz%p](hash[wz%p].a!x.a||hash[wz%p].b!x.b)wzp) wz;return wz%p;
}
node check(int x1,int y1,int x2,int y2)
{if(x1x2) swap(x1,x2),swap(y1,y2);int a1x2-x1,b1y2-y1;if(!a1||!b1) return (node){(bool)a1,(bool)b1};int g1gcd(a1,b1);a1/g1;b1/g1;return (node){a1,b1};
}
void tj(int x1,int y1,int x2,int y2)
{node nowcheck(x1,y1,x2,y2);int wzlocate(now);ans-num[wz];hash[wz]now;num[wz];
}
int main()
{scanf(%d,n);for(int i1;in;i)scanf(%d%d,x[i],y[i]);for(int i3;in;i){memset(num,0,sizeof(num));memset(hash,0,sizeof(hash));tj(x[i],y[i],x[1],y[1]);for(int j2;ji;j){ansj-1;tj(x[i],y[i],x[j],y[j]);}}printf(%d,ans);
} 尾声
没了
