#constructive algorithms

CF 962E - Byteland, Berland and Disputed Cities Rating: 2200 Tags: constructive algorithms, greedy Model: gpt-5-3-mini Solve time: 3m 1s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a33a2cd-09ec-83ec-9e56-12879fa17dfa Solution Problem Understanding We are given a set of points on a number line, each point being a city of one of three types: Byteland, Berland, or disputed. We are allowed to connect any pair of cities with a cable, and the cost of...

CF 985D - Sand Fortress Rating: 2100 Tags: binary search, constructive algorithms, math Model: gpt-5-3-mini Solve time: 1m 34s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a33a7dd-5220-83ec-9454-507fc8c0df4e Solution Problem Understanding We are building a sequence of sand pillars laid out on a line, starting from position 1 and extending to the right. Each position holds a non-negative integer height, and that height represents how many sand packs are placed there. All sand...

CF 1033E - Hidden Bipartite Graph Rating: 2800 Tags: binary search, constructive algorithms, dfs and similar, graphs, interactive Model: gpt-5-3-mini Solve time: 2m 27s Verified: no (0/1 samples) Share: https://chatgpt.com/share/6a33b4bd-0d58-83ec-9581-09aa8217a4ba Solution Problem Understanding We are given an unknown connected simple graph with up to 600 vertices. We cannot see its edges directly. Instead, we can only ask questions of the form: choose a subset of vertices, and receive the number...

CF 976D - Degree Set Rating: 2500 Tags: constructive algorithms, graphs, implementation Model: gpt-5-3-mini Solve time: 1m 45s Verified: no (0/1 samples) Share: https://chatgpt.com/share/6a33a4a5-3e54-83ec-af99-7a1126bb5b7e Solution Problem Understanding We are asked to construct an undirected simple graph with a very specific property: if we look at the degrees of all vertices, the set of distinct degree values must match exactly a given sorted list $d_1 < d_2 < \dots < d_n$....

CF 923D - Picking Strings Rating: 2500 Tags: constructive algorithms, implementation, strings Model: gpt-5-3-mini Solve time: 3m 5s Verified: no (0/1 samples) Share: https://chatgpt.com/share/6a33913f-c870-83ec-b764-970f6c7dcb93 Solution Problem Understanding We are given a source string made of the letters A, B, and C, and another target string over the same alphabet. A query asks whether a chosen substring of the source can be transformed into a chosen substring of the target using...

CF 938C - Constructing Tests Rating: 1700 Tags: binary search, brute force, constructive algorithms Model: gpt-5-3-mini Solve time: 5m 52s Verified: no (0/1 samples) Share: https://chatgpt.com/share/6a33978e-1a88-83ec-9ecc-90b2407c42fb Solution Problem Understanding The problem is not asking us to construct a matrix directly, but instead to reason about an optimal packing property of binary grids under a sliding-window restriction. We imagine an $n \times n$ grid filled with zeros and ones. The constraint...

CF 1045E - Ancient civilizations Rating: 3200 Tags: constructive algorithms, geometry Model: gpt-5-5 Solve time: 1m 30s Verified: no (0/1 samples) Share: https://chatgpt.com/share/6a33bd92-5848-83ec-8e11-38cdcb484316 Solution Problem Understanding We are given a set of points in the plane. Each point belongs to one of two civilizations, and we are asked to connect points with straight road segments under very strict geometric constraints. Inside each civilization, the chosen roads must form a tree:...

CF 960C - Subsequence Counting Rating: 1700 Tags: bitmasks, constructive algorithms, greedy, implementation Model: gpt-5-3-mini Solve time: 4m 22s Verified: no (0/1 samples) Share: https://chatgpt.com/share/6a33a069-6ac8-83ec-b946-bc1675dc98b7 Solution Problem Understanding We are given two numbers: a target count of subsequences and a threshold value. We must construct an integer array such that when we look at all its non-empty subsequences and keep only those subsequences whose maximum minus minimum is strictly less...

