Vichitr's blog

ICPC Amritapuri Practice Session #6 [Team Contest] Announcement
By Vichitr, 3 years ago, In English

Hello Codeforces,
ICPC Amritapuri Regional will be hosting next team practice round on CodeDrills on Tuesday, 13th April 2021. There will be 5 problems to be solved in 2.5 hours.

Contest Details

Registration

  • You will need to create a team on the contest page in order to participate.
  • Team size can be upto 3.
  • While creating the team, add the registered emails of other users to invite them to join your team. They will get an invite email, ask them to accept.
  • For more details on team registration, refer this guide.

Note : Register your teams & accept invites before the start of the contest. This won't be allowed after contest starts!

Prizes

  • Cash prizes of INR 35000 for top 15 teams.
  • 1st Place — INR 5000
  • 2nd, 3rd Places — INR 4000 each
  • 4th, 5th, 6th Places — INR 3000 each
  • 7th, 8th, 9th, 10th Places — INR 2000 each
  • 11th, 12th, 13th, 14th, 15th Places — INR 1000 each
  • Only Indian participants are eligible for prizes but everyone can participate.
  • Prize money is per team.

Joining me on the problem setting panel are:

I would like to thank all of them for the round preparation. Along with them I would also like to thank

I hope you will enjoy solving the problems. Any feedback is appreciated after the contest.

Good Luck & Have Fun!
Hope to see you participating!!

UPD: Thanks for participating! Editorials(small write ups) are out!!! All AC submissions have been made public.

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

Comments Comments (31)
| Write comment?
»
3 years ago, # |
  Vote: I like it -73 Vote: I do not like it

Is it rated?

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

    Hey, we have not implemented rating system yet. Ratings would be implemented after ICPC rounds.

    Also team contests can't be made rated because of some difficulties.

    → Reply
»
3 years ago, # |
← Rev. 2   Vote: I like it -22 Vote: I do not like it

Deleted

→ Reply
»
3 years ago, # |
  Vote: I like it +18 Vote: I do not like it

It hurts when you are alone (._.)

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

Reminder: contest starts soon!

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

Are all elements in the input array distinct for the second problem ?

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

    Not necessarily.

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

      What do you actually mean by INT_MAX ? Does it mean largest number in input is : 2147483647

      I think there is some issue with one of the test files(test file 0) of problem 2 , please look into it.

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

        INT_MAX = 2147483647

        Test data looks good only.

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

          yup , got AC finally during contest . Thanks and sorry .

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

"NOTE: It will be guaranteed that the cell in row n-1 and column m-1 is always of type '2' or 'x'" Samples don't satisfy this condition

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

    We are updating the test data. As said in the announcement.

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

    Updated test data. Rejudging all the solutions.

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

Will in icpc also problems sorted according to difficulty ?

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

How to solve sorted xor problem ? Do we need to do binary search ?

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

In Dragonado and Problems

t = 1
n, m, t = 6 4 20
p[] = 5 3 2 1 4 2
a[] = 19 3 1 3
k[] = 6 4 3 3

we sort on decreasing score so here we take 6 + 4, and time is 19 + 3 = 22 which is greater than t. Can it be possible ?

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

    Not for our problem. Did you read the constraints?

    • its always possible to finish m/2 assignments which gives highest marks.
    → Reply
    • »
      »
      »
      3 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Do ICPC qualification or regionals have same difficuly as of the today's contest.

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

        Nope. Actual rounds would be more difficult. As for these practice rounds, we need to prepare in less time and also good problems are reserved for regionals, these rounds go more on easier side.

        → Reply
        • »
          »
          »
          »
          »
          3 years ago, # ^ |
          ← Rev. 2   Vote: I like it +22 Vote: I do not like it

          Will the actual round also have only 5 problems? Or can there be more?

          Edit: I mean the qualification round

          → Reply
          • »
            »
            »
            »
            »
            »
            3 years ago, # ^ |
            ← Rev. 2   Vote: I like it -19 Vote: I do not like it

            Not yet finalized but it would be 5 or 6.

            Edit: Aiming for 7 now.

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

              Please keep 7 or 8 problems in the online round. 5 or 6 problems aren't suitable for a 2.5-hour ICPC contest. 2018's online round had 5 problems and it became a speed-solving contest.

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

                ++

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

                Hey! Thanks for the suggestion. We will try to get more problems.

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

          Are you guys preparing the problems for regionals ?

          → Reply
»
3 years ago, # |
  Vote: I like it +2 Vote: I do not like it

Search doesn't seem to be working. I'm not able to search any team from the search bar on the standings page. Also, can you please add a college filter in the standings?

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

    Hi we will add filtering/searching on scoreboard before next contest.

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

When will the prizes for ICPC Amritapuri Practice session 5 get distributed?

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

    There was a slight delay in plagiarism checking of the solutions. We have completed that and will be forwarding the winner list to Amrita today. They will contact the winners for the prizes. Sorry for the delay.

    → Reply