Codeforces Round #487 (Div. 2)补题博客

最新推荐文章于 2022-08-05 19:26:32 发布

ljq真的不能再吃了

最新推荐文章于 2022-08-05 19:26:32 发布

阅读量449

点赞数

分类专栏： ACM Codeforces

本文链接：https://blog.csdn.net/heucodesong/article/details/80659641

版权

ACM 同时被 2 个专栏收录

455 篇文章 0 订阅

订阅专栏

Codeforces

71 篇文章 0 订阅

订阅专栏

题意花会像两边掉叶子或者自己就是一个花瓣判断是不是偶三种花瓣一个土地上注意AABBCC

写一半的时候发现有更简单的思路就是直接找ABC连续就行了

#include <cstdio>
#include <cstring>
using namespace std;
const int MAX_N = 1024;
struct node{
    int a;
    int b;
    int c;
    int cnt;
    char d;
}arr[MAX_N];
char str[MAX_N];
int main(){
    int flag = 0;
    scanf("%s",str);
    int len = strlen(str);
    for(int i=1;i<=len;++i){
        arr[i].d=str[i-1];
        if(arr[i].d=='A'){
        arr[i-1].a=arr[i+1].a=arr[i].a=1;
        }
        if(arr[i].d=='B'){
        arr[i-1].b=arr[i+1].b=arr[i].b=2;
        }
         if(arr[i].d=='C'){
        arr[i-1].c=arr[i+1].c=arr[i].c=3;
        }
    }
    for(int i=1;i<=len;i++){
        arr[i].cnt=arr[i].a+arr[i].b+arr[i].c;
        if(arr[i].cnt==6){
            flag = 1;
            break;
        }
    }
    if(flag) printf("Yes\n");
    else printf("No\n");
    return 0;
}

题意

给你 n和p 问你这n个字符组成的字符串能不能不成为p为周期的周期串

是周期串输出No 不是周期串随便输出一组

那么我们先判断是不是周期串然后在输出的时候特殊操作一下就好先都变成0 再扫一遍

#include <cstdio>
#include <cstring>
#include <map>
using namespace std;
const int MAX_N = 1024;
int mp[MAX_N];
struct node{
   char now;
   char former;
}str[MAX_N];
int main(){
    int n,p;
    int flag = 1;
    scanf("%d%d",&n,&p);
    getchar();
    for(int i=0;i<n;++i)
    scanf("%c",&str[i].now);
    for(int i=0;i+p<n;++i){
        if((str[i].now!=str[i+p].now||((str[i].now=='.'&&str[i+p].now!='.')||(str[i].now!='.'&&str[i+p].now=='.')))||(str[i].now=='.'&&str[i+p].now=='.')){
           flag = 0;
           break;
        }
           else {
                flag = 1;
           }
    }

    //printf("|||%d\n",mp[1]);
    //printf("%d\n",flag);
    if(flag==0) {
        for(int i=0;i<n;++i)
            if(str[i].now=='.'){
                str[i].now='0';
                str[i].former='.';
            }
            else continue;
    }
    else printf("No");
    if(flag==0){
    for(int i=0;i+p<n;++i){
        if(str[i].now==str[i+p].now){
            if(str[i].former=='.'){
                str[i].now='1';
            }
            else if(str[i+p].former=='.'){
                str[i+p].now='1';
            }
        }
    }
    for(int i=0;i<n;++i)
        printf("%c",str[i].now);
    }
            printf("\n");
    return 0;
}

As the boat drifts down the river, a wood full of blossoms shows up on the riverfront.

"I've been here once," Mino exclaims with delight, "it's breathtakingly amazing."

"What is it like?"

"Look, Kanno, you've got your paintbrush, and I've got my words. Have a try, shall we?"

There are four kinds of flowers in the wood, Amaranths, Begonias, Centaureas and Dianthuses.

The wood can be represented by a rectangular grid of $n$ rows and $m$ columns. In each cell of the grid, there is exactly one type of flowers.

According to Mino, the numbers of connected components formed by each kind of flowers are $a$ , $b$ , $c$ and $d$ respectively. Two cells are considered in the same connected component if and only if a path exists between them that moves between cells sharing common edges and passes only through cells containing the same flowers.

