zoukankan      html  css  js  c++  java
  • codeforce 266c Below the Diagonal 矩阵变换 (思维题)

    C. Below the Diagonal

    You are given a square matrix consisting of n rows and n columns. We assume that the rows are numbered from 1 to n from top to bottom and the columns are numbered from 1 to n from left to right. Some cells (n - 1 cells in total) of the the matrix are filled with ones, the remaining cells are filled with zeros. We can apply the following operations to the matrix:

    1. Swap i-th and j-th rows of the matrix;
    2. Swap i-th and j-th columns of the matrix.

    You are asked to transform the matrix into a special form using these operations. In that special form all the ones must be in the cells that lie below the main diagonal. Cell of the matrix, which is located on the intersection of the i-th row and of the j-th column, lies below the main diagonal if i > j.

    Input

    The first line contains an integer n (2 ≤ n ≤ 1000) — the number of rows and columns. Then follow n - 1 lines that contain one's positions, one per line. Each position is described by two integers xk, yk (1 ≤ xk, yk ≤ n), separated by a space. A pair (xk, yk) means that the cell, which is located on the intersection of the xk-th row and of the yk-th column, contains one.

    It is guaranteed that all positions are distinct.

    Output

    Print the description of your actions. These actions should transform the matrix to the described special form.

    In the first line you should print a non-negative integer m (m ≤ 105) — the number of actions. In each of the next m lines print three space-separated integers t, i, j (1 ≤ t ≤ 2, 1 ≤ i, j ≤ n, i ≠ j), where t = 1 if you want to swap rows, t = 2 if you want to swap columns, and i and jdenote the numbers of rows or columns respectively.

    Please note, that you do not need to minimize the number of operations, but their number should not exceed 105. If there are several solutions, you may print any of them.

    Examples

    input

    Copy

    2
    1 2
    

    output

    Copy

    2
    2 1 2
    1 1 2
    

    input

    Copy

    3
    3 1
    1 3
    

    output

    Copy

    3
    2 2 3
    1 1 3
    1 1 2
    

    input

    Copy

    3
    2 1
    3 2
    

    output

    Copy

    0

    这个题就让上三角矩阵没有1,想找合适的行的位置,再找合适的列的位置,一步步缩小矩阵的范围,进而求解。

    
    #include<iostream>
    #include<queue>
    #include<algorithm>
    #include<set>
    #include<cmath>
    #include<vector>
    #include<map>
    #include<stack>
    #include<bitset>
    #include<cstdio>
    #include<cstring>
    //---------------------------------Sexy operation--------------------------//
    
    #define cini(n) scanf("%d",&n)
    #define cinl(n) scanf("%lld",&n)
    #define cinc(n) scanf("%c",&n)
    #define cins(s) scanf("%s",s)
    #define coui(n) printf("%d",n)
    #define couc(n) printf("%c",n)
    #define coul(n) printf("%lld",n)
    #define debug(n) printf("%d_________________________________
    ",n);
    #define speed ios_base::sync_with_stdio(0)
    #define file  freopen("input.txt","r",stdin);freopen("output.txt","w",stdout)
    //-------------------------------Actual option------------------------------//
    
    #define Swap(a,b) a^=b^=a^=b
    #define Max(a,b) a>b?a:b
    #define Min(a,b) a<b?a:b
    #define mem(n,x) memset(n,x,sizeof(n))
    #define mp(a,b) make_pair(a,b)
    #define pb(n)  push_back(n)
    //--------------------------------constant----------------------------------//
    
    #define INF  0x3f3f3f3f
    #define maxn  100005
    #define esp  1e-9
    using namespace std;
    typedef long long ll;
    typedef pair<int,int> PII;
    //------------------------------Dividing Line--------------------------------//
    int main()
    {
        speed;
        int n,x[maxn],y[maxn],a[maxn],b[maxn],c[maxn],cnt=0;
        cin>>n;
        for(int i=1; i<n; ++i) cin>>x[i]>>y[i];
        for(int i=1; i<n; ++i)
        {
            if(x[i]!=i+1)
            {
                for(int j=i+1; j<n; j++)
                    if(x[j]==i+1)
                        x[j]=x[i];
                    else if(x[j]==x[i])
                        x[j]=i+1;
                a[cnt]=1,b[cnt]=x[i],c[cnt++]=i+1;
            }
            if(y[i]>i)
            {
                for(int j=i+1; j<n; j++)
                    if(y[j]==i) y[j]=y[i];
                    else if(y[j]==y[i])  y[j]=i;
                a[cnt]=2,b[cnt]=y[i],c[cnt++]=i;
            }
        }
        cout<<cnt<<endl;
        for(int i=0; i<cnt; ++i) cout<<a[i]<<" "<<b[i]<<" "<<c[i]<<endl;
        return 0;
    }
    
  • 相关阅读:
    javascript学习笔记(一):基础、输出、注释、引用、变量、数据类型
    black-hole《XSS的原理分析与解剖》阅读笔记
    《xss跨站脚本剖析与防御》实验笔记
    XSS和CSRF的区别
    前端常用插件、工具类库汇总(下)
    前端常用插件、工具类库汇总(上)
    前端特效【第03期】|果汁混合效果-上
    玩转 React 【第03期】:邂逅 React 组件
    前端修炼の道 | 如何成为一名合格前端开发工程师?
    前端特效【第02期】|多功能提交按钮
  • 原文地址:https://www.cnblogs.com/lunatic-talent/p/12798778.html
Copyright © 2011-2022 走看看