CPMagical CP Library

Problem solution · Go

Codeforces 1221F — Choose a Square

Codeforces 1221F — Choose a Square: a Go solution using sorting and greedy selection. Learn the idea, check the complexity, and read the full code, with credit to EndlessCheng Codeforces Go.

Technique
Sorting and greedy selection
Source
EndlessCheng Codeforces Go
Length
132 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Sorting and greedy selection

For Codeforces 1221F — Choose a Square, the implementation first exposes a useful order, then scans that order while making locally justified choices.

  1. Choose the key that reveals the greedy or grouping structure.
  2. Sort the relevant records by that key.
  3. Scan in order, maintaining the invariant that makes each local choice safe.

Code notes

  • 132 lines of Go from the credited upstream file 1221F.go.
  • The implementation visibly relies on sequence storage.
  • No explicit loop blocks detected.

Complexity

Sorting is typically the dominant term unless the subsequent scan uses a more expensive nested operation.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from EndlessCheng Codeforces Go by Σndless (EndlessCheng) and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeCodeforces 1221F — Choose a Square · GoGo
Use this to learn the idea, then write your own version.
package main import (	. "fmt"	"io"	"math/bits"	"slices"	"sort") // https://github.com/EndlessChengtype pair struct{ mx, i int }type seg []struct{ pair; l, r, todo int } func (t seg) merge(a, b pair) pair {	if a.mx > b.mx {		return a	}	return b} func (t seg) apply(o, f int) {	t[o].mx += f	t[o].todo += f} func (t seg) maintain(o int) {	t[o].pair = t.merge(t[o<<1].pair, t[o<<1|1].pair)} func (t seg) spread(o int) {	f := t[o].todo	if f == 0 {		return	}	t.apply(o<<1, f)	t.apply(o<<1|1, f)	t[o].todo = 0} func (t seg) build(a []int, o, l, r int) {	t[o].l, t[o].r = l, r	if l == r {		t[o].mx = a[l]		t[o].i = l		return	}	m := (l + r) >> 1	t.build(a, o<<1, l, m)	t.build(a, o<<1|1, m+1, r)	t.maintain(o)} func (t seg) update(o, l, r, f int) {	if l <= t[o].l && t[o].r <= r {		t.apply(o, f)		return	}	t.spread(o)	m := (t[o].l + t[o].r) >> 1	if l <= m {		t.update(o<<1, l, r, f)	}	if m < r {		t.update(o<<1|1, l, r, f)	}	t.maintain(o)} func (t seg) query(o, l, r int) pair {	if l <= t[o].l && t[o].r <= r {		return t[o].pair	}	t.spread(o)	m := (t[o].l + t[o].r) >> 1	if r <= m {		return t.query(o<<1, l, r)	}	if l > m {		return t.query(o<<1|1, l, r)	}	return t.merge(t.query(o<<1, l, r), t.query(o<<1|1, l, r))} func cf1221F(in io.Reader, out io.Writer) {	var n, ans int	Fscan(in, &n)	// 左下角 (a,a)   右上角 (b,b)	// a<=x<=b	// a<=y<=b	// a <= min(x,y) <= max(x,y) <= b	// a <= x'	// y' <= b	// 按照 b 分组  sum - b + a = (a + sum) - b 	// 当我们添加 x' 时，把 [0,x'] 中的数都增加 c  搞定！	// 最后求一下 [0,b] 中的最大值 	type point struct{ x, y, c int }	a := make([]point, n)	b := make([]int, 0, n*2)	for i := range a {		Fscan(in, &a[i].x, &a[i].y, &a[i].c)		if a[i].x > a[i].y {			a[i].x, a[i].y = a[i].y, a[i].x		}		b = append(b, a[i].x, a[i].y)	}	slices.Sort(b)	b = slices.Compact(b)	m := len(b) 	t := make(seg, 2<<bits.Len(uint(m-1)))	t.build(b, 1, 0, m-1) 	slices.SortFunc(a, func(a, b point) int { return a.y - b.y })	x1, x2 := int(2e9), int(2e9)	for i := 0; i < n; {		y := a[i].y		for ; i < n && a[i].y == y; i++ {			t.update(1, 0, sort.SearchInts(b, a[i].x), a[i].c)		}		res := t.query(1, 0, sort.SearchInts(b, y))		if res.mx-y > ans {			ans, x1, x2 = res.mx-y, b[res.i], y		}	}	Fprintln(out, ans)	Fprint(out, x1, x1, x2, x2)} //func main() { cf1221F(bufio.NewReader(os.Stdin), os.Stdout) }

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