You are to help Kanno depict such a grid of flowers, with $n$ and $m$ arbitrarily chosen under the constraints given below. It can be shown that at least one solution exists under the constraints of this problem.

Note that you can choose arbitrary $n$ and $m$ under the constraints below, they are not given in the input.

Input

The first and only line of input contains four space-separated integers $a$ , $b$ , $c$ and $d$ ( $1 \leq a, b, c, d \leq 100$ ) — the required number of connected components of Amaranths, Begonias, Centaureas and Dianthuses, respectively.

Output

In the first line, output two space-separated integers $n$ and $m$ ( $1 \leq n, m \leq 50$ ) — the number of rows and the number of columns in the grid respectively.

Then output $n$ lines each consisting of $m$ consecutive English letters, representing one row of the grid. Each letter should be among 'A', 'B', 'C' and 'D', representing Amaranths, Begonias, Centaureas and Dianthuses, respectively.

In case there are multiple solutions, print any. You can output each letter in either case (upper or lower).

     Examples 
   

       input 
      
        Copy 
      
5 3 2 1

       output 
      
        Copy 
      
4 7
DDDDDDD
DABACAD
DBABACD
DDDDDDD

       input 
      
        Copy 
      
50 50 1 1

       output 
      
        Copy 
      
4 50
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
ABABABABABABABABABABABABABABABABABABABABABABABABAB
BABABABABABABABABABABABABABABABABABABABABABABABABA
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDD

       input 
      
        Copy 
      
1 6 4 5

       output 
      
        Copy 
      
7 7
DDDDDDD
DDDBDBD
DDCDCDD
DBDADBD
DDCDCDD
DBDBDDD
DDDDDDD

Note

In the first example, each cell of Amaranths, Begonias and Centaureas forms a connected component, while all the Dianthuses form one.

$\text{[math]}$

下面这图是一个很好的思路首先我们把abcd都减减那么下面我们要做的事情就是4个25*25的区间联通快填满A B C D 然后然后隔空插你需要的比如在A插B B插C C插D D插A 代码实现

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
using namespace std;
const int MAX_N = 124;
char mp[MAX_N][MAX_N];
int main(){
   int a,b,c,d;
   scanf("%d%d%d%d",&a,&b,&c,&d);
   a--,b--,c--,d--;
   int pos=1,k=1;
   while(d){
   if(d>=12){
        if(k==1){
   for(int i=1;i<25;i+=2)
        mp[pos][i]='D';
        pos+=2;
        d-=12;
        k--;
        }
        else if(k==0){
        for(int i=2;i<=25;i+=2)
        mp[pos][i]='D';
        pos+=2;
        d-=12;
        k++;
        }
        }
   else{
        if(k==1){
    for(int i=1;i<1+d*2;i+=2)
        mp[pos][i]='D';
        d=0;
        }
        if(k==0){
        for(int i=2;i<2+d*2;i+=2)
        mp[pos][i]='D';
        d=0;
        }
   }
   }
   pos = 1;
   k=1;
      while(c){
   if(c>=12){
       if(k==1){
   for(int i=26;i<50;i+=2)
        mp[pos][i]='C';
        pos+=2;
        c-=12;
        k--;
       }
        else if(k==0){
   for(int i=27;i<=50;i+=2)
        mp[pos][i]='C';
        pos+=2;
        c-=12;
        k++;
       }
   }
   else{
        if(k==1){
    for(int i=26;i<26+c*2;i+=2)
        mp[pos][i]='C';
        c=0;
        }
        if(k==0){
        for(int i=27;i<27+c*2;i+=2)
        mp[pos][i]='C';
        c=0;
        }
   }
   }
   pos = 26;
   k=1;
      while(b){
   if(b>=12){
       if(k==1){
   for(int i=1;i<25;i+=2)
        mp[pos][i]='B';
        pos+=2;
        b-=12;
        k--;
       }
       else if(k==0){
        for(int i=2;i<=25;i+=2)
        mp[pos][i]='B';
        pos+=2;
        b-=12;
        k++;
       }
   }
   else{
        if(k==1){
    for(int i=1;i<1+b*2;i+=2)
        mp[pos][i]='B';
        b=0;
        }
        if(k==0){
        for(int i=2;i<1+b*2;i+=2)
        mp[pos][i]='B';
        b=0;
        }
   }
   }
   pos = 26;
   k=1;
      while(a){
   if(a>=12){
        if(k==1){
   for(int i=26;i<50;i+=2)
        mp[pos][i]='A';
        pos+=2;
        a-=12;
        k--;
        }
        else if(k==0){
        for(int i=27;i<=50;i+=2)
        mp[pos][i]='A';
        pos+=2;
        a-=12;
        k++;
        }
   }
   else{
        if(k==1){
    for(int i=26;i<26+a*2;i+=2)
        mp[pos][i]='A';
        a=0;
        }
        if(k==0){
        for(int i=27;i<27+a*2;i+=2)
        mp[pos][i]='A';
        a=0;
        }
   }
   }
   printf("50 50\n");
   for(int i=1;i<=50;i++){
    for(int j=1;j<=50;j++){
        if(i<=25&&j<=25){
            if(mp[i][j]=='D') printf("%c",mp[i][j]);
            else printf("A");
        }
        if(i<=25&&j>25){
            if(mp[i][j]=='C') printf("%c",mp[i][j]);
            else printf("B");
            if(j==50) printf("\n");
        }
        if(i>25&&j<=25){
            if(mp[i][j]=='B') printf("%c",mp[i][j]);
            else printf("C");

        }
        if(i>25&&j>25){
            if(mp[i][j]=='A') printf("%c",mp[i][j]);
            else printf("D");
            if(j==50) printf("\n");
        }
    }
   }

   return 0;
}

