Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)

Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)
link http://codeforces.com/contest/801

A Vicious Keyboard

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<set>
#include<map>
#define INF 0x3f3f3f3f
using namespace std;

int main()
{
    char s[110];
    gets(s);
    int ans=0;bool flag=true;
    for(int i=0;s[i]!='\0';){
        if(s[i]=='V'&&s[i+1]=='K'){
            ans++;
            s[i]=s[i+1]=0;
            i+=2;
        }else if(flag&&i>0&&s[i]==s[i-1]){
            ans++;
            i++;
            flag=false;
        }else
            i++;
    }
    printf("%d\n",ans);
    return 0;
}

B Valued Keys

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<set>
#include<map>
#define INF 0x3f3f3f3f
using namespace std;

int main()
{
    char A[110],B[110];
    gets(A);gets(B);
    bool flag=true;
    for(int i=0;flag&&A[i];i++){
        if(A[i]<B[i]) flag=false;
    }
    if(flag) puts(B);
    else puts("-1");
    return 0;
}

C Voltage Keepsake

二分即可，sum用 long long（害我wa了）

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<set>
#include<map>
#define INF 0x3f3f3f3f
using namespace std;

const int MAXN=100010;
int a[MAXN];
int b[MAXN];
int n,p;long long sum=0;
double one=1.0;

bool check(double t){
    double T=t;
    for(int i=0;t>=0.0&&i<n;i++){
        double tim=one*b[i]/a[i];
        if(tim<T){
            double r=(T-tim)*a[i]/p;
            t-=r;
        }
    }
    return t>=0;
}

int main()
{

    scanf("%d%d",&n,&p);
    for(int i=0;i<n;i++) scanf("%d%d",&a[i],&b[i]),sum+=a[i];
    if(sum<=p){
        puts("-1");
        return 0;
    }
    double low=0.0,top=1e20;
    double eps=1e-5;
    for(int i=0;i<300;i++){
        double mid=(top+low)/2;
        if(check(mid))
            low=mid;
        else
            top=mid;
    }
    printf("%0.10f\n",top);
    return 0;
}

D Volatile Kite

做法是不难想到的，只要3个点移动后他们相对位置不变，即d>2*R （d为点到相邻点连线距离）

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<set>
#include<map>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long LL;

const int MAXN=1005;
double X[MAXN];
double Y[MAXN];
int n;

double work(){
    double ans=1e20;
    for(int i=0;i<n;i++){
        double A=Y[(i-1+n)%n]-Y[(i+1+n)%n];
        double B=X[(i+1+n)%n]-X[(i-1+n)%n];
        double C=X[(i-1+n)%n]*Y[(i+1+n)%n]-X[(i+1+n)%n]*Y[(i-1+n)%n];
        double d=abs(A*X[i]+B*Y[i]+C);
        d/=sqrt(A*A+B*B);
        ans=min(ans,d/2);
    }
    return ans;
}

int main()
{
    scanf("%d",&n);
    for(int i=0;i<n;i++) scanf("%lf%lf",&X[i],&Y[i]);
    printf("%0.10f\n",work());
    return 0;
}