2016ACM/ICPC亚洲区大连站现场赛题解报告

最新推荐文章于 2020-01-12 03:06:28 发布

queuelovestack

最新推荐文章于 2020-01-12 03:06:28 发布

阅读量5.5k

点赞数 5

分类专栏： HDU OJ 地区赛贪心 BFS 数学文章标签： acm bfs 贪心数学概率

本文链接：https://blog.csdn.net/queuelovestack/article/details/53055418

版权

HDU OJ 同时被 3 个专栏收录

189 篇文章 1 订阅

订阅专栏

数学

32 篇文章 0 订阅

订阅专栏

贪心

21 篇文章 0 订阅

订阅专栏

此文章可以使用目录功能哟↑(点击上方[+])

下午重现了一下大连赛区的比赛,感觉有点神奇,重现时居然改了现场赛的数据范围,原本过的人数比较多的题结果重现过的变少了,而原本现场赛全场过的人最少的题重现做出的人反而多了一堆,不过还是不影响最水的6题,然而残酷的现实是6题才有机会拿铜...(╥╯^╰╥)

链接→2016ACM/ICPC亚洲区大连站-重现赛

Problem 1001 Wrestling Match

Accept: 0 Submit: 0
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

Problem Description

Nowadays, at least one wrestling match is held every year in our country. There are a lot of people in the game is "good player”, the rest is "bad player”. Now, Xiao Ming is referee of the wrestling match and he has a list of the matches in his hand. At the same time, he knows some people are good players,some are bad players. He believes that every game is a battle between the good and the bad player. Now he wants to know whether all the people can be divided into "good player" and "bad player".

Input

Input contains multiple sets of data.For each set of data,there are four numbers in the first line:N (1 ≤ N≤ 1000)、M(1 ≤M ≤ 10000)、X,Y(X+Y≤N ),in order to show the number of players(numbered 1toN ),the number of matches,the number of known "good players" and the number of known "bad players".In the next M lines,Each line has two numbersa, b(a≠b) ,said there is a game between a and b .The next line has X different numbers.Each number is known as a "good player" number.The last line contains Y different numbers.Each number represents a known "bad player" number.Data guarantees there will not be a player number is a good player and also a bad player.

Output

If all the people can be divided into "good players" and "bad players”, output "YES", otherwise output "NO".

Sample Input

Sample Output

   NO 
  
 YES

Problem Idea

解题思路:

【题意】

这个题目意思，感觉还是存疑的(￣へ￣)，我只能以本人过了此题的想法来解释

N个选手，M场摔跤比赛，已知N个选手中有X个选手是"good player"，Y个选手是"bad player"

问是否可以将N个选手划分成"good player"和"bad player"两个阵营，使得每场摔跤比赛的两位选手必定是一位来自"good player"，一位来自"bad player"

【类型】
搜索(bfs or dfs)
【分析】

有挺多人要求解释样例的，因为不太明白为啥不告诉2是哪一个阵营就无法划分阵营了？明明(1,5)和(3,4)也不知道是哪一阵营

但是，我们可以这样理解一下，即便我不知道(1,5)是属于"good player"阵营还是属于"bad player"阵营，他们只能属于一种阵营

而2是没有告诉你和其他选手的关系，那么2可以同属于两个阵营，显然这与题目要求" there will not be a player number is a good player and also a bad player"不符

好了，接下来讲做法，首先考虑已经告诉你是哪个阵营的选手A，那么和A选手比赛的选手B必定对立阵营的，若选手B和选手A是同一阵营，那显然是无法继续划分的，bfs or dfs一下，将已知阵营的选手确定

然后开始处理未知阵营但有比赛的选手，我们完全可以假设其中一方为"good player"，那么另一方就是"bad player"，接着还是bfs or dfs判断

处理完之后，再遍历一遍每个选手，看是否还有未知阵营的选手存在即可

重现的时候被自己蠢哭了，(ಥ _ ಥ)，因为每输入一个已知阵营的选手，我都会去搜索判一次，然后遇到冲突就break了，导致题目还没有完全输入就被我结束了，于是WA了好几发，心疼自己

【时间复杂度&&优化】
O(n)

