zoukankan      html  css  js  c++  java
  • Codeforces Round #229 (Div. 2) D

    D. Inna and Sweet Matrix
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Inna loves sweets very much. That's why she decided to play a game called "Sweet Matrix".

    Inna sees an n × m matrix and k candies. We'll index the matrix rows from 1 to n and the matrix columns from 1 to m. We'll represent the cell in the i-th row and j-th column as (i, j). Two cells (i, j) and (p, q) of the matrix are adjacent if |i - p| + |j - q| = 1. A path is a sequence of the matrix cells where each pair of neighbouring cells in the sequence is adjacent. We'll call the number of cells in the sequence the path's length.

    Each cell of the matrix can have at most one candy. Initiallly, all the cells are empty. Inna is trying to place each of the k candies in the matrix one by one. For each candy Inna chooses cell (i, j) that will contains the candy, and also chooses the path that starts in cell (1, 1) and ends in cell (i, j) and doesn't contain any candies. After that Inna moves the candy along the path from cell (1, 1) to cell (i, j), where the candy stays forever. If at some moment Inna can't choose a path for the candy, she loses. If Inna can place all the candies in the matrix in the described manner, then her penalty equals the sum of lengths of all the paths she has used.

    Help Inna to minimize the penalty in the game.

    Input

    The first line of the input contains three integers nm and k (1 ≤ n, m ≤ 50, 1 ≤ k ≤ n·m).

    Output

    In the first line print an integer — Inna's minimum penalty in the game.

    In the next k lines print the description of the path for each candy. The description of the path of the candy that is placed i-th should follow on the i-th line. The description of a path is a sequence of cells. Each cell must be written in the format (i, j), where i is the number of the row and j is the number of the column. You are allowed to print extra whitespaces in the line. If there are multiple optimal solutions, print any of them.

    Please follow the output format strictly! If your program passes the first pretest, then the output format is correct.

    Sample test(s)
    input
    4 4 4
    output
    8
    (1,1) (2,1) (2,2)
    (1,1) (1,2)
    (1,1) (2,1)
    (1,1)
    Note

    Note to the sample. Initially the matrix is empty. Then Inna follows her first path, the path penalty equals the number of cells in it — 3. Note that now no path can go through cell (2, 2), as it now contains a candy. The next two candies go to cells (1, 2) and (2, 1). Inna simply leaves the last candy at cell (1, 1), the path contains only this cell. The total penalty is: 3 + 2 + 2 + 1 = 8.

    Note that Inna couldn't use cell (1, 1) to place, for instance, the third candy as in this case she couldn't have made the path for the fourth candy.

      

       对于每1个终点其步长是固定。那么只需按步长由小至大贪心选择K个即可,输出逆序。

    #include <iostream>
    #include <stdio.h>
    #include <string>
    #include <string.h>
    #include <algorithm>
    #include <stdlib.h>
    #include <vector>
    #include <set>
    using namespace std;
    typedef long long LL ;
    
    struct Node{
           int x ;
           int y ;
           int step ;
           Node(){} ;
           Node(int X , int Y ,int S):x(X),y(Y),step(S){} ;
           friend bool operator < (const Node A ,const Node B){
                if(A.step == B.step)
                   return A.y < B.y ;
                else
                   return A.step < B.step ;
           }
    };
    
    Node node[2508] ;
    vector< pair <int , int> > my_point ;
    vector< pair <int , int> >::iterator it ;
    
    void gao(int x , int y){
         int i ;
         vector< pair <int , int> > ans ;
         vector< pair <int , int> >::iterator it ;
         ans.clear() ;
         for(i = 1 ; i <= x ; i++)
            ans.push_back(make_pair(i,1)) ;
         for(i = 2 ; i <= y ; i++)
            ans.push_back(make_pair(x,i)) ;
         it = ans.begin() ;
         printf("(%d,%d)",it->first,it->second) ;
         it++ ;
         for( ; it != ans.end() ; it++)
             printf(" (%d,%d)",it->first,it->second) ;
         puts("") ;
    }
    
    int main(){
        int i , j , n , m  , k  , x , y ,sum = 0 ,id;
        cin>>n>>m>>k ;
        my_point.clear() ;
        id = 0 ;
        for(i = 1 ; i <= n ; i++)
           for(j = 1 ; j <= m ; j++)
               node[id++] = Node(i,j,i+j-1) ;
        sort(node,node+id) ;
        for(i = k - 1 ; i >= 0 ; i--)
            sum += (node+i)->step ;
        cout<<sum<<endl ;
        for(i = k - 1 ; i >= 0 ; i--){
            sum += (node+i)->step ;
            gao((node+i)->x , (node+i)->y) ;
        }
        return 0 ;
    }
  • 相关阅读:
    关于Jupyter Notebook默认起始目录设置无效的解决方法
    关于二叉树中度为0与度为2节点数关系证明
    LeetCode第[3]题(Java):Longest Substring Without Repeating Characters 标签:Linked List
    数据结构,物理结构,存储结构,逻辑结构的区分
    条件变量 sync.Cond
    defer 的常用场景
    switch...case... 语句中的类型转换
    golang 切片和数组在for...range中的区别
    golang 并发顺序输出数字
    Golang 中哪些值是不可以寻址的
  • 原文地址:https://www.cnblogs.com/liyangtianmen/p/3550887.html
Copyright © 2011-2022 走看看