Interactive Tasks

-
Interactive tasks are tasks where your code interacts with another program, often called a grader, rather than simply reading input and printing output. Due to this novel format, people are often scared off and avoid attempting these problems. My goal in this blog is to remove your fear towards interactive tasks.

Example

Let's start with a basic example, Guess the Number, which you can view in more detail here.

There is some hidden number and you have to interactively guess it. The hidden number is always an integer from 1 to 1000000. 

You can make queries to the grader. Each query is an integer from 1 to 1000000. There are two different responses the grader can provide:
  • "<" (without quotes), if the hidden number is less than the integer in your query,
  • ">=" (without quotes), if the hidden number is greater than or equal to the integer in your query.
When your program wants to guess the hidden number, print "! x" (without quotes), where x is the answer.

Your program is allowed to make at most 25 queries (not including printing the answer)

This is a classic problem which can be solved using binary search (which you can read about here if you're not familiar). Here is some C code which solves the problem. 

#include <stdio.h>

int main() {
    // Binary search

    int start = 1;
    int end = 1000000;
    while (start != end) {
        int mid = (start+end+1)/2;

        printf("%d\n", mid);  // Guess mid
        fflush(stdout);       // Flush stdout - more on this below

        char result[3];
        scanf(" %s", result); // Read the result from the grader

        if (result[0] == '<') {
            end = mid-1;
        } else {
            start = mid;
        }
    }

    int answer = start;

    printf("! %d\n", answer);
    fflush(stdout);    
}

You may notice that after each printf I have fflush(stdout). This is necessary in interactive tasks because of something called IO Buffering. Basically, when your program prints, this print isn't always done immediately. Instead, your code may wait until more has been printed (or your program terminates) and then print many things together. This is done automatically to speed up your code and is usually helpful, but in interactive tasks we need the print to happen immediately so that the grader can respond to our query. That's what fflush(stdout) does - it flushes the output which means your query is printed immediately. In python, this can be done using sys.stdout.flush() or by adding flush=True as a second argument to print(). In C++, this can be done with std::cout << std::flush if you're using iostream.

Testing and Debugging Interactive Tasks

One difficultly of interactive tasks is testing. The most obvious way to test your code is for you to act as the grader, and manually answer queries via the command line. This is usually sufficient for basic testing but can be slow and tiresome for debugging. Fortunately, many contests (for example, google code jam) provide a grader which you can use to run and test your code! Unfortunately however, many contests (for example, CodeForces rounds) do not typically provide a grader. If you need to do lots of debugging, it may be worthwhile to write one yourself. There are two ways to do this - you can write a separate grader, or build one into your solution. Here we'll show how to do both of these options.

Writing and Using a Separate Grader

To do this, you need to write a separate program which acts as the grader. This grader should read queries and print responses to those queries. The grader also needs to know the correct answer - in the grader below, it reads the answer from the file "grader.in". Here is the grader I wrote for Guess the Number. 

#include <stdio.h>
int main() {
    FILE* in = fopen("grader.in", "r");
    int answer;
    fscanf(in, "%d", &answer);

    int numGuesses = 0, guess;

    while (scanf("%d", &guess)) {
        numGuesses++;
        
        if (answer < guess) {
            printf("<\n");
        } else {
            printf(">=\n");
        }
        fflush(stdout);
    }

    scanf("! %d", &guess);

    if (guess == answer) {
        fprintf(stderr, "Correct\n");
    } else {
        fprintf(stderr, "Incorrect (guessed %d, correct answer is %d)\n", guess, answer);
    }
    fprintf(stderr, "Used %d guesses\n", numGuesses);
}
Again, it is important that we flush after printing. Additionally, notice that I have used stderr (standard error, which by default prints to the terminal similar to stdout) to print debugging messages, so that they are not confused with responses to queries. 

But how do we link this up with our solution? Well, we can use the Interactive Runner from Google Code Jam, which is available here. I recommend reading the comments to understand how to use it. The interactive runner links the output of the grader to the input of the solution, and the input of the solution to the output of the grader. Anything printed to stderr (from the grader or the solution) is still printed to the terminal, and so we will see our debugging output.

In this case, we would run our code with the grader by doing the following:

# First, compile the solution
gcc -o solution solution.c

# Then, compile the grader
gcc -o grader grader.c

# Run the solution with the grader using the interactive runner
python3 interactive_runner.py ./grader -- ./solution

Building a Grader Into Your Solution

If you do not wish to use the interactive runner, you can instead build the grader into your solution. However, it's annoying to edit the solution every time you submit, so we need a method which avoids this. In C or C++, this can be achieved by using #ifdef, which allows for conditional compiling. Let's take a look at the code. 

#include <stdio.h>
#include <string.h>

#ifdef DEBUG
int answer;
int numGuesses;
#endif

void doGuess(int guess, char* result) {
#ifdef DEBUG
// When we run our code locally, we answer the query without printing
if (answer < guess) {
sprintf(result, "<");
} else {
sprintf(result, ">=");
}
numGuesses++;
#else
// When we submit our code, we print the query and scan in the answer
printf("%d\n", guess);
fflush(stdout);
scanf(" %s", result);
#endif
}

void provideAnswer(int guess) {
#ifdef DEBUG
if (guess == answer) {
printf("Correct\n");
} else {
printf("Incorrect (guessed %d, correct answer is %d)\n", guess, answer);
}
printf("Used %d guesses\n", numGuesses);
#else
printf("! %d\n", guess);
fflush(stdout);
#endif
}

int main() {
#ifdef DEBUG
// Scan in the correct answer from stdin
scanf("%d", &answer);
#endif

// Binary search

int start = 1;
int end = 1000000;
while (start != end) {
int mid = (start+end+1)/2;

char result[3];
doGuess(mid, result);

if (result[0] == '<') {
end = mid-1;
} else {
start = mid;
}
}

provideAnswer(start);
}

If you compile the code with the compile flag -DDEBUG (e.g. using gcc -o solution solution.c -DDEBUG), then the code within the #ifdef DEBUG blocks is read by the compiler and all the code within the #else blocks is ignored. If we then run the code, it will read the correct answer from stdin and all queries are answered within the code. If the code is compiled without that compile flag (e.g. when the code is judged), then code within the #ifdef DEBUG blocks is ignored and code within the #else blocks is compiled. If we run the code now, queries are printed to stdout just like our original solution did.

Adaptive Graders

In the grader that we wrote, the correct answer was predetermined. However, this will not always be the case when your code is judged! Sometimes, the grader is adaptive and will make up an answer as it goes along, trying to get your code to use as many queries as possible. Often, but not always, the problem statement will specify whether or not the grader is adaptive. When an adaptive grader is used, many solutions which use randomisation will fail because the grader will make your algorithm exhibit its worst case. 

Another Example - Guess the Array

This problem is also from codeforces, and you can see it in more detail here. 

In this problem you should guess an array a which is unknown to you. The only information you have initially is the length n of the array a. 

You can perform a query by giving two different indices i and j, and the grader will tell you a[i] + a[j].

You must find the array a using at most n queries.

3 ≤ n ≤ 5000.

I recommend spending some time thinking about how to solve this problem - it may be useful to use pen and paper. I have included some hints below if you would like them.

Hint 1:

Try solving for n = 3.

Solution to hint 1:

Do three queries. Let the results of these be x = a[1] + a[2], y = a[1] + a[3] and z = a[2] + a[3]. Notice that x + y - z = a[1] + a[2] + a[1] + a[3] - a[2] - a[3] = 2a[1], so a[1] = (x+y-z)/2. Once we have a[1], we can easily find a[2] and a[3] (a[2] = x-a[1], a[3] = y-a[1]).

Hint 2:

Using hint 1, how can we solve the full problem?

Solution to hint 2:

First, use the solution to n = 3 to find a[1], a[2] and a[3]. We can then find a[4], a[5], ..., a[n] each in one query. 

More Examples

Here are many more interactive tasks which you may find interesting:


 
 





Popular posts from this blog

Tips for Competitive Programming

-
Image
Competitive programming is by no means easy, I struggled with it for a long time. In this post I want to provide some helpful tips, which will hopefully be helpful to you at any stage in your competitive programming journey. How do I read problems? Read all the problems It is not always the case that the first problem is the easiest, because it cannot be assumed that problems are in difficulty order. Even if it was in "difficulty order", what the tutors think is difficult may be different from what you think is difficult. Read all the subtasks (this doesn't apply for contests such as ICPC) Subtasks help guide you towards observations and partial solution by presenting helpful subproblems. Note that this isn’t...
Read more

Implementation tips for competitive programming

-
Implementation tips for competitive programming It’s uncommon for code you write to work properly the first time you run it. And if you’re not careful, you can spend hours debugging and still be left with code that doesn’t work. This is especially problematic in ICPC, when you have only one computer between three people. Below are a few tips on how to improve the implementation and debugging process.  Before you start implementing Proving your solution Once you have a solution, the first step is to convince yourself it is correct. If you skip this step, you could invest a lot of time into coding only to later realise that your entire idea is incorrect. You don’t need a formal mathematical proof, just enough that you are sure it works. When doing this, try to think about the worst cases which could break your algorithm, and then reason why they do or do not.  Planning your code Once you are sure you have a correct solution, the next st...
Read more

The Art of Making Programming Problems

-
Image
Hello! Today we’ll explore the wonderful world of creating problems for programming contests. This article could be used as a sort of guide if you’re interested in writing problems yourself, but it’s intended for anyone interested in the process or philosophy behind making problems.   The scope of the article is quite broad, and in its four parts, we will discuss (1) why to make programming problems, (2) how to invent problems, (3) how to plan a contest, and (4) how to prepare problems. Do feel free to skip around if any of these topics tickle your fancy, or if you’re up for it, I invite you to read the article through from top to bottom. A lot of the thoughts presented here are based on my own modest experience with problem setting, mainly for university contests, informatics olympiads and miscellaneous educational purposes. Keep in mind that nothing I say is meant to prescribe a correct way to do things, just to describe what I’ve personally found effective for the work I’ve done...
Read more

Sqrt linked lists

-
Image
I present a (novel?) variation of a linked list, which allows for insertion, deletion and querying in worse case O(sqrt(n)) If these things interest you, you may like to look at: big O notation, otherwise known as time complexity. This is a useful method to measure how fast things are, rather than looking at the number of "steps" in the worse case. https://onecore.tech/informatics/5 skip lists, a similar variation with a randomised aspect. It is faster than mine in the average case, but slower in the worse case. https://en.wikipedia.org/wiki/Skip_list B-trees, which although are not linked lists, are faster than mine in all cases. Not to be confused with binary trees. https://en.wikipedia.org/wiki/B-tree // Written by Ryan Ong (z5419383) // on 14/04/2022 /** * Sqrt Linked List! * I want to answer these queries in about sqrt(n) steps: * - "insert this value at index i" * - "remove the value at index i" * - "what is the value ...
Read more

Introduction to Dynamic Programming

-
Image
This is a quick 5 minute easy-to-read programme, for even the least experienced programmers. So you wanna see c some new programming, or some new epic pro-gamer move s to up your competitive programming skills. Well, look no further with this CPMsoc blog on dynamic programming! Well, the obvious question is what is dynamic programming? Dynamic programming is programming that is dynamic. A quick google search would reveal (or at least according to Programiz), " technique in computer programming that helps to efficiently solve a class of problems that have overlapping subproblems and optimal substructure property ." What does this actually mean though? The paramount idea regarding dynamic programming circulates around the idea of sub-programs; essentially taking a large problem and breaking it down into smaller problems. Then, the values of the smaller-problems are saved to be used later to solve the initial, larger problem. Accordingly, the key benefit of dynamic programmin...
Read more

Introduction to Competitive Programming

-
Introduction to Competitive Programming  Have you heard your friends talk about LeetCode or Codeforces contests? Maybe you’re wondering what competitive programming is all about. Here’s what you need to know. What is Competitive Programming? Competitive Programming (CP, or sometimes known as Informatics) is an activity where we try to solve clearly defined computational problems using code. The 'competitive' part of CP comes from the numerous contests where people aim to correctly solve as many problems as possible in a fixed timeframe, typically around two to five hours. Solutions must also follow time and memory constraints which means your code needs to be both correct and efficient. These problems are thought to train and test you in three related areas: Problem solving . Algorithms and data structures , which we apply to solve problems efficiently. Implementation , the process of writing and testing code. Many people participate in competitive programming for the challeng...
Read more

Fracturing Search

-
Image
Have you ever had that insatiable urge to find the kth smallest minimum spanning subtree which of a weighted graph? (I know I have) Well look no further! This post will an exploration of fracturing search and its applications. (No prerequisite knowledge it required to understand the concepts, although it will be helpful graph theory terminology and an algorithm that solves the standard minimum spanning tree problem.) An example - finding the kth smallest value in a heap Fracturing search is a method that partitions your search space, and explores it in a way to get the "kth best" item. Let me illustrate with an example: Lets consider a heap, which is a binary tree where the value of a parent is always strictly smaller than the value of any child (this property is known as the heap invariant). For example, 1 < 2 and 1 < 7, because (1) is the parent of (2) and (7). We want to find the kth smallest value. Now is a good time to pause and think if you want to try it yourself...
Read more

Union-find Disjoint set

-
Image
Union-find Disjoint set (UFDS) is an abstract data structure that simulates a collection of elements belongs to a collection of sets, where we need to support the following two operations Determine if two element belongs to same set, Combine two disjoint set. Such a data structure can be helpful in situation such as finding connected component of a diagram, for example Kruskal's algorithm. Linked list Implementation We would want to support the above operation with decent efficiency. The main paradigm  for supporting such data structure is to choose one unique element to represent the  set. Then, a naïve approach would be using a linked list, where each node contains a  parent pointer points back to the head, which is used to represent the set . It gives  constant time to determine if two element belongs to same set by looking  up the parent pointer's address of this two element. To combine two disjoint sets, denote set S1 and set S2 . The operation would be c...
Read more