【CodeFores-920】 A B C E F

A - Water The Garden CodeForces

It is winter now, and Max decided it’s about time he watered the garden.

The garden can be represented as n consecutive garden beds, numbered from 1 to n. k beds contain water taps (i-th tap is located in the bed xi), which, if turned on, start delivering water to neighbouring beds. If the tap on the bed xi is turned on, then after one second has passed, the bed xi will be watered; after two seconds have passed, the beds from the segment [xi - 1, xi + 1] will be watered (if they exist); after j seconds have passed (j is an integer number), the beds from the segment [xi - (j - 1), xi + (j - 1)] will be watered (if they exist). Nothing changes during the seconds, so, for example, we can’t say that the segment [xi - 2.5, xi + 2.5] will be watered after 2.5 seconds have passed; only the segment [xi - 2, xi + 2] will be watered at that moment.

The garden from test 1. White colour denotes a garden bed without a tap, red colour — a garden bed with a tap.

The garden from test 1 after 2 seconds have passed after turning on the tap. White colour denotes an unwatered garden bed, blue colour — a watered bed.
Max wants to turn on all the water taps at the same moment, and now he wonders, what is the minimum number of seconds that have to pass after he turns on some taps until the whole garden is watered. Help him to find the answer!

Input
The first line contains one integer t — the number of test cases to solve (1 ≤ t ≤ 200).

Then t test cases follow. The first line of each test case contains two integers n and k (1 ≤ n ≤ 200, 1 ≤ k ≤ n) — the number of garden beds and water taps, respectively.

Next line contains k integers xi (1 ≤ xi ≤ n) — the location of i-th water tap. It is guaranteed that for each condition xi - 1 < xi holds.

It is guaranteed that the sum of n over all test cases doesn’t exceed 200.

Note that in hacks you have to set t = 1.

Output
For each test case print one integer — the minimum number of seconds that have to pass after Max turns on some of the water taps, until the whole garden is watered.

Example
Input
3
5 1
3
3 3
1 2 3
4 1
1
Output
3
1
4
Note
The first example consists of 3 tests:

There are 5 garden beds, and a water tap in the bed 3. If we turn it on, then after 1 second passes, only bed 3 will be watered; after 2 seconds pass, beds [1, 3] will be watered, and after 3 seconds pass, everything will be watered.
There are 3 garden beds, and there is a water tap in each one. If we turn all of them on, then everything will be watered after 1 second passes.
There are 4 garden beds, and only one tap in the bed 1. It will take 4 seconds to water, for example, bed 4.

代码

#include<cstdio>
#include<cmath>
#include<vector>
#include<algorithm>
#include<cstring>
using namespace std;
#define LL long long
#define ULL unsigned long long

const int N = 5e3+11;
const int M = 1e6+11;
const int inf =0x3f3f3f3f;
const int mod = 1e9+7;
const int inff = 0x3f3f3f3f3f3f3f3f;

int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
    while(ch>='0'&&ch<='9') { x=(x<<1)+(x<<3) +ch-'0';ch=getchar();}
    return x*f;
}

/*-------------------------------------*/

int a[N];
int main(){
    int t;t=read();
    while(t--){
        memset(a,0,sizeof(a));
        int n,k;n=read();k=read();
        for(int i=1;i<=k;i++) {
            int z;z=read();
            a[z]=1;
        }

        int ans=1;
        while(1){
            int flag=0;
            for(int i=1;i<=n;i++) if(a[i]!=0) flag++;
            if(flag==n) break;
            for(int i=1;i<=n;i++){
                if(a[i]==ans){
                    if(i-1>=1 && a[i-1]==0 ) {
                        a[i-1]=a[i]+1;
                    }
                    if(i+1<=n && a[i+1]==0){
                        a[i+1]=a[i]+1;
                    }
                }
            }
            ans++;
        }
        printf("%d\n",ans);
    }

return 0;
}

B - Tea Queue

Recently n students from city S moved to city P to attend a programming camp.

They moved there by train. In the evening, all students in the train decided that they want to drink some tea. Of course, no two people can use the same teapot simultaneously, so the students had to form a queue to get their tea.

i-th student comes to the end of the queue at the beginning of li-th second. If there are multiple students coming to the queue in the same moment, then the student with greater index comes after the student with lesser index. Students in the queue behave as follows: if there is nobody in the queue before the student, then he uses the teapot for exactly one second and leaves the queue with his tea; otherwise the student waits for the people before him to get their tea. If at the beginning of ri-th second student i still cannot get his tea (there is someone before him in the queue), then he leaves the queue without getting any tea.

For each student determine the second he will use the teapot and get his tea (if he actually gets it).

Input
The first line contains one integer t — the number of test cases to solve (1 ≤ t ≤ 1000).

Then t test cases follow. The first line of each test case contains one integer n (1 ≤ n ≤ 1000) — the number of students.

