Codeforces Round #485 (Div. 2)

A：考察字符串与输入输出。签到

#include<bits/stdc++.h>
using namespace std;
bool f[7];
int read(){
    int sum = 0;bool flag = true;char c = getchar();
    while(c<'0'||c>'9')  {if(c=='-') flag = false; c = getchar();}
    while(c>='0'&&c<='9') sum = sum * 10 + c - 48 , c = getchar();
    if(flag) return sum;
     else return -sum;
}

int main(){
    string s;
    int n = read();
    for(int i = 1;i <= n;++i){
        cin>>s;
        if( s[0] == 'p' ) f[1] = true;
        if( s[0] == 'g' ) f[2] = true;
        if( s[0] == 'b' ) f[3] = true;
        if( s[0] == 'o' ) f[4] = true;
        if( s[0] == 'r' ) f[5] = true;
        if( s[0] == 'y' ) f[6] = true;
    }
    int cnt = 0;
    for(int i = 1;i <= 6;++i)
     if(!f[i]) ++cnt;
    printf("%d\n",cnt);
    if(!f[1]) printf("Power\n");
    if(!f[2]) printf("Time\n");
    if(!f[3]) printf("Space\n");
    if(!f[4]) printf("Soul\n");
    if(!f[5]) printf("Reality\n");
    if(!f[6]) printf("Mind\n");
    return 0;
}

B：考验找规律能力与判断

#include<bits/stdc++.h>
using namespace std;
long long n , m;
long long read(){
    long long sum = 0;bool flag = true;char c = getchar();
    while(c<'0'||c>'9')  {if(c=='-') flag = false; c = getchar();}
    while(c>='0'&&c<='9') sum = sum * 10 + c - 48 , c = getchar();
    if(flag) return sum;
     else return -sum;
}

int main(){
    n = read();m = read();
    bool flag = true;
    if( n > m ) swap( n , m ) , flag = false;
    if( n == m ){
        printf("=");
        exit(0);
    }
    if( n == 1 ){
        if(flag) printf("<");
         else printf(">");
        exit(0);
    }
    if( n == 2 )
     if( m == 3 ){
        if(flag) printf("<");
         else printf(">");
     }
     else
     if( m == 4 ){
        printf("=");
     }
     else{
        if(flag) printf(">");
         else printf("<");
     }
     else{
        if( n < m ) {
            if(flag) printf(">");
             else printf("<");
        }
        else{
            if(flag) printf("<");
             else printf(">");
        }
     }
    return 0;
}

C:考察基础dp

#include<bits/stdc++.h>
using namespace std;
int n;
int s[4000];
int c[4000];
int f[4000][4];
const int INF = 2e9;

int read(){
    int sum = 0;bool flag = true;char c = getchar();
    while(c<'0'||c>'9')  {if(c=='-') flag = false; c = getchar();}
    while(c>='0'&&c<='9') sum = sum * 10 + c - 48 , c = getchar();
    if(flag) return sum;
     else return -sum;
}

int main(){
    n = read();
    for(int i = 1;i <= n;++i) s[i] = read();
    for(int i = 1;i <= n;++i) c[i] = read();
    for(int i = 1;i <= n;++i){
     for(int j = 2;j <= 3;++j)
      f[i][j] = INF;
     f[i][1] = c[i];
    }
    for(int i = 1;i <= n;++i)
     for(int j = 1;j < i;++j)
        if( s[j] < s[i] ){
            f[i][2] = min( f[i][2] , f[j][1] + c[i]);
            f[i][3] = min( f[i][3] , f[j][2] + c[i]);
        }
    int ans = INF;
    for(int i = 1;i <= n;++i)
     ans = min( ans , f[i][3] );
    if( ans == INF ) printf("-1");
     else printf("%d",ans);
    return 0;
}

D：
考虑同一组的点，跑一遍bfs，更新每个点到这组数的距离
$O（k(n+m))$
然后你会发现更新答案时间复杂度炸了？
使用强大的$nth$_$element()$
然后就能过了