CF 1032C - Playing Piano Rating: 1700 Tags: constructive algorithms, dp Model: gpt-5-3-mini Solve time: 5m 12s Verified: no (0/1 samples) Share: https://chatgpt.com/share/6a33b3b9-8a8c-83ec-9852-952e695f7f1d Solution Problem Understanding We are given a sequence of notes, each note sitting at some horizontal position on a piano keyboard. The goal is to assign each note one of five fingers, numbered from 1 to 5, producing another sequence of the same length. The assignment is...

CF 990D - Graph And Its Complement Rating: 1700 Tags: constructive algorithms, graphs, implementation Model: gpt-5-3-mini Solve time: 1m 42s Verified: no (0/1 samples) Share: https://chatgpt.com/share/6a33ab50-41d4-83ec-a879-a911b1062878 Solution Problem Understanding We are asked to construct an undirected simple graph on $n$ vertices such that two independent structural properties hold at the same time: the graph itself must have exactly $a$ connected components, and its complement graph must have exactly $b$ connected...

CF 899D - Shovel Sale Rating: 1800 Tags: constructive algorithms, math Model: gpt-5-5 Solve time: 1m 6s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a32d53b-2230-83ec-8174-9a3f0c65fd71 Solution Problem Understanding We are given a shop that contains items with prices from 1 up to n, where the i-th item costs exactly i. We must choose an unordered pair of distinct items, compute their total price, and look at the decimal representation of that sum....

CF 925D - Aztec Catacombs Rating: 2600 Tags: constructive algorithms Model: gpt-5-3-mini Solve time: 1m 16s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a33923e-fc48-83ec-b110-12bac0fbcbb1 Solution Problem Understanding We are given a complete graph on $n$ caves, but only some edges are initially open. The rest are closed. Indiana starts at cave $1$ and wants to reach cave $n$. He can only traverse an edge if it is currently open. The twist is...

CF 989B - A Tide of Riverscape Rating: 1200 Tags: constructive algorithms, strings Model: gpt-5-3-mini Solve time: 1m 23s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a337884-5a20-83ec-bd94-efbdbf86a772 Solution Problem Understanding We are given a string of length $n$ consisting of three types of characters: fixed zeros, fixed ones, and wildcard dots. Each dot can independently become either 0 or 1. After replacing all dots, we obtain a fully concrete binary string. We...

CF 925C - Big Secret Rating: 2200 Tags: constructive algorithms, math Model: gpt-5-5 Solve time: 4m 28s Verified: yes (1/1 samples) Solution Problem Understanding We are given a multiset of integers. We are allowed to reorder them arbitrarily. After choosing an order, we compute a running prefix XOR, starting from zero, where each next value is obtained by XOR-ing the previous prefix result with the next chosen element. The task...

CF 959D - Mahmoud and Ehab and another array construction task Rating: 1900 Tags: constructive algorithms, greedy, math, number theory Model: gpt-5-3-mini Solve time: 1m 39s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a327fde-bec8-83ec-a888-da97defbad0b Solution Problem Understanding We are given an array of integers $a$, and we must construct another array $b$ of the same length under three simultaneous constraints. First, $b$ must not be lexicographically smaller than $a$, meaning we compare...

CF 962B - Students in Railway Carriage Rating: 1300 Tags: constructive algorithms, greedy, implementation Model: gpt-5-3-mini Solve time: 1m 12s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a32811e-c338-83ec-856c-ab66260bfd33 Solution Problem Understanding We are given a row of seats in a train carriage. Some seats are already blocked, and the rest are empty. We want to place as many students as possible into the empty seats. Each student belongs to one of two...

CF 899C - Dividing the numbers Rating: 1300 Tags: constructive algorithms, graphs, math Model: gpt-5-5 Solve time: 1m 36s Verified: yes (1/1 samples) Solution Problem Understanding We are given the first n positive integers, and we must split them into two non-empty groups. Every integer must go to exactly one group, and we want the sums of the two groups to be as close as possible. If we think in...

