Pinely Treasure Hunt Contest

Solutions for Pinely Treasure Hunt Contest (contest 1639). 9/11 problems verified against sample I/O. Difficulty range: -.

11 items

Pinely Treasure Hunt Contest

Type: Special | Problems: 11 | Verified: 9/11 | Rating range: - | Time: 14m 19s

Problem Name Rating Tags Solve Time Verified
A Treasure Hunt - graphs, interactive 1m ✓
B Treasure Hunt - graphs, interactive 1m 14s ✓
C Treasure Hunt - graphs, interactive 55s ✓
D Treasure Hunt - graphs, interactive 2m 31s ✗
E Treasure Hunt - graphs, interactive 1m 7s ✓
F Treasure Hunt - graphs, interactive 53s ✓
G Treasure Hunt - graphs, interactive 1m 6s ✓
H Treasure Hunt - graphs, interactive 53s ✓
I Treasure Hunt - graphs, interactive 1m 17s ✓
J Treasure Hunt - graphs, interactive 56s ✓
K Treasure Hunt - graphs, interactive 2m 27s ✗
Practice › Codeforces Solutions › Pinely Treasure Hunt Contest ›

CF 1639K - Treasure Hunt

This problem is rated 3500 and its solution relies on a fairly deep structural characterization of graphs whose cycle space admits a consistent cyclic orientation.
codeforces competitive-programming graphs interactive Jun 10, 2026
Practice › Codeforces Solutions › Pinely Treasure Hunt Contest ›

CF 1639I - Treasure Hunt

We are exploring an unknown connected graph, but we never see global labels of vertices or edges. Instead, we start at a known vertex and repeatedly move along incident edges chosen locally.
codeforces competitive-programming graphs interactive Jun 10, 2026
Practice › Codeforces Solutions › Pinely Treasure Hunt Contest ›

CF 1639J - Treasure Hunt

The problem presents an interactive treasure hunt on a hidden undirected graph. Each vertex corresponds to a junction with a treasure. You begin at a specified start vertex, and every time you visit a new vertex, you collect the treasure there.
codeforces competitive-programming graphs interactive Jun 10, 2026
Practice › Codeforces Solutions › Pinely Treasure Hunt Contest ›

CF 1639D - Treasure Hunt

This problem is rated 3500 and its solution relies on a fairly deep structural characterization of graphs whose cycle space admits a consistent cyclic orientation.
codeforces competitive-programming graphs interactive Jun 10, 2026
Practice › Codeforces Solutions › Pinely Treasure Hunt Contest ›

CF 1639G - Treasure Hunt

We are exploring an unknown connected graph. We know the complete graph beforehand, including every edge, but once the interaction starts we lose the vertex labels.
codeforces competitive-programming graphs interactive Jun 10, 2026
Practice › Codeforces Solutions › Pinely Treasure Hunt Contest ›

CF 1639H - Treasure Hunt

We are asked to simulate a treasure hunt on an unknown undirected graph. Each vertex has a treasure and a flag. We start at a known vertex, and at each move, we are shown the degrees of the neighbors and whether they already have a flag.
codeforces competitive-programming graphs interactive Jun 10, 2026
Practice › Codeforces Solutions › Pinely Treasure Hunt Contest ›

CF 1639E - Treasure Hunt

We are placed inside an unknown connected undirected graph. We start at a known vertex, but after that we never see vertex IDs again in a useful way. Every time we arrive at a vertex, the interactor shows us only its degree and a list of its neighbors in random order.
codeforces competitive-programming graphs interactive Jun 10, 2026
Practice › Codeforces Solutions › Pinely Treasure Hunt Contest ›

CF 1639F - Treasure Hunt

We are asked to simulate a treasure hunt on a hidden, undirected graph. Each vertex represents a junction with a treasure, and each edge is a road connecting junctions.
codeforces competitive-programming graphs interactive Jun 10, 2026
Practice › Codeforces Solutions › Pinely Treasure Hunt Contest ›

CF 1639B - Treasure Hunt

This task is an interactive graph exploration problem. We start from a known vertex of a connected undirected graph. Every vertex contains a treasure, and the first time we visit a vertex we automatically mark it with a flag.
codeforces competitive-programming graphs interactive Jun 10, 2026
Practice › Codeforces Solutions › Pinely Treasure Hunt Contest ›

CF 1639A - Treasure Hunt

The problem presents a treasure hunt on an undirected graph where each vertex represents a junction and each edge represents a road connecting junctions. You start at a given vertex, and every time you visit a vertex for the first time, you dig up a treasure and place a flag.
codeforces competitive-programming graphs interactive Jun 10, 2026
Practice › Codeforces Solutions › Pinely Treasure Hunt Contest ›

CF 1639C - Treasure Hunt

We are given a treasure-hunting scenario mapped onto an undirected graph. Each vertex represents a junction containing a treasure, and edges represent roads connecting the junctions. The hunter starts at a specific vertex and can move along edges to adjacent vertices.
codeforces competitive-programming graphs interactive Jun 10, 2026