Guide to Competitive Programming

Cazaux

String Processing and Information Retrieval

et al. 2020

The hierarchical overlap graph (HOG for short) is an overlap encoding graph that efficiently represents overlaps from a given set P of n strings. A previously known algorithm constructs the HOG in O(||P || + n 2 ) time and O(||P || + n × min(n, max{|s| : s ∈ P })) space, where ||P || is the sum of lengths of the n strings in P . We present a new algorithm of O(||P || log n) time and O(||P ||) space to compute the HOG, which exploits the segment tree data structure. We also propose an alternative algorithm using O(||P || log n log log n ) time and O(||P ||) space in the word RAM model of computation.

Section: Improvement Using Segment Treementioning

confidence: 93%

“…Algorithms 2 and 3 show the algorithms to perform queries 1 and 2, respectively, in the segment tree, which use the lazy propagation technique in [19], though in [19] one computes the sum, while here we compute the minimum. If query 1 occurs, we follow the nodes recursively from top to down, starting from the root.…”

Section: Improvement Using Segment Treementioning

confidence: 99%

Efficient Construction of Hierarchical Overlap Graphs

Cazaux

String Processing and Information Retrieval

et al. 2020

“…Our algorithms use several data structures and algorithmic ideas like segment tree [50], suffix array [58], rolling hash [36], and prefix sum [23]. Let us describe them in this section.…”

Section: Toolsmentioning

confidence: 99%

“…Let ConstructSegmentTree(b) be a function that constructs and returns a segment tree for an array b in O(l) running time. We refer the readers to [50] for more details on the segment tree with range updates.…”

Section: Segment Tree With Range Updatesmentioning

confidence: 99%

Preparing to Olympiads in Informatics in Tatarstan Republic, Russia. The Experience of Kazan Federal University

HADIEV¹,

KHADIEV²

2016

IOI

In the paper we describe the part of the history of Olympiads in informatics in the Tatarstan Republic, Russia which connected with the Kazan Federal University. It began in the 80s of XX century and now there are several centres of Olympiads in informatics in Tatarstan and one of them is the Kazan Federal University. In the second part of the paper we describe the current approach to organize the lessons on informatics. The main idea is a seamless transition from "lessons 1.0"(teacher prepares all materials for students) to "lessons 2.0"(students prepare all materials for students), like the transition from Web 1.0 to Web 2.0.

Comp Applic In Engineering

“…Competitive programming is a coding competition in which the contestants not only solve coding problems concerning the strict requirements specified in the questions but also compete with the others measured by the scores based on time efficiency, correctness and penalty. Laaksonen [14] listed guides and examples on how to implement and evaluate competitive algorithms in view of efficiency and design.…”

Section: Introductionmentioning

confidence: 99%

Competitive programming in computational thinking and problem solving education

Yuen

Liu

Leong

2023

Building practical programming competency requires a long-lasting journey of discovery, trial and error, learning and improvement. This article presents essential findings of a case study of a Python programming contest with an automatic judgement system for Competitive Programming training extending the learning experiences for students in an introductory course, computational thinking and problem-solving. The benefits and challenges are discussed. Due to the coronavirus disease 2019 (COVID-19) epidemic, a hybrid model of the contest was adopted, that is, some students participated in the contest on-site, while others participated remotely. To alleviate human effort in judging the submissions, the DOMjudge platform, a web-based automatic judgement system, has been deployed as an online automatic judgement system and contest management in competitive programming. The implementation roadmap and framework were provided. The contest problems and contestants' performances were discussed. Not many junior contestants could solve at least one problem(s), and competitive computing training should be offered if the students are keen on open competitions. An empirical study was conducted to evaluate the student feedback after the contest. Preliminary results revealed that the contest offering the chance to stimulate student learning interests could enhance their independent learning, innovative thinking and problem-solving skills, and could thus lead to the overall benefits of the learning experiences, which further encourage them to participate in future contests to improve their learning and therefore enhance their employability. Employers often treasure student experiences in competitive programming events, like association for computing machinery programming contests, Google Code Jam or Microsoft Imagine Cup. Sharp vision requiring skills to tackle unseen problems within a short period is also instrumental to students planning for graduate school.