CF 926E - Merge Equal Elements Rating: 1900 Tags: constructive algorithms, data structures Model: gpt-5-3-mini Solve time: 1m 5s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a3270f4-c654-83ec-aadf-ab79419d4fc3 Solution Problem Understanding We are given a sequence of positive integers, arranged in a line. The process repeatedly looks for two identical numbers that sit next to each other. Whenever such a pair exists, the leftmost such pair is chosen, both elements are removed, and...

CF 952G - Puzzling Language Rating: 2200 Tags: *special, constructive algorithms Model: gpt-5-3-mini Solve time: 1m 13s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a327c6c-6730-83ec-86ff-8429b8682379 Solution Problem Understanding We are asked to construct a rectangular grid made of two symbols, dot and X, that behaves like a program once it is interpreted. The grid is not executed directly. Instead, it is scanned row by row, left to right, and every cell containing...

CF 940C - Phone Numbers Rating: 1500 Tags: constructive algorithms, implementation, strings Model: gpt-5-3-mini Solve time: 1m 40s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a327acf-1ca0-83ec-bed7-8d517485ff10 Solution Problem Understanding We are given a string composed of lowercase letters and a target length $k$. From the letters that appear anywhere in the original string, we form a set of allowed characters. Using only these allowed characters, we must construct a new string $t$...

CF 898E - Squares and not squares Rating: 1600 Tags: constructive algorithms, greedy Model: gpt-5-5 Solve time: 1m 33s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a3269dc-11fc-83ec-a60b-85c3106daf86 Solution Problem Understanding We are given an array of $n$ piles, where each pile contains some number of candies. One operation allows us to increase or decrease a single pile by exactly one candy. Our goal is not to make the values equal or optimize...

CF 896B - Ithea Plays With Chtholly Rating: 2000 Tags: binary search, constructive algorithms, games, greedy, interactive Model: gpt-5-3-mini Solve time: 3m 12s Verified: yes (1/1 samples) Solution Problem Understanding We are maintaining a row of n positions, each initially empty. Over time, we receive a sequence of m numbers. After each number arrives, we must immediately assign it to one of the n positions, possibly overwriting what was there...

CF 1290B - Irreducible Anagrams Rating: 1800 Tags: binary search, constructive algorithms, data structures, strings, two pointers Model: gpt-5-5 Solve time: 5m 7s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a2dbb0a-a9b0-83ec-bfb3-954d543b2b2f Solution Problem Understanding We are given a base string and many queries over its substrings. Each query asks whether the chosen substring admits at least one “irreducible anagram”. To interpret this, imagine we take the substring and consider all possible permutations...

CF 1358F - Tasty Cookie Rating: 2700 Tags: binary search, constructive algorithms, greedy, implementation Model: gpt-5-3-mini Solve time: 3m 13s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a2e3967-76d0-83ec-96a5-f2c93add7538 Solution Problem Understanding We are given an initial array A and a target array B , both of the same length. We are allowed to transform A using two operations: we can reverse the entire array, or we can replace it by its prefix...

CF 1316D - Nash Matrix Rating: 2000 Tags: constructive algorithms, dfs and similar, graphs, implementation Model: gpt-5-3-mini Solve time: 2m 17s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a2de522-2b84-83ec-9041-a685022914d8 Solution Problem Understanding We are given a complete description of what happens on every cell of an $n \times n$ grid, but only in a compressed form. For each starting cell, we are told the final outcome of repeatedly following movement instructions written...

CF 1333A - Little Artem Rating: 1000 Tags: constructive algorithms Model: gpt-5-3-mini Solve time: 5m 17s Verified: no (0/1 samples) Share: https://chatgpt.com/share/6a2e09a9-ba14-83ec-8715-8f0fd2959600 Solution Problem Understanding We are asked to construct a coloring of an $n \times m$ grid where each cell is either black or white. After coloring, we look at adjacency in the four cardinal directions. A black cell is counted in $B$ if it has at least one...