学算法两个月以来第一次碰到的构造题

这是我原来的代码

#include <cstdio>
#include<iostream>
#include<math.h>
#include<stdio.h>
#include<algorithm>
#include<queue>
#include<map>
using namespace std;

char pic[55][55];
int main()
{
    ios::sync_with_stdio(false);
    int a,b,c,d;
    cin>>a>>b>>c>>d;
    int pos=0;
    while(a)
    {
        if(a>=25)
        {
            for(int i=0;i<50;i+=2) pic[pos][i]='A';
            for(int i=1;i<50;i+=2) pic[pos][i]='B';
            a-=25;
            pos++;
             for(int i=0;i<50;i++) pic[pos][i]='B';
            pos++;
        }
        else
        {
            for(int i=0;i<50;i++)   pic[pos][i]='B';
            for(int i=0;i<a*2;i+=2) pic[pos][i]='A';
            pos++;
            for(int i=0;i<50;i++) pic[pos][i]='B';
            pos++;
            break;
        }
    }
    for(int i=0;i<50;i++) pic[pos][i]='C';
    pos++;
    b--;
    while(b)
    {
        if(b>25)
        {
            for(int i=0;i<50;i+=2) pic[pos][i]='B';
            for(int i=1;i<50;i+=2) pic[pos][i]='C';
            b-=25;
            pos++;
            for(int i=0;i<50;i++) pic[pos][i]='C';
            pos++;
        }
        else
        {
            for(int i=0;i<50;i++)   pic[pos][i]='C';
            for(int i=0;i<b*2;i+=2) pic[pos][i]='B';
            pos++;
            for(int i=0;i<50;i++) pic[pos][i]='C';
            pos++;
            break;
        }
    }
    c--;
    for(int i=0;i<50;i++) pic[pos][i]='D';
    if(c==0) pic[pos][0]='C';
    pos++;
    while(c)
    {
        if(c>25)
        {
            for(int i=0;i<50;i+=2) pic[pos][i]='C';
            for(int i=1;i<50;i+=2) pic[pos][i]='D';
            c-=25;
            pos++;
            for(int i=0;i<50;i++) pic[pos][i]='D';
            pos++;
        }
        else
        {
            for(int i=0;i<50;i++)   pic[pos][i]='D';
            for(int i=0;i<c*2;i+=2) pic[pos][i]='C';
            pos++;
            pic[pos][0]='C';
            for(int i=1;i<50;i++) pic[pos][i]='D';
            pos++;
            break;
        }
    }
    for(int i=0;i<50;i++) pic[pos][i]='C';
    pos++;
    d--;
    while(d)
    {
        if(d>25)
        {
            for(int i=0;i<50;i+=2) pic[pos][i]='D';
            for(int i=1;i<50;i+=2) pic[pos][i]='C';
            d-=25;
            pos++;
            for(int i=0;i<50;i++) pic[pos][i]='C';
            pos++;
        }
        else
        {
            for(int i=0;i<50;i++)   pic[pos][i]='C';
            for(int i=0;i<d*2;i+=2) pic[pos][i]='D';
            pos++;
            for(int i=0;i<50;i++) pic[pos][i]='C';
            pos++;
            break;
        }
    }
    cout<<pos<<" "<<50<<endl;
    for(int i=0;i<pos;i++)
    {
        for(int j=0;j<50;j++)
            cout<<pic[i][j];
        cout<<endl;
    }
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}