#include<bits/stdc++.h>
using namespace std;
int n , m , k , s , linkk[100100] , t , a[100100];
int dis[100100][110];
bool vis[100100];
struct node{
    int n , y;
}e[201000];

int read(){
    int sum = 0;bool flag = true;char c = getchar();
    while(c<'0'||c>'9')  {if(c=='-') flag = false; c = getchar();}
    while(c>='0'&&c<='9') sum = sum * 10 + c - 48 , c = getchar();
    if(flag) return sum;
     else return -sum;
}

void insert( int x , int y ){
    e[++t].y = y;e[t].n = linkk[x];linkk[x] = t;
    e[++t].y = x;e[t].n = linkk[y];linkk[y] = t;
    return;
}

void init(){
    n = read();m = read();k = read();s = read();
    for(int i = 1;i <= n;++i) a[i] = read();
    for(int i = 1;i <= m;++i){
        int x = read() , y = read();
        insert( x , y );
    }
    return;
}

void bfs(int x){
    queue<int>q;
    memset( vis , 0 , sizeof(vis));
    for(int i = 1;i <= n;++i)
     if( a[i] == x ) q.push(i) , vis[i] = true , dis[i][x] = 0;
    while(q.size()){
        int v = q.front();
        for(int i = linkk[v];i;i = e[i].n)
         if(!vis[e[i].y]){
            q.push( e[i].y );
            vis[e[i].y] = true;
            dis[e[i].y][x] = dis[v][x] + 1;
         }
        q.pop();
    }
    return;
}
void print(){
    for(int i = 1;i <= n;++i){
        nth_element(dis[i] + 1, dis[i] + s,dis[i] + k + 1);
        int ans = 0;
        for(int j = 1;j <= s;++j)
          ans += dis[i][j];
        printf("%d ",ans);
    }
    return;
}
int main(){
    init();
    for(int i =  1;i <= k;++i)
     bfs(i);
    print();
    return 0;
}

E：
首先显然$3n$和$7n+1$的奇偶性不同
大力猜结论，显然每一次交换会使奇偶性改变，也就是给定一组数，它转换到全排列的所需步骤数的奇偶性是确定的，否则你将无法解决这道题
暴力的模拟一种情况，贪心的将不合法位置的移动一下
然后按照模拟出来这种情况的奇偶性计算答案

#include<bits/stdc++.h>
using namespace std;
int n , tt;
int a[1001000];
bool f[1001000];
bool flag;
int ans;

int read(){
    int sum = 0;bool flag = true;char c = getchar();
    while(c<'0'||c>'9')  {if(c=='-') flag = false; c = getchar();}
    while(c>='0'&&c<='9') sum = sum * 10 + c - 48 , c = getchar();
    if(flag) return sum;
     else return -sum;
}

void dfs(int deep,int num){
    if( num == n ) {
        tt = deep;
        flag = true;
        return;
    }
    for(int i = 1;i <= n;++i)
     if(!f[i]){
        int j = a[i];
        swap( a[i] , a[j] );
        f[j] = true;
        if( a[i] != i ) dfs( deep + 1 , num + 1 ); 
         else {
            f[i] = true;
            dfs( deep + 1 , num + 2 );
            f[i] = false;
         }
        f[j] = false;
        swap( a[i] , a[j] );
        if(flag) return;
     }
    return;
}

void init(){
    n = read();ans = n - 1;
    for(int i = 1;i <= n;++i) a[i] = read();
    int cnt = 0;
    for(int i = 1;i <= n;++i)
     if( a[i] == i ) cnt++ , f[i] = true;
    dfs( 0 , cnt );
    tt = 3 * n - tt;
    if( tt % 2 == 0) printf("Petr");
     else printf("Um_nik");
    return;
}

int main(){
    init();
    return 0;
}

F：
首先你会发现，对于一对a,b，如果他们是同一组