Rating changes for last rounds are temporarily rolled back. They will be returned soon. ×

kingofnumbers's blog

APIO 2013
By kingofnumbers, 13 years ago, In English

APIO 2013 (Asia-Pacific Informatics Olympiad) will take place in 11 may 2013 , I wish good luck to all participants.

here is the official site: http://apio.comp.nus.edu.sg

here is the competition rules: http://apio.comp.nus.edu.sg/APIORules.pdf

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

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

There is no Online-participation, right?

→ Reply
  • »
    »
    13 years ago, hide # ^ |
     
    Vote: I like it +3 Vote: I do not like it

    read about it in "regulations" tab in official website

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

      "Submission of Site Information Tables: 28 February 2013" does it mean that I have no chance to compete, if i just got to know about the competition?

      → Reply
      • »
        »
        »
        »
        13 years ago, hide # ^ |
        ← Rev. 5  
        Vote: I like it 0 Vote: I do not like it

        no, I don't think that it means this.

        just a few days ago Syrian delegation registered us to APIO .

        Each delegation registers its own competitors for the APIO.

        If you are a student wishing to compete,

        please contact your local informatics olympiad organisation.

        quote from http://www.apio.olympiad.org/

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

          Probably, I am blinded but I have not found any E-mail or something else I could use to contact APIO organizators.

          You know, I live in a counrty, where nobody cares about online competitions, so I would be really happy if I can participate at least out of competition.

          → Reply
          • »
            »
            »
            »
            »
            »
            13 years ago, hide # ^ |
            ← Rev. 3  
            Vote: I like it 0 Vote: I do not like it

            the only way to participate is to contact your local informatics olympiad organisation. and ask them to register you to APIO 2013

            A list of some of these organisations is available here.

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

              Imagine, I am a man from my local informatics olympiad organisation, where do I can write to register my team?

              → Reply
            • »
              »
              »
              »
              »
              »
              »
              13 years ago, hide # ^ |
              ← Rev. 2  
              Vote: I like it 0 Vote: I do not like it

              But I suppose that only applies for "officially participating countries", not just some random guys who want to try... it's called Asia-Pacific olympiad, so I doubt they'd just let any country join...

              It's not that much of a catastrophe, anyway. Just try solving the problems when they're published, I guess

              → Reply
»
13 years ago, hide # |
 
Vote: I like it +23 Vote: I do not like it

The contest has finished in all countries. Let's discuss the problems here.

robots: first, make table like this: dst[y][x][dir]:=(grid of final destination of move whose direction is dir from the grid of (y,x))

second, use breadth-first search and get costs like this: cost[id][y][x]:=(the number of moving cost of robot(_id_) to the grid (y,x))

third, build dp[low][up][y][x]:= the number of moving cost of robot id in the range of [low,up) to the grid of (y,x)

building this dp requires Dijsktra ,but using dijkstra is too slow,so I managed to use breadth-first search.

also memory limit exceeded happened to me,so I cut half memory of dp by implementation. O(w*h + w*h*n + w*h*n^3 + w*h*n^2)

toll: too difficult to me :( I only got 16 points by using 2 hours....

tasksauthor: subtask 4 and 6 is difficult(make dijkstra get TLE by using negative edge,not use negative cycle)

I have little time to solve them...

→ Reply
»
13 years ago, hide # |
 
Vote: I like it +10 Vote: I do not like it

I spend 2 hours on Toll but I could not solve it and I got only 16 points... Can someone explain the solution of Toll?

Anyway, I challenged to hack dijkstra, and I think I discovered the case, but it didn't work...

My solution　is following:

Let's define the Unit, which consist of 3 nodes, there is cost-0 edge from first point to second point, cost-enough-big edge from first point to third point, and (-(cost-enough-big)-1)-edge from third point to second point.

We can connect Units previous Unit's second point and current Unit's first point will be the same node.

When we connect them, the order of dijkstra algorithm will be O(2^(number of Units)) I think...

→ Reply
»
13 years ago, hide # |
 
Vote: I like it +5 Vote: I do not like it

T_T,APIO 2013 was a sad trip for me. I mistaken the meanings of problem robots and toll and made them much harder.

→ Reply
  • »
    »
    13 years ago, hide # ^ |
     
    Vote: I like it +1 Vote: I do not like it

    You won't believe what happened to me, for problem robot I thought that blocked gird is donated by 'X' capital but it's actually 'x' small, I spent to much time debugging then I give up search where is my bug. after contest I discovered that it's 'x' small

    → Reply
»
13 years ago, hide # |
 
Vote: I like it +6 Vote: I do not like it

Anyone knows, when the results will out?

→ Reply
»
13 years ago, hide # |
← Rev. 2  
Vote: I like it +39 Vote: I do not like it

Results

Participants

→ Reply
»
12 years ago, hide # |
← Rev. 3  
Vote: I like it 0 Vote: I do not like it

Hi, It seems the official website of APIO (http://apio.olympiad.org) is down. Also the statements aren't available in the official site of APIO 2013. So could anybody please upload the statements somewhere?

Edit: I forgot to mention that the link given in comments above doesn't work neither.

Edit2: I didn't notice that the solution file contains the statements as well. I'm sorry.

Thank you very much.

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

    "Edit2: I didn't notice that the solution file contains the statements as well. I'm sorry."

    Thank you for the information. I didn't notice that.

    → Reply