Then n lines follow. Each line contains two integer li, ri (1 ≤ li ≤ ri ≤ 5000) — the second i-th student comes to the end of the queue, and the second he leaves the queue if he still cannot get his tea.

It is guaranteed that for every condition li - 1 ≤ li holds.

The sum of n over all test cases doesn’t exceed 1000.

Note that in hacks you have to set t = 1.

Output
For each test case print n integers. i-th of them must be equal to the second when i-th student gets his tea, or 0 if he leaves without tea.

Example
Input
2
2
1 3
1 4
3
1 5
1 1
2 3
Output
1 2
1 0 2
Note
The example contains 2 tests:

During 1-st second, students 1 and 2 come to the queue, and student 1 gets his tea. Student 2 gets his tea during 2-nd second.
During 1-st second, students 1 and 2 come to the queue, student 1 gets his tea, and student 2 leaves without tea. During 2-nd second, student 3 comes and gets his tea.

代码

#include<cstdio>
#include<cmath>
#include<vector>
#include<algorithm>
#include<cstring>
using namespace std;
#define LL long long
#define ULL unsigned long long

const int N = 5e3+11;
const int M = 1e6+11;
const int inf =0x3f3f3f3f;
const int mod = 1e9+7;
const int inff = 0x3f3f3f3f3f3f3f3f;

int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
    while(ch>='0'&&ch<='9') { x=(x<<1)+(x<<3) +ch-'0';ch=getchar();}
    return x*f;
}

/*-------------------------------------*/

int main(){
    int t;t=read();
    while(t--){
        int n;n=read();
        int id=1;
        for(int i=1;i<=n;i++) {
            int ans;
            int s,t; s=read();t=read();
            if(id==s) ans=id;
            else if(id>s && id<=t) ans=id;
            else if(id<s) {
                id=s; ans=s;
            }
            else {
                ans=0; id--;
            }
            id++;
            if(i!=1) putchar(' ');
            printf("%d",ans);
        }
        puts("");
    }
return 0;
}

C - Swap Adjacent Elements

You have an array a consisting of n integers. Each integer from 1 to n appears exactly once in this array.

For some indices i (1 ≤ i ≤ n - 1) it is possible to swap i-th element with (i + 1)-th, for other indices it is not possible. You may perform any number of swapping operations any order. There is no limit on the number of times you swap i-th element with (i + 1)-th (if the position is not forbidden).

Can you make this array sorted in ascending order performing some sequence of swapping operations?

Input
The first line contains one integer n (2 ≤ n ≤ 200000) — the number of elements in the array.

The second line contains n integers a1, a2, …, an (1 ≤ ai ≤ 200000) — the elements of the array. Each integer from 1 to n appears exactly once.

The third line contains a string of n - 1 characters, each character is either 0 or 1. If i-th character is 1, then you can swap i-th element with (i + 1)-th any number of times, otherwise it is forbidden to swap i-th element with (i + 1)-th.

Output
If it is possible to sort the array in ascending order using any sequence of swaps you are allowed to make, print YES. Otherwise, print NO.

Example
Input
6
1 2 5 3 4 6
01110
Output
YES
Input
6
1 2 5 3 4 6
01010
Output
NO
Note
In the first example you may swap a3 and a4, and then swap a4 and a5.

分析：很直观 我们可以发现： 只要是连续的可以交换的区间，那么其就可以 交换到其所有的排列，所以我们将所有的可变的区间 都sort一下。最后判定一下是不是有序就好了。
代码

#include<cstdio>
#include<cmath>
#include<vector>
#include<algorithm>
#include<cstring>
using namespace std;
#define LL long long
#define ULL unsigned long long

const int N = 200000+11;
const int M = 1e6+11;
const int inf =0x3f3f3f3f;
const int mod = 1e9+7;
const int inff = 0x3f3f3f3f3f3f3f3f;

int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
    while(ch>='0'&&ch<='9') { x=(x<<1)+(x<<3) +ch-'0';ch=getchar();}
    return x*f;
}

/*-------------------------------------*/
int a[N];

char s[N];
int main(){
     int n; scanf("%d",&n);
     for(int i=0;i<n;i++) scanf("%d",&a[i]);
     scanf("%s",s); s[n-1]='0';s[n]=0;
    int l,r;
    l=0;
    while(1){
        while(s[l]!='1' && l<n ) l++;
        r=l;
        if(s[l]!='1') break;
        while(s[r]!='0'&& r<n) r++;
       // printf("%d %d\n",l,r);
        sort(a+l,a+r+1);
        if(r==n-1) break;
        l=r;
     }
     int flag=1;
     for(int i=1;i<n;i++)
        if(a[i]<a[i-1]) {
         flag=0;break;
     }
     if(flag) puts("YES");
     else puts("NO");
return 0;
}

E - Connected Components?

题解链接

F - SUM and REPLACE

题解链接