题目链接→HDU 5971 Wrestling Match

Source Code

/*Sherlock and Watson and Adler*/
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<queue>
#include<stack>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<list>
#include<bitset>
#include<cmath>
#include<complex>
#include<string>
#include<algorithm>
#include<iostream>
#define eps 1e-9
#define LL long long
#define PI acos(-1.0)
#define bitnum(a) __builtin_popcount(a)
using namespace std;
const int N = 1005;
const int M = 10005;
const int inf = 1000000007;
const int mod = 1000000007;
struct edge
{
    int v,to;
}e[2*M];
struct node
{
    int u,k;
    node(){}
    node(int _u,int _k):u(_u),k(_k){}
};
int p,v[N],a[M],b[M],h[N];
bool flag;
void add_edge(int u,int v)
{
    e[p].v=v;
    e[p].to=h[u];
    h[u]=p++;
}
void bfs(int u,int k)
{
    queue<node> q;
    int i;
    v[u]=k;
    q.push(node(u,k));
    while(!q.empty())
    {
        u=q.front().u;
        k=q.front().k;
        q.pop();
        for(i=h[u];i+1;i=e[i].to)
        {
            if(v[e[i].v]==k)
            {
                flag=false;
                return ;
            }
            if(!v[e[i].v])
            {
                v[e[i].v]=-k;
                q.push(node(e[i].v,-k));
            }
        }
    }
}
int main()
{
    int n,m,x,y,s,i;
    while(~scanf("%d%d%d%d",&n,&m,&x,&y))
    {
        p=0;
        flag=true;
        memset(v,0,sizeof(v));
        memset(h,-1,sizeof(h));
        for(i=0;i<m;i++)
        {
            scanf("%d%d",&a[i],&b[i]);
            add_edge(a[i],b[i]);
            add_edge(b[i],a[i]);
        }
        for(i=0;i<x;i++)
        {
            scanf("%d",&s);
            if(v[s]==-1)
                flag=false;
            bfs(s,1);
        }
        for(i=0;i<y;i++)
        {
            scanf("%d",&s);
            if(v[s]==1)
                flag=false;
            bfs(s,-1);
        }
        for(i=0;i<m&&flag;i++)
            if(!v[a[i]]&&!v[b[i]])
                bfs(a[i],1);
        for(i=1;i<=n&&flag;i++)
            if(!v[i])
            {
                flag=false;
                break;
            }
        if(flag)
            puts("YES");
        else
            puts("NO");
    }
    return 0;
}

Problem 1004 A Simple Math Problem

Accept: 0 Submit: 0
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

Problem Description

Given two positive integers a and b,find suitable X and Y to meet the conditions:

X+Y=a

Least Common Multiple (X, Y) =b

Input

Input includes multiple sets of test data.Each test data occupies one line,including two positive integers a(1≤a≤2*10^4),b(1≤b≤10^9),and their meanings are shown in the description.Contains most of the 12W test cases.

Output

For each set of input data,output a line of two integers,representing X, Y.If you cannot find such X and Y,output one line of "No Solution"(without quotation).

Sample Input

8 
  
10780

Sample Output

   No Solution 
  
 308 490

Problem Idea

解题思路:

【题意】

给你两个整数a和b

求X和Y，满足X+Y=a，且LCM(X,Y)=b [LCM(X,Y)表示X和Y的最小公倍数]

若不存在，输出"No Solution"

否则输出X最小的解

【类型】
数学推导题
【分析】

现场赛的时候，咋看一眼感觉是水题啊，a的范围才10^4，那我枚举一下X和Y，然后判断它们的最小公倍数是不是b不就完事了？

但看做的人并不多，又仔细看了下题，发现题目组数有点多，12万，好吧，放弃暴力枚举

首先，学过最小公倍数的我们知道，两数之积等于两数的最大公约数乘最小公倍数，用式子表示如下

X*Y=LCM(X,Y)*GCD(X,Y)

于是，我们不妨假设GCD(X,Y)=k，那么我们可以知道

假设X≥Y，则

这个方程组还是好解的

无解的情况有如下三种(满足任意一种都是无解):

【时间复杂度&&优化】
O(1)

题目链接→HDU 5974 A Simple Math Problem

