![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM-ICPC世界总决赛试题分析
文章平均质量分 81
不仅仅是寻找
寻找机会
展开
-
2004 ACM-ICPC世界总决赛试题分析9-10
9#include#include#include#includechar ch;int C,Tj,Tt,i,j,k;double d,ans;int a[30],b[30];int in(){ scanf("%c",&ch); while(ch!='C' && ch!='B' && ch!='N') scanf("%c",&ch); if(ch=='C')原创 2013-05-17 13:58:30 · 932 阅读 · 0 评论 -
2008 ACM-ICPC世界总决赛试题分析4-7
4#include#include#includeconst int maxn=105;const int oo=1000000000;int test,ncp,nroad,ncm1,confdist,startisect,endisect,startdir,i,j,k;bool visit[360],chp[maxn];int ans[1005],p[1005];int原创 2013-05-28 16:25:39 · 762 阅读 · 0 评论 -
2008 ACM-ICPC世界总决赛试题分析8-11
8#include#include#include#include#include#include#include#include#include#define X first#define Y secondusing namespace std;const int MAXN=300110;const int MAXM=900110;const long dou原创 2013-05-29 09:35:39 · 846 阅读 · 0 评论 -
2009 ACM-ICPC世界总决赛试题分析4-7
4#include#include#include#includeusing namespace std;int rad[11];double que[11],pi=acos(double(-1.0));bool temp[11];bool check(double p1,double p2,double p3){ if(p1>p2) swap(p1,p2);原创 2013-05-30 10:46:30 · 885 阅读 · 0 评论 -
2009 ACM-ICPC世界总决赛试题分析8-11
8#include#include#include#include#include#include#includeusing namespace std;bool used[1000],f[1000];int x[5],y[5];int q[1000000];vectorg[1000];int n,b;bool check(int x){ memset(us原创 2013-05-30 22:10:23 · 789 阅读 · 0 评论 -
2010 ACM-ICPC世界总决赛试题分析1-3
1#include#include#include#include#include#includeusing namespace std;const int MAXN=10010;struct Tmatrix{ int n,m,k,f,d; int a[MAXN]; int &get(int i,int j,int k1) { return a[i*m*k+j原创 2013-05-31 11:58:16 · 991 阅读 · 0 评论 -
2011 ACM-ICPC世界总决赛试题分析8-11
8#include#include#include#include#include#include#include#includeusing namespace std;#define PB push_backtypedef long long LL;int N,M,tot;int First[100009],Next[100009],Node[100009];i原创 2013-06-02 14:30:36 · 1197 阅读 · 0 评论 -
2010 ACM-ICPC世界总决赛试题分析4-7
4#include#include#include#include#include#include#includeusing namespace std;const int MaxN=109;const int INF=1000000000;int N,M;vector e[MaxN];vector> Go[MaxN];int A[MaxN],B[MaxN],F[Ma原创 2013-05-31 21:43:08 · 978 阅读 · 0 评论 -
2010 ACM-ICPC世界总决赛试题分析8-11
8#include#include#include#include#include#include#include#include#includeusing namespace std;#define PB push_back#define MP make_pairconst int MaxN=3009;const double Pi=acos(-1.0);in原创 2013-06-01 00:38:36 · 1388 阅读 · 0 评论 -
2011 ACM-ICPC世界总决赛试题分析1-3
1#include#include#include#include#includeusing namespace std;typedef long long LL;LL a,m;LL p,q,r,s;char str[40],str_save[40];LL num[40],A[40],num_save[40],A_temp[40];int tot_save;void原创 2013-06-01 10:47:50 · 1076 阅读 · 0 评论 -
2011 ACM-ICPC世界总决赛试题分析4-7
4#includeconst int MaxN=41;const int MOD=3214567;int N,Must,Can;int C[MaxN*3][MaxN*3];int W[MaxN*3][MaxN*3];int Cost,Answer,Upper,A,B;char Map[MaxN][MaxN];#define fo(i,a,b) for(int i=a;i<=b;原创 2013-06-01 15:23:03 · 1674 阅读 · 0 评论 -
2008 ACM-ICPC世界总决赛试题分析1-3
1#include#include#includeconst int Direction[6][3]={1,0,0, -1,0,0, 0,1,0, 0,-1,0, 0,0,1, 0,0,-1};struct node{ int x,y,z,face;};const int xMax=20;const int yMax=20;const int zMax=20;boo原创 2013-05-27 15:59:03 · 945 阅读 · 0 评论 -
2007 ACM-ICPC世界总决赛试题分析8-10
8#include#include#include#includeint N,T;long double pos[305][3];int Graph[305][305];int Tri[1005][3];long double Area[1005];long double allX[1000005];long double pool[2][1005];long dou原创 2013-05-26 22:49:17 · 1046 阅读 · 0 评论 -
2005 ACM-ICPC世界总决赛试题分析1-3
1#include#includestruct line{ double x1,y1,x2,y2;};struct point{ double x,y;};const double delta=1e-6;bool ok;int T,n,m,i,j,k;double scale;point pL,pS;line tL;line L[60],S[60],SN[6原创 2013-05-18 00:24:49 · 987 阅读 · 0 评论 -
2005 ACM-ICPC世界总决赛试题分析4-7
4#include#include#include#includeint go[52],correct[11][52],card[52],next[52],err[11],ans[11],n,i,j,dfs,errors,best,cases,s;void anti_shuffle(int n){ int tmp[52],i; for(i=0;i<52;i++) tm原创 2013-05-18 16:05:39 · 914 阅读 · 0 评论 -
2004 ACM-ICPC世界总决赛试题分析1-4
1#include#include#includestruct info{ int x,y,len,wait,dir;};const int MaxN=50;const int MaxM=100;const int MaxL=250;const int Add[4][2]={-1,0,0,1,1,0,0,-1};int N,cases,n,m,D,Rs,fin,s原创 2013-05-14 00:54:33 · 777 阅读 · 0 评论 -
2005 ACM-ICPC世界总决赛试题分析8-10
8#include#include#includeconst int MaxN=15;int n,ans,cases;int a[MaxN+1][MaxN+1],Lx[MaxN],Ly[MaxN+1],matchY[MaxN+1];bool usedX[MaxN+1],usedY[MaxN+1];bool path(int r){ int i; usedX[r]=tr原创 2013-05-19 10:34:16 · 787 阅读 · 0 评论 -
2006 ACM-ICPC世界总决赛试题分析1-3
1#includeconst int Max_City=200;const int Max_Ticket=20;const int Max_TicketLength=10;const int Max_TripLength=10;struct info{ int cost,n; int city[Max_TicketLength];};int cases,NT,NI,i,j,k原创 2013-05-20 00:39:53 · 1701 阅读 · 0 评论 -
2004 ACM-ICPC世界总决赛试题分析4-8
5#include#include#includeint n,m,i,j,a,b,cases,no_quotes,st[101],ed[101];int days[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};char c[147000];int leap(int y){ return y%400==0||y%4==0&&y%100原创 2013-05-16 00:16:39 · 629 阅读 · 0 评论 -
2006 ACM-ICPC世界总决赛试题分析4-7
4#includeint ones[9999],tens[999],n,i,j,k,s,t,best_i,best_j,best_s,best_t;bool ck(){ int p,q,r; if(i>5) return 1; p=s; r=t; for(q=0;q<j;q++) p=p*10+s; for(q=0;q<i-j;q++) p=p*10; for(q=原创 2013-05-21 09:48:35 · 606 阅读 · 0 评论 -
2006 ACM-ICPC世界总决赛试题分析8-10
8#include#include#includestruct info{ int sign; int up,down,uCover,dCover; int sum;};const int MaxN=64;int Cases,N,n,m,K,ans;char dir;info hor[MaxN+2][MaxN+1],ver[MaxN+1][MaxN+2];info原创 2013-05-22 10:20:37 · 648 阅读 · 0 评论 -
2007 ACM-ICPC世界总决赛试题分析1-3
1#include#include#includeusing namespace std;const double pi=acos(-1.0);double ans1,ans2,X,tmp;int cases,n,i,j,th,x,y;int point[11000][2];double angle[31000];int main(){ cases=0; while原创 2013-05-23 23:02:28 · 621 阅读 · 0 评论 -
2007 ACM-ICPC世界总决赛试题分析4-7
4#includeconst int ABO[4][4][4]={1,0,0,1, 1,1,1,1, 1,1,1,0, 1,0,0,1, 1,1,1,1, 0,1,0,1, 1,1,1,0, 0,1,0,1, 1,1,1,0, 1,1,1,0, 1,1,1,0, 1,1,0,0, 1,0,0,1, 0,1,0,1, 1,1,0,0, 0,0,0,1};原创 2013-05-23 10:19:16 · 808 阅读 · 0 评论 -
2009 ACM-ICPC世界总决赛试题分析1-3
1#include#include#include#include#include#include#include#includeusing namespace std;struct node{ int x,y;};node a[10];int s[10],c[10];int n;bool check1(double mid){ double k=a[c[原创 2013-05-30 01:21:13 · 849 阅读 · 0 评论