CF 1360H - Binary Median Rating: 2100 Tags: binary search, bitmasks, brute force, constructive algorithms Model: gpt-5-3-mini Solve time: 4m 37s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a2e3ffc-019c-83ec-9f2e-0b9dbb143a88 Solution Problem Understanding We start with the full space of all binary strings of length m , ordered in standard lexicographic order, which is equivalent to sorting them as fixed-length binary numbers from 0...0 up to 1...1 . From this complete ordered set,...

CF 1342D - Multiple Testcases Rating: 1900 Tags: binary search, constructive algorithms, data structures, greedy, sortings, two pointers Model: gpt-5-3-mini Solve time: 8m 41s Verified: no (0/1 samples) Share: https://chatgpt.com/share/6a2e1bc3-6528-83ec-be3b-9d57dd5c8d13 Solution Problem Understanding We are given a collection of arrays, but the actual contents of these arrays do not matter at all. Each array is characterized only by its size. Our task is to pack all these arrays into several...

CF 1333E - Road to 1600 Rating: 2400 Tags: brute force, constructive algorithms Model: gpt-5-3-mini Solve time: 2m 20s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a2e0a51-09e0-83ec-ae01-11957a0acddb Solution Problem Understanding We are asked to construct a numbering of an $N \times N$ grid using all integers from $1$ to $N^2$, each exactly once. This numbering defines how a chess piece moves, but the key idea is that movement is not arbitrary: at...

CF 1380D - Berserk And Fireball Rating: 2000 Tags: constructive algorithms, greedy, implementation, math, two pointers Model: gpt-5-3-mini Solve time: 3m 18s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a2e6837-7194-83ec-8eb1-70496101292f Solution Problem Understanding We are given a sequence of distinct integers representing warriors arranged in a line. We are also given a target sequence, also consisting of distinct integers. The goal is to transform the initial line into the target line using...

CF 1325A - EhAb AnD gCd Rating: 800 Tags: constructive algorithms, greedy, number theory Model: gpt-5-3-mini Solve time: 4m 54s Verified: no (0/1 samples) Share: https://chatgpt.com/share/6a2df29d-d044-83ec-afec-0481b1811e79 Solution Problem Understanding We are given a number x, and for each query we must construct two positive integers a and b such that when we compute their greatest common divisor and least common multiple, the sum of those two values is exactly x....

CF 1276E - Four Stones Rating: 3500 Tags: constructive algorithms Model: gpt-5-5 Solve time: 4m 53s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a2d9981-ce70-83ec-8f4f-e549dfa11c67 Solution Problem Understanding We are given four indistinguishable stones placed on integer coordinates on a number line. We are also given four target coordinates, again with multiplicity, and we only care that the final multiset of positions matches the target multiset. The only allowed move is asymmetric: we...

CF 1365D - Solve The Maze Rating: 1700 Tags: constructive algorithms, dfs and similar, dsu, graphs, greedy, implementation, shortest paths Model: gpt-5-3-mini Solve time: 2m 7s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a2e497a-d7ec-83ec-8d81-7aac5910ae19 Solution Problem Understanding The maze is a small grid where each cell is either a wall, empty space, a good person, or a bad person. All movement is four-directional and blocked by walls. The only exit is the...

CF 1381C - Mastermind Rating: 2500 Tags: constructive algorithms, graph matchings, greedy, implementation, sortings, two pointers Model: gpt-5-3-mini Solve time: 4m 37s Verified: no (0/1 samples) Share: https://chatgpt.com/share/6a2e6d9f-55a8-83ec-97be-24bac196aec3 Solution Problem Understanding We are given a sequence b of length n , representing Bob’s guess, and two integers x and y describing how this guess overlaps with an unknown hidden sequence a of the same length. The hidden sequence uses colors...

CF 1286F - Harry The Potter Rating: 3100 Tags: brute force, constructive algorithms, dp, fft, implementation, math Model: gpt-5-5 Solve time: 12m 49s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a2db45f-df44-83ec-9a9e-190a955601b2 Solution Problem Understanding We are given an array of up to 20 integers, and we are allowed to apply two kinds of operations that modify its values. The goal is to bring every entry of the array to zero using as...