Source Code

/*Sherlock and Watson and Adler*/
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<queue>
#include<stack>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<list>
#include<bitset>
#include<cmath>
#include<complex>
#include<string>
#include<algorithm>
#include<iostream>
#define eps 1e-9
#define LL long long
#define PI acos(-1.0)
#define bitnum(a) __builtin_popcount(a)
using namespace std;
const int N = 1005;
const int M = 10005;
const int inf = 1000000007;
const int mod = 1000000007;
__int64 gcd(__int64 a,__int64 b)
{
    if(a%b)
        return gcd(b,a%b);
    return b;
}
int main()
{
    __int64 a,b,k,d,X,Y,s;
    while(~scanf("%I64d%I64d",&a,&b))
    {
        k=gcd(a,b);
        d=a*a-4*k*b;
        if(d<0)
        {
            puts("No Solution");
            continue;
        }
        s=(__int64)sqrt(1.0*d);
        if(s*s!=d||(s+a)%2)
        {
            puts("No Solution");
            continue;
        }
        X=(s+a)/2;
        Y=a-X;
        if(X>Y)
            swap(X,Y);
        printf("%I64d %I64d\n",X,Y);

    }
    return 0;
}

Problem 1006 Detachment

Accept: 0 Submit: 0
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

Problem Description

In a highly developed alien society, the habitats are almost infinite dimensional space.

In the history of this planet,there is an old puzzle.

You have a line segment with x units’ length representing one dimension.The line segment can be split into a number of small line segments: a1,a2, … (x= a1+a2+…) assigned to different dimensions. And then, the multidimensional space has been established. Now there are two requirements for this space:

1．Two different small line segments cannot be equal ( ai≠aj when i≠j).

2．Make this multidimensional space size s as large as possible (s= a1∗a2*...).Note that it allows to keep one dimension.That's to say, the number of ai can be only one.

Now can you solve this question and find the maximum size of the space?(For the final number is too large,your answer will be modulo 10^9+7)

Input

The first line is an integer T,meaning the number of test cases.

Then T lines follow. Each line contains one integer x.

1≤T≤10^6, 1≤x≤10^9

Output

Maximum s you can get modulo 10^9+7. Note that we wants to be greatest product before modulo 10^9+7.

Sample Input

   1 
  
 4

Sample Output

4

Problem Idea

解题思路:

【题意】

给定一个自然数x，让你给出一种拆分方式x=a1+a2+...(ai≠aj)，使得每个小部分的乘积s=a1*a2*...最大

【类型】
贪心构造
【分析】

此题关键在于得出如何能使乘积s最大

按照以往经验，必然是取一段连续自然数能够使得乘积最大，而这段连续自然数可从2开始(为啥不从1开始?从1开始还不如将这个1给这段连续自然数的最后一个数)，于是我们可以得到形如2+3+4+...+k(k=2,3,...)的式子，而x是10^9内的任意整数，我们不可能恰好能够凑成连续自然数之和，可能会多出△x

而这个△x的值，我可以保证它的范围为0≤△x≤k，相信大于等于0还是好理解的，为什么会小于等于k呢?因为当它大于k时，原式不是可以增加一项?即2+3+4+...+k+(k+1)

那么多出来的△x怎么处理呢?显然是从后往前均摊给连续自然数中的(k-1)个数，为啥从后往前?因为若我们从前往后，总是会使连续自然数重复，不好处理

于是，在我们分配完△x之后，我们大致会得到下述两种式子:

①2*3*...*(i-1)*(i+1)*...*k*(k+1)

②3*4*...*i*(i+1)*...*k*(k+2)

显然，我们要计算此结果，可以借助阶乘，而阶乘中缺失的项，我们除掉就可以了，那么便会涉及除法取模，显然需要用到乘法逆元

做法讲解完毕，以下是为什么连续段乘积最大的大概证明:

【时间复杂度&&优化】
O(logn)

题目链接→HDU 5976 Detachment

Source Code