Gathering darkness shrouds the woods and the world. The moon sheds its light on the boat and the river.

"To curtain off the moonlight should be hardly possible; the shades present its mellow beauty and restful nature." Intonates Mino.

"See? The clouds are coming." Kanno gazes into the distance.

"That can't be better," Mino turns to Kanno.

The sky can be seen as a one-dimensional axis. The moon is at the origin whose coordinate is $0$ .

There are $n$ clouds floating in the sky. Each cloud has the same length $l$ . The $i$ -th initially covers the range of $(x_{i}, x_{i} + l)$ (endpoints excluded). Initially, it moves at a velocity of $v_{i}$ , which equals either $1$ or $- 1$ .

Furthermore, no pair of clouds intersect initially, that is, for all $1 \leq i < j \leq n$ , $| x_{i} - x_{j} | \geq l$ .

With a wind velocity of $w$ , the velocity of the $i$ -th cloud becomes $v_{i} + w$ . That is, its coordinate increases by $v_{i} + w$ during each unit of time. Note that the wind can be strong and clouds can change their direction.

You are to help Mino count the number of pairs $(i, j)$ ( $i < j$ ), such that with a proper choice of wind velocity $w$ not exceeding $w_{m a x}$ in absolute value (possibly negative and/or fractional), the $i$ -th and $j$ -th clouds both cover the moon at the same future moment. This $w$ doesn't need to be the same across different pairs.

Input

The first line contains three space-separated integers $n$ , $l$ , and $w_{m a x}$ ( $1 \leq n \leq 10^{5}$ , $1 \leq l, w_{m a x} \leq 10^{8}$ ) — the number of clouds, the length of each cloud and the maximum wind speed, respectively.

The $i$ -th of the following $n$ lines contains two space-separated integers $x_{i}$ and $v_{i}$ ( $- 10^{8} \leq x_{i} \leq 10^{8}$ , $v_{i} \in {- 1, 1}$ ) — the initial position and the velocity of the $i$ -th cloud, respectively.

The input guarantees that for all $1 \leq i < j \leq n$ , $| x_{i} - x_{j} | \geq l$ .

Output

Output one integer — the number of unordered pairs of clouds such that it's possible that clouds from each pair cover the moon at the same future moment with a proper choice of wind velocity $w$ .

     Examples 
   

       input 
      
        Copy 
      
5 1 2
-2 1
2 1
3 -1
5 -1
7 -1

       output 
      
        Copy 
      
4

       input 
      
        Copy 
      
4 10 1
-20 1
-10 -1
0 1
10 -1

       output 
      
        Copy 
      
1

Note

In the first example, the initial positions and velocities of clouds are illustrated below.

$\text{[math]}$

The pairs are:

$(1, 3)$ , covering the moon at time $2.5$ with $w = - 0.4$ ;
$(1, 4)$ , covering the moon at time $3.5$ with $w = - 0.6$ ;
$(1, 5)$ , covering the moon at time $4.5$ with $w = - 0.7$ ;
$(2, 5)$ , covering the moon at time $2.5$ with $w = - 2$ .

Below is the positions of clouds at time $2.5$ with $w = - 0.4$ . At this moment, the $1$ -st and $3$ -rd clouds both cover the moon.

$\text{[math]}$