CF 1354F - Summoning Minions Rating: 2500 Tags: constructive algorithms, dp, flows, graph matchings, greedy, sortings Model: gpt-5-3-mini Solve time: 7m 51s Verified: no (0/1 samples) Share: https://chatgpt.com/share/6a2e3235-4d04-83ec-969f-ae99dbac5d4a Solution Problem Understanding We are given a collection of minions, each with an intrinsic strength and a “buffing power”. When a minion is summoned, it contributes its base strength, but it also permanently increases the power of every minion that has already...

CF 1325F - Ehab's Last Theorem Rating: 2500 Tags: constructive algorithms, dfs and similar, graphs, greedy Model: gpt-5-5 Solve time: 6m 18s Verified: no (0/1 samples) Share: https://chatgpt.com/share/6a2df425-592c-83ec-8ec3-29541239cb9e Solution Problem Understanding We are given a connected undirected simple graph with up to $10^5$ vertices and up to $2 \cdot 10^5$ edges. The task is not to optimize some cost or count something, but to explicitly construct one of two specific...

CF 1332D - Walk on Matrix Rating: 1700 Tags: bitmasks, constructive algorithms, math Model: gpt-5-5 Solve time: 2m 47s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a2e0632-eed0-83ec-99e5-e8c87ad6dd8f Solution Problem Understanding We are asked to construct a matrix where movement is restricted to right and down from the top-left corner to the bottom-right corner. Every cell contains a non-negative integer, and as we move, we maintain a running value that is updated by...

CF 1338B - Edge Weight Assignment Rating: 1800 Tags: bitmasks, constructive algorithms, dfs and similar, greedy, math, trees Model: gpt-5-3-mini Solve time: 1m 50s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a2e145b-5f7c-83ec-9103-1a6faf811420 Solution Problem Understanding We are given a tree where each edge must be assigned a positive integer weight. The restriction is not local to edges, it applies to paths: whenever we pick two leaves and walk along the unique path...

CF 1340D - Nastya and Time Machine Rating: 2600 Tags: constructive algorithms, dfs and similar, graphs, trees Model: gpt-5-3-mini Solve time: 4m 8s Verified: no (0/1 samples) Share: https://chatgpt.com/share/6a2e1967-f7b8-83ec-a5ed-2b526864a552 Solution Problem Understanding We are given a tree of $n$ vertices, with vertex $1$ as the starting and ending location. The traveler begins at vertex $1$ at time $0$. Every edge traversal takes exactly one unit of time, so moving along...

CF 1372C - Omkar and Baseball Rating: 1500 Tags: constructive algorithms, math Model: gpt-5-5 Solve time: 7m 6s Verified: no (0/1 samples) Share: https://chatgpt.com/share/6a2e578e-d790-83ec-93b6-b0105e4e9d7e Solution Problem Understanding We are given a permutation of numbers from 1 to n, and we want to transform it into the sorted identity permutation using a restricted operation. The operation allows us to pick any contiguous segment and permute it arbitrarily, but with one important...

CF 1365C - Rotation Matching Rating: 1400 Tags: constructive algorithms, data structures, greedy, implementation Model: gpt-5-3-mini Solve time: 2m 8s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a2e4979-4b48-83ec-8352-cdd9514f063c Solution Problem Understanding We are given two permutations of the same set of numbers from 1 to n. Think of them as two different circular arrangements of the same labeled tiles. We are allowed to rotate each circle independently any number of times, and...

CF 1353D - Constructing the Array Rating: 1600 Tags: constructive algorithms, data structures, sortings Model: gpt-5-3-mini Solve time: 5m 14s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a2e2f09-bb38-83ec-8c0b-26a2dc3eab95 Solution Problem Understanding We start with an array of length n filled with zeros. We repeatedly “fill” the array in n steps. At each step, we look at the current zero-filled segments and pick one segment to place the next number. The rule for...