/*Sherlock and Watson and Adler*/
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<queue>
#include<stack>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<list>
#include<bitset>
#include<cmath>
#include<complex>
#include<string>
#include<algorithm>
#include<iostream>
#define eps 1e-9
#define LL long long
#define PI acos(-1.0)
#define bitnum(a) __builtin_popcount(a)
using namespace std;
const int N = 45000;
const int M = 10005;
const int inf = 1000000007;
const int mod = 1000000007;
__int64 inv[N]={0,1};//逆元筛
__int64 f[N]={1,1};//阶乘
int main()
{
    int t,i,x,l,r,mid,k;
    __int64 ans;
    for(i=2;i<N;i++)
    {
        inv[i]=inv[mod%i]*(mod-mod/i)%mod;
        f[i]=(f[i-1]*i)%mod;
    }
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&x);
        if(x<=1)
        {
            printf("%d\n",x);
            continue;
        }
        l=k=2,r=N;
        while(l<=r)
        {
            mid=(l+r)/2;
            if((mid+2)*(mid-1)/2<=x)
                l=mid+1,k=max(k,mid);
            else
                r=mid-1;
        }
        //printf("%d\n",k);
        x-=(k+2)*(k-1)/2;
        if(x==k)//3*4*...*(k-1)*k*(k+2)
            ans=(f[k]*inv[2])%mod*(k+2)%mod;
        else if(x==0)
            ans=f[k];
        else
            ans=(f[k+1]*inv[k-x+1])%mod;
        printf("%I64d\n",ans);
    }
    return 0;
}

Problem 1008 To begin or not to begin

Accept: 0 Submit: 0
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

Problem Description

A box contains black balls and a single red ball. Alice and Bob draw balls from this box without replacement, alternating after each draws until the red ball is drawn. The game is won by the player who happens to draw the single red ball. Bob is a gentleman and offers Alice the choice of whether she wants to start or not. Alice has a hunch that she might be better off if she starts; after all, she might succeed in the first draw. On the other hand, if her first draw yields a black ball, then Bob’s chances to draw the red ball in his first draw are increased, because then one black ball is already removed from the box. How should Alice decide in order to maximize her probability of winning? Help Alice with decision.

Input

Multiple test cases (number of test cases≤50), process till end of input.

For each case, a positive integer k (1≤k≤10^5) is given on a single line.

Output

For each case, output:

1, if the player who starts drawing has an advantage

2, if the player who starts drawing has a disadvantage

0, if Alice's and Bob's chances are equal, no matter who starts drawing

on a single line.

Sample Input

   1 
  
 2

Sample Output

   0 
  
 1

Problem Idea

解题思路:

【题意】

箱子里有1个红球和k个黑球

Alice和Bob轮流不放回地从箱子里随机取出一个球

当某人取到红球时获得胜利，游戏结束

问先手是否获胜几率更大，几率更大，输出"1"；几率更小，输出"2"；几率相等，输出"0"

【类型】
概率水题
【分析】

此题关键还是要多尝试，手动计算一下

当k=1时，一个红球和一个黑球，先手获胜的概率P为

当k=2时，一个红球和两个黑球，先手获胜的概率P为

当k=3时，一个红球和三个黑球，先手获胜的概率P为

故，当k时，先手获胜的概率P为

那我只需判断两者大小关系即可

【时间复杂度&&优化】
O(1)

题目链接→HDU 5978 To begin or not to begin

Source Code

/*Sherlock and Watson and Adler*/
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<queue>
#include<stack>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<list>
#include<bitset>
#include<cmath>
#include<complex>
#include<string>
#include<algorithm>
#include<iostream>
#define eps 1e-9
#define LL long long
#define PI acos(-1.0)
#define bitnum(a) __builtin_popcount(a)
using namespace std;
const int N = 5005;
const int M = 100005;
const int inf = 1000000007;
const int mod = 1000000007;
const int MAXN = 100005;
int main()
{
    int k,p;
    while(~scanf("%d",&k))
    {
        p=k/2+1;
        if(p>k+1-p)
            puts("1");
        else if(p<k+1-p)
            puts("2");
        else
            puts("0");
    }
    return 0;
}

Problem 1009 Convex

Accept: 0 Submit: 0
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

Problem Description

We have a special convex that all points have the same distance to origin point.
As you know we can get N segments after linking the origin point and the points on the convex. We can also get N angles between each pair of the neighbor segments.

