zoukankan      html  css  js  c++  java
  • (暴力)cf 6D

    D. Lizards and Basements 2
    time limit per test
    2 seconds
    memory limit per test
    64 megabytes
    input
    standard input
    output
    standard output

    This is simplified version of the problem used on the original contest. The original problem seems to have too difiicult solution. The constraints for input data have been reduced.

    Polycarp likes to play computer role-playing game «Lizards and Basements». At the moment he is playing it as a magician. At one of the last levels he has to fight the line of archers. The only spell with which he can damage them is a fire ball. If Polycarp hits the i-th archer with his fire ball (they are numbered from left to right), the archer loses a health points. At the same time the spell damages the archers adjacent to the i-th (if any) — they lose b (1 ≤ b < a ≤ 10) health points each.

    As the extreme archers (i.e. archers numbered 1 and n) are very far, the fire ball cannot reach them. Polycarp can hit any other archer with his fire ball.

    The amount of health points for each archer is known. An archer will be killed when this amount is less than 0. What is the minimum amount of spells Polycarp can use to kill all the enemies?

    Polycarp can throw his fire ball into an archer if the latter is already killed.

    Input

    The first line of the input contains three integers n, a, b (3 ≤ n ≤ 10; 1 ≤ b < a ≤ 10). The second line contains a sequence of n integers — h1, h2, ..., hn (1 ≤ hi ≤ 15), where hi is the amount of health points the i-th archer has.

    Output

    In the first line print t — the required minimum amount of fire balls.

    In the second line print t numbers — indexes of the archers that Polycarp should hit to kill all the archers in t shots. All these numbers should be between 2 and n - 1. Separate numbers with spaces. If there are several solutions, output any of them. Print numbers in any order.

    Sample test(s)
    input
    3 2 1
    2 2 2
    output
    3
    2 2 2
    input
    4 3 1
    1 4 1 1
    output
    4
    2 2 3 3
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<cstdlib>
    #include<cmath>
    #include<string>
    #include<algorithm>
    using namespace std;
    #define INF 0x7fffffff
    int n,x,y,a[110],b[110],ans[110],cnt,maxx;
    bool ok()
    {
          for(int i=1;i<=n;i++)
                if(a[i]>=0)
                      return false;
          return true;
    }
    void dfs(int t)
    {
          if(t==n)
          {
                if(ok())
                {
                     if(maxx<cnt)
                     {
                           cnt=maxx;
                           for(int i=1;i<=cnt;i++)
                                  ans[i]=b[i];
                     }
                }
                return ;
          }
          if(maxx>cnt) return ;
          if(t>2&&a[t-2]>=0) return ;
          if(a[t-1]<0) dfs(t+1);
          if(a[t-1]>=0||a[t]>=0||a[t+1]>=0)
          {
                a[t]-=x,a[t-1]-=y,a[t+1]-=y;
                b[++maxx]=t;
                dfs(t);
                maxx--;
                a[t]+=x,a[t-1]+=y,a[t+1]+=y;
          }
    }
    int main()
    {
          cnt=INF;
          scanf("%d%d%d",&n,&x,&y);
          for(int i=1;i<=n;i++)
                scanf("%d",&a[i]);
          dfs(2);
          printf("%d
    ",cnt);
          printf("%d",ans[1]);
          for(int i=2;i<=cnt;i++)
                printf(" %d",ans[i]);
          printf("
    ");
          return 0;
    }
    

      

  • 相关阅读:
    心得体悟帖---200209(效率太低的事情我是不会做的,这个可以解释我所有的行为)
    心得体悟帖---200209(顺心而动的睡觉方式(6+1或者5+2的睡觉方式))
    按钮用图片做背景hover时闪烁
    范仁义Emmet课程---1、HTML速写之Emmet语法规则
    CSS3疑难问题---5、:before和::before的区别
    reset.css是什么
    日常英语---200209(Abbreviations(Emmet Abbreviations Syntax))
    日常英语---200209(relative(layer model))
    日常英语---200209(Emmet Abbreviations Syntax)
    伪元素和伪类在chrome浏览器里面还是比较好区分的
  • 原文地址:https://www.cnblogs.com/a972290869/p/4251266.html
Copyright © 2011-2022 走看看