ICPC 2018 - D. Gem Island
State the problem in your own words. Focus on the mathematical or algorithmic core rather than repeating the full statement.
Source-first archive entry
This page is built from the copied files in competitive_programming/icpc/2018/D-gem-island. Edit
competitive_programming/icpc/2018/D-gem-island/solution.tex to update the written solution and
competitive_programming/icpc/2018/D-gem-island/solution.cpp to update the implementation.
The website does not replace those files with hand-maintained HTML. It reads the copied source tree during the build and exposes the exact files below.
Problem Statement
Copied statement text kept beside the solution archive for direct reference.
Problem D
Gem Island
Time limit: 3 seconds
Gem Island is a tiny island in the middle of the Pacific Ocean. Until recently, it was known as one of the
poorest, but also most peaceful, places on Earth. Today, it is neither poor nor peaceful. What happened?
One sunny morning, not too long ago, all inhabitants of Gem Island woke up to a surprise. That morn-
ing, each of them suddenly held one sparkling gem in their hand. The gems had magically appeared
overnight. This was cause for much rejoicing – everybody was suddenly rich, they could finally afford
all the things they had ever dreamed of, and the name of their island made so much more sense now.
The next morning, one of the inhabitants woke up to another surprise – her gem had magically split into
two gems! The same thing happened on each of the following nights, when exactly one of the gems
(apparently uniformly at random among all the gems on the island) would split into two.
After a while, the inhabitants of Gem Island possessed a widely varying number of gems. Some had a
lot and many had only a few. How come some inhabitants had more gems than others? Did they cheat,
were they just lucky, or was something else at work?
The island elders have asked for your help. They want you to determine if the uneven distribution of
gems is explained by pure chance. If so, that would greatly reduce tensions on the island.
The island has n inhabitants. You are to determine the gem distribution after d nights of gem splitting.
In particular, you are interested in the expected number of gems collectively held by the r people with
the largest numbers of gems. More formally, suppose that after d nights the numbers of gems held by
the n inhabitants are listed in non-increasing order as a1 ≥ a2 ≥ . . . ≥ an . What is the expected value
of a1 + · · · + ar ?
Input
The input consists of a single line containing the three integers n, d, and r (1 ≤ n, d ≤ 500, 1 ≤ r ≤ n),
as described in the problem statement above.
Output
Display the expected number of gems that the top r inhabitants hold after d nights, with an absolute or
relative error of at most 10−6 .
Sample Input 1 Sample Output 1
2 3 1 3.5
Sample Input 2 Sample Output 2
3 3 2 4.9
Sample Input 3 Sample Output 3
5 10 3 12.2567433
This page is intentionally left blank.
Editorial
Rendered from the copied solution.tex file. The original TeX source remains
available below.
Key Observations
Write the structural observations that make the problem tractable.
State any useful invariant, monotonicity property, graph interpretation, or combinatorial reformulation.
If the constraints matter, explain exactly which part of the solution they enable.
Algorithm
Describe the data structures and the state maintained by the algorithm.
Explain the processing order and why it is sufficient.
Mention corner cases explicitly if they affect the implementation.
Correctness Proof
We prove that the algorithm returns the correct answer.
Lemma 1.
State the first key claim.
Proof.
Provide a concise proof.
Lemma 2.
State the next claim if needed.
Proof.
Provide a concise proof.
Theorem.
The algorithm outputs the correct answer for every valid input.
Proof.
Combine the lemmas and finish the argument.
Complexity Analysis
State the running time and memory usage in terms of the input size.
Implementation Notes
Mention any non-obvious implementation detail that is easy to get wrong.
Mention numeric limits, indexing conventions, or tie-breaking rules if relevant.
Code
Exact copied C++ implementation from solution.cpp.
#include <bits/stdc++.h>
using namespace std;
namespace {
void solve() {
// Fill in the full solution logic for the problem here.
}
} // namespace
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
solve();
return 0;
}
Source Files
Exact copied source-of-truth files. Edit solution.tex for the write-up and solution.cpp for the implementation.
\documentclass[11pt]{article}
\usepackage[margin=1in]{geometry}
\usepackage[T1]{fontenc}
\usepackage[utf8]{inputenc}
\usepackage{amsmath,amssymb,amsthm}
\usepackage{enumitem}
\title{ICPC World Finals 2018\\D. Gem Island}
\author{}
\date{}
\begin{document}
\maketitle
\section*{Problem Summary}
State the problem in your own words. Focus on the mathematical or algorithmic core rather than repeating the full statement.
\section*{Key Observations}
\begin{itemize}[leftmargin=*]
\item Write the structural observations that make the problem tractable.
\item State any useful invariant, monotonicity property, graph interpretation, or combinatorial reformulation.
\item If the constraints matter, explain exactly which part of the solution they enable.
\end{itemize}
\section*{Algorithm}
\begin{enumerate}[leftmargin=*]
\item Describe the data structures and the state maintained by the algorithm.
\item Explain the processing order and why it is sufficient.
\item Mention corner cases explicitly if they affect the implementation.
\end{enumerate}
\section*{Correctness Proof}
We prove that the algorithm returns the correct answer.
\paragraph{Lemma 1.}
State the first key claim.
\paragraph{Proof.}
Provide a concise proof.
\paragraph{Lemma 2.}
State the next claim if needed.
\paragraph{Proof.}
Provide a concise proof.
\paragraph{Theorem.}
The algorithm outputs the correct answer for every valid input.
\paragraph{Proof.}
Combine the lemmas and finish the argument.
\section*{Complexity Analysis}
State the running time and memory usage in terms of the input size.
\section*{Implementation Notes}
\begin{itemize}[leftmargin=*]
\item Mention any non-obvious implementation detail that is easy to get wrong.
\item Mention numeric limits, indexing conventions, or tie-breaking rules if relevant.
\end{itemize}
\end{document}
#include <bits/stdc++.h>
using namespace std;
namespace {
void solve() {
// Fill in the full solution logic for the problem here.
}
} // namespace
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
solve();
return 0;
}