AFatWolf's blog

An USACO probem
By AFatWolf, history, 8 years ago, In English

Recently I've been trying to solve a bronze USACO problem ( The problem is exploration — the first one at this site: http://tjsct.wikidot.com/usaco-nov07-bronze ).

After understading what do they ask, I now could easily solve it. But what if the statement changes to finding the maximum point we can reach, will there be any solutions?

Thanks in advance :D

P/s: sorry if my english are poor.

  • Vote: I like it
  • +5
  • Vote: I do not like it

»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Actually it's not greedy solution. Problem exactly asks it.

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I thought it was greesy when they choose the point nearest to point 0?

    → Reply
    • »
      »
      »
      8 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      That's the problem itself

      → Reply
      • »
        »
        »
        »
        8 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        hmm....might be... any way I still feel the solution is wrong :P

        → Reply
        • »
          »
          »
          »
          »
          8 years ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          The problem ask you to go to the point that is 1. Closest to the origin, at cordinate 0. 2. Unvisited before. So I think the solution is quite straight forward. There is no greedy in the solution, just simple implementation.

          → Reply
          • »
            »
            »
            »
            »
            »
            8 years ago, # ^ |
              Vote: I like it 0 Vote: I do not like it

            Shit, my bad :P . But if the statement change to counting what the maximum point u can reach will there be any solution ?

            → Reply
        • »
          »
          »
          »
          »
          8 years ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          THE PROBLEM IS FUCKING THIS. Problem says go to first, go to second, go to..... by distance to origin

          → Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by AFatWolf (previous revision, new revision, compare).

→ Reply