In the second example, the only pair is $(1, 4)$ , covering the moon at time $15$ with $w = 0$ .

Note that all the times and wind velocities given above are just examples among infinitely many choices.

挖坑留着补题

The cool breeze blows gently, the flowing water ripples steadily.

"Flowing and passing like this, the water isn't gone ultimately; Waxing and waning like that, the moon doesn't shrink or grow eventually."

"Everything is transient in a way and perennial in another."

Kanno doesn't seem to make much sense out of Mino's isolated words, but maybe it's time that they enjoy the gentle breeze and the night sky — the inexhaustible gifts from nature.

Gazing into the sky of stars, Kanno indulges in a night's tranquil dreams.

There is a set $S$ of $n$ points on a coordinate plane.

Kanno starts from a point $P$ that can be chosen on the plane. $P$ is not added to $S$ if it doesn't belong to $S$ . Then the following sequence of operations (altogether called a move) is repeated several times, in the given order:

Choose a line $l$ such that it passes through at least two elements in $S$ and passes through Kanno's current position. If there are multiple such lines, one is chosen equiprobably.
Move to one of the points that belong to $S$ and lie on $l$ . The destination is chosen equiprobably among all possible ones, including Kanno's current position (if it does belong to $S$ ).

There are $q$ queries each consisting of two integers $(t_{i}, m_{i})$ . For each query, you're to help Kanno maximize the probability of the stopping position being the $t_{i}$ -th element in $S$ after $m_{i}$ moves with a proper selection of $P$ , and output this maximum probability. Note that according to rule 1, $P$ should belong to at least one line that passes through at least two points from $S$ .

Input

The first line contains a positive integer $n$ ( $2 \leq n \leq 200$ ) — the number of points in $S$ .

The $i$ -th of the following $n$ lines contains two space-separated integers $x_{i}$ and $y_{i}$ ( $- 10^{4} \leq x_{i}, y_{i} \leq 10^{4}$ ) — the coordinates of the $i$ -th point in $S$ . The input guarantees that for all $1 \leq i < j \leq n$ , $(x_{i}, y_{i}) \neq (x_{j}, y_{j})$ holds.

The next line contains a positive integer $q$ ( $1 \leq q \leq 200$ ) — the number of queries.

Each of the following $q$ lines contains two space-separated integers $t$ and $m$ ( $1 \leq t_{i} \leq n$ , $1 \leq m_{i} \leq 10^{4}$ ) — the index of the target point and the number of moves, respectively.

Output

Output $q$ lines each containing a decimal number — the $i$ -th among them denotes the maximum probability of staying on the $t_{i}$ -th point after $m_{i}$ steps, with a proper choice of starting position $P$ .

Your answer will be considered correct if each number in your output differs from the corresponding one in jury's answer by at most $10^{- 6}$ .

Formally, let your answer be $a$ , and the jury's answer be $b$ . Your answer is considered correct if $| a - b | \leq 10^{- 6}$ .

     Example 
   

       input 
      
        Copy 
      
5
0
3
2
1
4
10
1
1
1
1
1
2
3
4
5
6

       output 
      
        Copy 
      
50000000000000000000
50000000000000000000
33333333333333331483
50000000000000000000
50000000000000000000
18518518518518517491
15226337448559670862
14494741655235482414
14332164812274550414
14296036624949901017

Note

The points in $S$ and possible candidates for line $l$ are depicted in the following figure.

$\text{[math]}$

For the first query, when $P = (- 1, - 3)$ , $l$ is uniquely determined to be $3 x = y$ , and thus Kanno will move to $(0, 0)$ with a probability of $\frac{1}{2}$ .

For the third query, when $P = (2, 2)$ , $l$ is chosen equiprobably between $x + y = 4$ and $x = y$ . Kanno will then move to the other four points with a probability of $\frac{1}{2} \cdot \frac{1}{3} = \frac{1}{6}$ each, or stay at $(2, 2)$ with a probability of $\frac{1}{3}$ .

挖坑留着补题

ljq真的不能再吃了

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
Codeforces Round #487 (Div. 2)补题博客

A. A Blend of Springtimetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhen the curtains are opened, a canvas unfolds outside. Kanno marvels at al...
复制链接

扫一扫