General Rules :
SciCompBlitz GC 2020
Maths & Physics Club, IIT Bombay
(Guidelines and Evaluation)
- All students from hostels would be eligible for participation.
- Hostel 15/16 students can join their respective senior hostels. They will not be evaluated separately.
- All students from H18 will be participating on behalf of their previous hostels (H7 and H8 will be paired up).
- All the female students living in H15 shall represent H10.
- There is no restriction on the number of teams allowed from each hostel. However, each team can contain a maximum of 3 members and a minimum of 1 member.
- Maths and Physics Club reserves all rights to disqualify/penalize any team based on its own judgment, in case of violation of integrity and the spirit of the contest. In any case of dispute, the decision of the managers will be final and binding.
The SciComp Blitz GC is a mid-prep GC with a total of 125 points.
- The platform for the championship is HackerRank. There are five submissions involved in the GC, all to be done on this platform.
The participants can submit their code for the challenges anytime between 9 PM on 30th October 2020 to 9 PM on 1st November 2020.
Each challenge has a predetermined score (20 points). A participant’s score depends on the number of test cases a participant’s code submission successfully passes.
If a participating team submits more than one solution per challenge, then the participant’s score will reflect the highest score achieved.
Teams are ranked by score. If two or more participating teams achieve the same score, then the tie is broken by the total time taken to submit the last solution resulting in a higher score.
Grading Scheme for Overall Hostel Points
- The maximum marks of all the challenges combined will be 100. Each challenge will have a maximum score of 20.
- A hostel will be assigned a score S, which will be the average of the marks of the top three teams.
- The following hostels will be allotted bonus marks B in the following cases:
- B = 50 for the hostel with the maximum number of teams that have each submitted at least 3 challenges passing 50% of the test cases or more.
- B = 10 for every team completing all 5 challenges in the first 24 hours of the competition, ie, from 9 PM on 30th October 2020 to 9 PM on 31st October 2020 with each challenge passing 60% of the test cases or more. If any of the five challenges are resubmitted by the team, after 9 PM on 31st October, they will not get any bonus.
- The total score will be calculated as T=0.9*S+0.1*B. The hostel will be ranked according to their T-values.
Division of GC points:
The SciComp Blitz GC is a mid-preparation GC, and X=125 GC points will be awarded. The
points will be distributed as mentioned in the general GC guidelines.
- GC points (125) will be distributed according to ranking as follows:
- 1st: 100%
- 2nd: 80%
- 3rd: 60%
- 4th: 40%
- 5th: 30%
- Participation points: 20%
All submissions are to be coded in python.
There will be a total of 5 questions:
All the questions have an equal weightage of 20 points.
2 based on Physics (JEE level)
2 based on Math (JEE level)
1 based on Logical Reasoning
The HackerRank leaderboard is generated automatically and the scores on the leaderboard will be taken as the final scores for the teams.
he HackerRank inbuilt plagiarism detector will be used and plagiarism will result in disqualification of all the teams with plagiarised answers.**
All teams have to register through the cerium form before 11:50 pm on 28th October.
The link to the private contest will be shared on 29th October via mail to the registered teams. Each team should ensure that they have a HackerRank account by then and have signed up for the contest.
Only people registered on the cerium form will be considered for evaluation.
**(HackerRank uses two algorithms for detecting plagiarism: Moss (Measure of Software Similarity) and String comparison.They find similarity in the code using both String comparison and Moss and then use a minimum of both for smaller lines of code. For longer code submissions (that contain more number of lines), precedence is given to Moss over String. Moss is an improved algorithm where it tokenizes the code and the tokenized versions of all candidates' source code is compared to identify pairs of documents which have substantial overlap. Some candidates try to change the variable name or introduce white spaces to deceive plagiarism detection. Moss typically does not work in their favor because the structure of the program is unchanged, and the number of token and line matches between the documents is still the same.)