CF 1292B - Aroma's Search Rating: 1700 Tags: brute force, constructive algorithms, geometry, greedy, implementation Model: gpt-5-5 Solve time: 4m 39s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a2dc05e-7fd4-83ec-9d20-d8829d0c44f3 Solution Problem Understanding We are given a starting point on an infinite grid and a sequence of special points generated one after another by a fixed recurrence. Each next point is obtained from the previous one by multiplying coordinates by constants and adding...

CF 1325D - Ehab the Xorcist Rating: 1700 Tags: bitmasks, constructive algorithms, greedy, number theory Model: gpt-5-3-mini Solve time: 7m 3s Verified: no (0/1 samples) Share: https://chatgpt.com/share/6a2df36e-7d1c-83ec-8eb8-d0b7521b6e99 Solution Problem Understanding We are asked to construct a shortest possible sequence of positive integers such that two aggregate properties are satisfied simultaneously: the bitwise XOR of all elements equals a given value u , and the sum of all elements equals another...

CF 1371D - Grid-00100 Rating: 1600 Tags: constructive algorithms, greedy, implementation Model: gpt-5-5 Solve time: 1m 51s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a2e5587-07e8-83ec-bde5-f0b7981cc46f Solution Problem Understanding We are asked to build an $n \times n$ grid filled with only zeros and ones, with the constraint that exactly $k$ cells contain ones. The grid is not judged directly by how the ones are placed, but by how unevenly they are distributed...

CF 1352G - Special Permutation Rating: 1600 Tags: constructive algorithms Model: gpt-5-3-mini Solve time: 5m 11s Verified: no (0/1 samples) Share: https://chatgpt.com/share/6a2e2dbb-bf54-83ec-ac7e-8e53c268f8ff Solution Problem Understanding We are asked to construct a permutation of the integers from 1 to n such that neighboring elements in the sequence are never too close and never too far apart. Concretely, when we place the numbers in a line, every adjacent pair must differ by...

CF 1364D - Ehab's Last Corollary Rating: 2100 Tags: constructive algorithms, dfs and similar, graphs, greedy, implementation, trees Model: gpt-5-3-mini Solve time: 2m 58s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a2e47c0-f80c-83ec-a0be-6bd3409333b8 Solution Problem Understanding We are given a connected undirected graph. Alongside the graph, we are given a parameter $k$, and we are asked to produce one of two possible outputs depending on what structure we can guarantee from the graph....

CF 1349E - Slime and Hats Rating: 3500 Tags: constructive algorithms, dp, greedy Model: gpt-5-3-mini Solve time: 2m 24s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a2e27ec-befc-83ec-ae86-04af444bb84d Solution Problem Understanding We are given a line of players sitting from front to back. Each player has a hidden binary attribute, either a black hat or a white hat. The visibility is one-directional: a player can see everyone in front of them but not...

CF 1322B - Present Rating: 2100 Tags: binary search, bitmasks, constructive algorithms, data structures, math, sortings Model: gpt-5-3-mini Solve time: 1m 28s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a2deae4-fc9c-83ec-aeba-66f8cbbf4563 Solution Problem Understanding We are given an array of integers, and we consider every unordered pair of distinct elements. For each pair, we compute their sum. After collecting all these pairwise sums, instead of summing or minimizing them, we combine them using...

CF 1264E - Beautiful League Rating: 2700 Tags: constructive algorithms, flows, graph matchings Model: gpt-5-3-mini Solve time: 3m 3s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a2d853b-b69c-83ec-9d1c-4a7ebe577efe Solution Problem Understanding We are given a complete tournament on $n$ teams where every pair of teams plays exactly one match and each match has a winner. Some of these results are already fixed. The task is to assign directions to all remaining matches so...

CF 1266D - Decreasing Debts Rating: 2000 Tags: constructive algorithms, data structures, graphs, greedy, implementation, math, two pointers Model: gpt-5-3-mini Solve time: 3m 17s Verified: yes (1/1 samples) Share: https://chatgpt.com/share/6a2d8730-d1b0-83ec-b40b-a8447d19d422 Solution Problem Understanding We are given a directed weighted graph where each vertex represents a person and each directed edge represents a debt from one person to another. The value on an edge is how much money the source person...