zoukankan      html  css  js  c++  java
  • CF724B. Batch Sort[枚举]

    B. Batch Sort
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    You are given a table consisting of n rows and m columns.

    Numbers in each row form a permutation of integers from 1 to m.

    You are allowed to pick two elements in one row and swap them, but no more than once for each row. Also, no more than once you are allowed to pick two columns and swap them. Thus, you are allowed to perform from 0 to n + 1 actions in total. Operations can be performed in any order.

    You have to check whether it's possible to obtain the identity permutation 1, 2, ..., m in each row. In other words, check if one can perform some of the operation following the given rules and make each row sorted in increasing order.

    Input

    The first line of the input contains two integers n and m (1 ≤ n, m ≤ 20) — the number of rows and the number of columns in the given table.

    Each of next n lines contains m integers — elements of the table. It's guaranteed that numbers in each line form a permutation of integers from 1 to m.

    Output

    If there is a way to obtain the identity permutation in each row by following the given rules, print "YES" (without quotes) in the only line of the output. Otherwise, print "NO" (without quotes).

    Examples
    input
    2 4
    1 3 2 4
    1 3 4 2
    output
    YES
    input
    4 4
    1 2 3 4
    2 3 4 1
    3 4 1 2
    4 1 2 3
    output
    NO
    input
    3 6
    2 1 3 4 5 6
    1 2 4 3 5 6
    1 2 3 4 6 5
    output
    YES

    貌似交换行后再交换两个列不会得到更优解
    爆枚交换哪两列然后每行贪心
    #include <iostream>
    #include <cstdio>
    #include <algorithm>
    #include <cstring>
    #include <map>
    using namespace std;
    const int N=25,INF=1e9+5;
    inline int read(){
        char c=getchar();int x=0,f=1;
        while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
        while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
        return x*f;
    }
    int n,m,a[N][N];
    bool check(){
        for(int i=1;i<=n;i++){
            int cnt=0;
            for(int j=1;j<=m;j++) if(a[i][j]!=j) cnt++;
            if(cnt>2) return false;
        }
        return true;
    }
    int main(){
        n=read();m=read();
        for(int i=1;i<=n;i++)
            for(int j=1;j<=m;j++) a[i][j]=read();
        
        if(check()) {puts("YES");return 0;}    
        for(int i=1;i<=m;i++)
            for(int j=i+1;j<=m;j++){
                for(int z=1;z<=n;z++) swap(a[z][i],a[z][j]);
                if(check()) {puts("YES");return 0;}
                for(int z=1;z<=n;z++) swap(a[z][i],a[z][j]);    
            }
        puts("NO");
    }
     
  • 相关阅读:
    简单的Makefile
    共享库
    链接静态库
    /proc/uptime参数的意义
    磁盘挂载失败
    linux环境变量设置
    使用systemd-analyze 工具来分析各个服务进程的启动性能
    面试-2020C/C++后台开发深信服科技股份有限公司一面凉经(一问三不知,我是真的菜。。。)
    笔记-C/C++工程师面试笔记收集整理
    SpringCloud-分布式与集群的使用四(断路器Hystrix)
  • 原文地址:https://www.cnblogs.com/candy99/p/6058850.html
Copyright © 2011-2022 走看看