scaffoldCore-1 previewrevision 2

Saddle Points

algorithm/saddle-points

algorithminterpretedcompiledinterpretercllvm-jitaot

Public context

What an implementation receives

# Saddle Points Select cells maximal in their row and minimal in their column. Submit the complete source closure matching `interface.zli`. Public cases are examples, not an exhaustive specification. Do not use ambient I/O, time, random state, or undeclared capabilities.

Public interfaceZergLang

module benchmark_algorithm_saddle_points;

public value Solution {
    public interpreted algorithm message solve(type: Class<Self>, input: Dynamic)
        -> Dynamic effects {};
}

Public cases

1 inspectable case

3e374e63-a2e0-4530-a39a-d53c560382bdpublic input + expected behavior

Input

{
  "fields": [
    {
      "name": "matrix",
      "value": {
        "items": [
          {
            "items": [
              {
                "type": "integer",
                "value": "9"
              },
              {
                "type": "integer",
                "value": "8"
              },
              {
                "type": "integer",
                "value": "7"
              }
            ],
            "type": "sequence"
          },
          {
            "items": [
              {
                "type": "integer",
                "value": "5"
              },
              {
                "type": "integer",
                "value": "3"
              },
              {
                "type": "integer",
                "value": "2"
              }
            ],
            "type": "sequence"
          },
          {
            "items": [
              {
                "type": "integer",
                "value": "6"
              },
              {
                "type": "integer",
                "value": "6"
              },
              {
                "type": "integer",
                "value": "7"
              }
            ],
            "type": "sequence"
          }
        ],
        "type": "sequence"
      }
    },
    {
      "name": "canonical_property",
      "value": {
        "type": "text",
        "value": "saddlePoints"
      }
    }
  ],
  "type": "record"
}

Expected

{
  "kind": "value",
  "value": {
    "items": [
      {
        "fields": [
          {
            "name": "column",
            "value": {
              "type": "integer",
              "value": "1"
            }
          },
          {
            "name": "row",
            "value": {
              "type": "integer",
              "value": "2"
            }
          }
        ],
        "type": "record"
      }
    ],
    "type": "sequence"
  }
}

Held-out inputs and expectations are excluded from this projection. Their published outcomes are aggregate-only.

Code entry

ZergLang source policy

Active reference source withheld

This task participates in model synthesis. Publishing its canonical solution would invalidate future evaluations; the prompt, interface, and public cases above are the complete public authoring context.

Execution contract

algorithm

Selector: benchmark_algorithm_saddle_points.Solution.solve
Executors: algorithm-interpreter, algorithm-c, algorithm-llvm-jit, algorithm-aot
Platforms: portable
Performance lane: not eligible

Normative authority

1 bound clauses

C0-EXEC-001

Official task history

Signed conformance observations

No official conformance run currently contains this task revision in its signed catalog.

Provenance

Where this task came from

[
  {
    "commit": "03f83310ed0547b902d211a05d23b3d74661df02",
    "kind": "adapted",
    "license": "MIT",
    "source": "Exercism problem-specifications"
  }
]