Now give you the data about the angle, please calculate the area of the convex

Input

There are multiple test cases.

The first line contains two integer N and D indicating the number of the points and their distance to origin. (3 <= N <= 10, 1 <= D <= 10)

The next lines contain N integers indicating the angles. The sum of the N numbers is always 360.

Output

For each test case output one float numbers indicating the area of the convex. The printed values should have 3 digits after the decimal point.

Sample Input

1 
  
90 90 90 
  
1 
  
60 60 60 60 60

Sample Output

000 
  
598

Problem Idea

解题思路:

【题意】

二维坐标中有N个点，它们到原点的距离均为D

将这N个点分别与原点相连，现在告诉你任意相邻两条线段的夹角为θi，求这N个点构成的凸包面积(N边形面积)

【类型】
三角形面积水题
【分析】

题目大概样子如下

由图可知，n边形的面积可以拆分成n个三角形面积之和

而已知每个三角形的两边及两边夹角，我们可以通过三角形面积公式算出每个三角形的面积，相加之和便是最终的n边形面积

由于math.h头文件中封装的sin运算是以弧度制来计算的，而题目所给的是角度制，故我们还需多一步角度转弧度

【时间复杂度&&优化】
O(1)

题目链接→HDU 5979 Convex

Source Code

/*Sherlock and Watson and Adler*/
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<queue>
#include<stack>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<list>
#include<bitset>
#include<cmath>
#include<complex>
#include<string>
#include<algorithm>
#include<iostream>
#define eps 1e-9
#define LL long long
#define PI acos(-1.0)
#define bitnum(a) __builtin_popcount(a)
using namespace std;
const int N = 5005;
const int M = 100005;
const int inf = 1000000007;
const int mod = 1000000007;
const int MAXN = 100005;
int main()
{
    int n,d,i,x;
    double ans;
    while(~scanf("%d%d",&n,&d))
    {
        ans=0;
        for(i=0;i<n;i++)
        {
            scanf("%d",&x);
            ans+=d*d*sin(PI*x/180)/2;
        }
        printf("%.3f\n",ans);
    }
    return 0;
}

Problem 1010 Find Small A

Accept: 0 Submit: 0
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

Problem Description

As is known to all,the ASCII of character 'a' is 97. Now,find out how many character 'a' in a group of given numbers. Please note that the numbers here are given by 32 bits’ integers in the computer.That means,1digit represents 4 characters(one character is represented by 8 bits’ binary digits).

Input

The input contains a set of test data.The first number is one positive integer N (1≤N≤100),and then N positive integersai (1≤ ai≤2^32 - 1) follow

Output

Output one line,including an integer representing the number of 'a' in the group of given numbers.

Sample Input


  
24929 100

Sample Output

3

Problem Idea

解题思路:

【题意】

给你n个32位整数,每个整数可以表示成4个字符(因为一个字符在计算机中占8位)，问n个整数共包含多少个字符'a'

【类型】
签到题
【分析】

由于一个字符占二进制8位，所以每个整数相当于转化为2^8=256进制数

那么将32位整数循环对256取模，看是不是97(字符'a')即可

其中需要注意的一点是，2^32-1已经超过了int型的范围，故须定义成 __int64 或 long long

int型的最大值为2^31-1

【时间复杂度&&优化】
O(1)

题目链接→HDU 5980 Find Small A

Source Code

/*Sherlock and Watson and Adler*/
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<queue>
#include<stack>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<list>
#include<bitset>
#include<cmath>
#include<complex>
#include<string>
#include<algorithm>
#include<iostream>
#define eps 1e-9
#define LL long long
#define PI acos(-1.0)
#define bitnum(a) __builtin_popcount(a)
using namespace std;
const int N = 5005;
const int M = 100005;
const int inf = 1000000007;
const int mod = 1000000007;
const int MAXN = 100005;
int main()
{
    int n,i,ans;
    __int64 a;
    while(~scanf("%d",&n))
    {
        ans=0;
        for(i=0;i<n;i++)
        {
            scanf("%I64d",&a);
            while(a)
            {
                if(a%256==97)
                    ans++;
                a/=256;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}

菜鸟成长记