rbx.cp 0.5.39__py3-none-any.whl → 0.5.42__py3-none-any.whl

rbx/resources/packagers/moj/scripts/compare.sh

@@ -0,0 +1,101 @@
+#!/bin/bash
+# ////////////////////////////////////////////////////////////////////////////////
+# //BOCA Online Contest Administrator
+# //    Copyright (C) 2003-2012 by BOCA Development Team (bocasystem@gmail.com)
+# //
+# //    This program is free software: you can redistribute it and/or modify
+# //    it under the terms of the GNU General Public License as published by
+# //    the Free Software Foundation, either version 3 of the License, or
+# //    (at your option) any later version.
+# //
+# //    This program is distributed in the hope that it will be useful,
+# //    but WITHOUT ANY WARRANTY; without even the implied warranty of
+# //    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+# //    GNU General Public License for more details.
+# //    You should have received a copy of the GNU General Public License
+# //    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+# ////////////////////////////////////////////////////////////////////////////////
+# // Last modified 21/jul/2012 by cassio@ime.usp.br
+#
+# This script receives:
+# $1 team_output
+# $2 sol_output
+# $3 problem_input (might be used by some specific checkers, here it is not)
+#
+# BOCA reads the last line of the standard output
+# and pass it to judges
+#
+if [ ! -r "$1" -o ! -r "$2" ]; then
+  echo "Parameter problem"
+  exit 43
+fi
+
+CHECKERSOURCE=$(dirname "$0")/checker.cpp
+
+if [ ! -r "$CHECKERSOURCE" ]; then
+  echo "Checker source not found"
+  exit 47
+fi
+
+WORKDIR=$(dirname "$1")
+CHECKERHASH={{checkerHash}}
+CHECKERPATH=$WORKDIR/$CHECKERHASH
+
+lock() {
+  MAX_ATTEMPTS=100
+  ATTEMPTS=0
+  while ! ln -s $CHECKERSOURCE $CHECKERPATH.lock; do
+    sleep 1
+    ATTEMPTS=$((ATTEMPTS + 1))
+    if [ $ATTEMPTS -ge $MAX_ATTEMPTS ]; then
+      echo "Failed to retrieve checker lock"
+      exit 47
+    fi
+  done
+}
+
+unlock() {
+  rm -rf $CHECKERPATH.lock
+}
+
+compile_checker() {
+  cc=$(which g++)
+  [ -x "$cc" ] || cc=/usr/bin/g++
+  if [ ! -x "$cc" ]; then
+    echo "$cc not found or it's not executable"
+    exit 47
+  fi
+
+  lock
+  if [ ! -x "$CHECKERPATH" ]; then
+    $cc {{rbxFlags}} $CHECKERSOURCE -o $CHECKERPATH
+    chmod 0755 "$CHECKERPATH"
+  fi
+  unlock
+}
+
+if [ ! -x "$CHECKERPATH" ]; then
+  compile_checker
+fi
+
+# Next lines of this script just compares team_output and sol_output,
+# although it is possible to change them to more complex evaluations.
+output=$($CHECKERPATH $3 $1 $2 2>&1 >/dev/null)
+EC=$?
+
+echo "checker exitcode = $EC"
+echo "$output"
+
+if [ $EC -eq 0 ]; then
+  echo "checker found no differences"
+  exit 4
+elif [ $EC -eq 1 ]; then
+  echo "checker found differences"
+  exit 6
+elif [ $EC -eq 2 ]; then
+  echo "checker failed"
+  exit 5
+elif [ $EC -ne 3 ]; then
+  echo "unkown compare error $EC"
+  exit 43
+fi

rbx/test.py

@@ -3,6 +3,7 @@ import pathlib
 import tempfile
 from typing import Dict, List, Optional
 
+import syncer
 from rich.columns import Columns
 from rich.panel import Panel
 from rich.progress import MofNCompleteColumn, Progress, SpinnerColumn
@@ -46,7 +47,7 @@ def get_testcases_io(
     return sorted(testcases_per_index.values(), key=lambda x: x.index)
 
 
-def _run_testcases(
+async def _run_testcases(
     problem: Problem,
     lang: Language,
     lang_name: Optional[str],
@@ -73,7 +74,7 @@ def _run_testcases(
             artifacts = grading_utils.build_run_grading_artifacts(
                 testcase, persist_root
             )
-            run_log = steps.run(
+            run_log = await steps.run(
                 lang.exec,
                 params,
                 sandbox,
@@ -234,7 +235,8 @@ def pretty_print_evaluation_results(
         _pretty_print_evaluation_result(problem, eval, interactive=interactive)
 
 
-def main(
+@syncer.sync
+async def main(
     problem: annotations.Problem,
     language: annotations.LanguageWithDefault = None,
     keep_sandbox: bool = False,
@@ -322,7 +324,7 @@ def main(
             )
             return
 
-    testcase_logs = _run_testcases(
+    testcase_logs = await _run_testcases(
         dumped_problem, lang, language, box, testcases, persist_root
     )
 

rbx/testdata/interactive/checker.cpp

@@ -0,0 +1,21 @@
+#include "testlib.h"
+
+int main(int argc, char *argv[]) {
+  registerTestlibCmd(argc, argv);
+
+  int oufq = ouf.readInt();
+  int ansq = ans.readInt();
+
+  if (ansq > 25)
+    quitf(_fail, "Limit is %d, but main solution have made %d queries", 25,
+          ansq);
+
+  if (oufq > 25)
+    quitf(_wa, "Limit is %d, but solution have made %d queries", 25, oufq);
+
+  int n = inf.readInt();
+  int m = inf.readInt();
+  quitf(_ok,
+        "Number %d is guessed successfully (range [1..%d]) with %d queries", n,
+        m, oufq);
+}

rbx/testdata/interactive/gen.cpp

@@ -0,0 +1,11 @@
+#include "testlib.h"
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main(int argc, char *argv[]) {
+  registerGen(argc, argv, 1);
+  int n = atoi(argv[1]);
+  int t = atoi(argv[2]);
+  cout << rnd.wnext(1, n, t) << ' ' << n << endl;
+}

rbx/testdata/interactive/interactor.cpp

@@ -0,0 +1,63 @@
+#include "testlib.h"
+#include <bits/stdc++.h>
+
+using namespace std;
+
+void upd(int &lf, int &rg, int x, int y) {
+  if (x > y)
+    return;
+  lf = max(lf, x);
+  rg = min(rg, y);
+}
+
+void send(string x) {
+  cout << x << endl;
+  fflush(stdout);
+}
+
+const int INF = 1000'000'000;
+
+int main(int argc, char *argv[]) {
+  registerInteraction(argc, argv);
+
+  int x = inf.readInt();
+  int n = inf.readInt();
+  cout << n << endl << flush;
+  int lf = 1, rg = n;
+
+  int queries = 0;
+  while (true) {
+    bool is_answer = false;
+    string cur = ouf.readToken("!|[1-9][0-9]{0,8}");
+    int last;
+    if (cur != "!") {
+      InStream tmp(ouf, cur);
+      last = tmp.readInt(-INF, INF);
+      queries++;
+    } else {
+      is_answer = true;
+      last = ouf.readInt(-INF, INF);
+    }
+
+    if (last < 1 || last > n)
+      quitf(_pe, "number %d from stdin is out of range [%d, %d]", last, 1, n);
+
+    if (is_answer) {
+      if (last == x && lf == rg) {
+        tout << queries << endl;
+        quitf(_ok, "number is guessed.");
+      } else if (last == x && lf != rg)
+        quitf(_wa, "number is but it was made in a random way");
+      else
+        quitf(_wa, "guessed number is incorrect");
+    }
+
+    if (x < last) {
+      send("<");
+      upd(lf, rg, 1, last - 1);
+    } else {
+      send(">=");
+      upd(lf, rg, last, n);
+    }
+  }
+}

rbx/testdata/interactive/problem.rbx.yml

@@ -0,0 +1,40 @@
+---
+name: "test-problem"
+type: communication
+timeLimit: 1000
+memoryLimit: 256
+outputLimit: 100 # 100 kb
+checker:
+  path: "checker.cpp"
+interactor:
+  path: "interactor.cpp"
+generators:
+  - name: "gen"
+    path: "gen.cpp"
+validator:
+  path: "validator.cpp"
+testcases:
+  - name: "tests"
+    generatorScript:
+      path: "testplan.txt"
+solutions:
+  - path: "sols/main.cpp"
+    outcome: AC
+  - path: "sols/interactive-binary-search_mm_naive_cin.cpp"
+    outcome: INCORRECT
+  - path: "sols/af_tl_after_ans.cpp"
+    outcome: TLE
+  - path: "sols/af_wa.cpp"
+    outcome: WA
+  - path: "sols/af_ac_pe.cpp"
+    outcome: WA
+  - path: "sols/af_ac_re.cpp"
+    outcome: RE
+  - path: "sols/af_ml.cpp"
+    outcome: ML
+  - path: "sols/af_inf_cout_without_flush.cpp"
+    outcome: TLE
+  - path: "sols/af_inf_cout_with_flush.cpp"
+    outcome: TLE
+  - path: "sols/af_ac_too_many_iter.cpp"
+    outcome: INCORRECT

rbx/testdata/interactive/sols/af_ac_pe.cpp

@@ -0,0 +1,75 @@
+#include <algorithm>
+#include <cassert>
+#include <cmath>
+#include <cstdio>
+#include <cstring>
+#include <ctime>
+#include <iomanip>
+#include <iostream>
+#include <map>
+#include <queue>
+#include <set>
+#include <sstream>
+#include <string>
+#include <vector>
+
+#define forn(i, n) for (int i = 0; i < n; ++i)
+#define fore(i, l, r) for (int i = int(l); i <= int(r); ++i)
+#define sz(v) int(v.size())
+#define all(v) v.begin(), v.end()
+#define pb push_back
+#define mp make_pair
+#define x first
+#define y1 ________y1
+#define y second
+#define ft first
+#define sc second
+#define pt pair<int, int>
+
+template <typename X> inline X abs(const X &a) { return a < 0 ? -a : a; }
+template <typename X> inline X sqr(const X &a) { return a * a; }
+
+typedef long long li;
+typedef long double ld;
+
+using namespace std;
+
+const int INF = 1000 * 1000 * 1000;
+const ld EPS = 1e-9;
+const ld PI = acos(-1.0);
+
+int n;
+int lf, rg;
+
+bool read() {
+  cin >> n;
+  return true;
+}
+
+void solve() {
+  lf = 1, rg = n;
+  int it = 0;
+  while (lf != rg) {
+    it++;
+    int mid = (lf + rg + 1) / 2;
+    cout << mid << endl;
+    fflush(stdout);
+    string s;
+    cin >> s;
+    if (s == "<")
+      rg = mid - 1;
+    else
+      lf = mid;
+  }
+  if (it > 15)
+    cout << "!!";
+  cout << "! " << lf << endl;
+}
+
+int main() {
+  srand(time(NULL));
+  cerr << setprecision(10) << fixed;
+  assert(read());
+  solve();
+  return 0;
+}

rbx/testdata/interactive/sols/af_ac_re.cpp

@@ -0,0 +1,76 @@
+#include <algorithm>
+#include <cassert>
+#include <cmath>
+#include <cstdio>
+#include <cstring>
+#include <ctime>
+#include <iomanip>
+#include <iostream>
+#include <map>
+#include <queue>
+#include <set>
+#include <sstream>
+#include <string>
+#include <vector>
+
+#define forn(i, n) for (int i = 0; i < n; ++i)
+#define fore(i, l, r) for (int i = int(l); i <= int(r); ++i)
+#define sz(v) int(v.size())
+#define all(v) v.begin(), v.end()
+#define pb push_back
+#define mp make_pair
+#define x first
+#define y1 ________y1
+#define y second
+#define ft first
+#define sc second
+#define pt pair<int, int>
+
+template <typename X> inline X abs(const X &a) { return a < 0 ? -a : a; }
+template <typename X> inline X sqr(const X &a) { return a * a; }
+
+typedef long long li;
+typedef long double ld;
+
+using namespace std;
+
+const int INF = 1000 * 1000 * 1000;
+const ld EPS = 1e-9;
+const ld PI = acos(-1.0);
+
+int n;
+int lf, rg;
+
+bool read() {
+  cin >> n;
+  return true;
+}
+
+void solve() {
+  lf = 1, rg = n;
+  int it = 0;
+  while (lf != rg) {
+    it++;
+    int mid = (lf + rg + 1) / 2;
+    cout << mid << endl;
+    fflush(stdout);
+    string s;
+    cin >> s;
+    if (s == "<")
+      rg = mid - 1;
+    else
+      lf = mid;
+    if (it > 15)
+      assert(false);
+  }
+
+  cout << "! " << lf << endl;
+}
+
+int main() {
+  srand(time(NULL));
+  cerr << setprecision(10) << fixed;
+  assert(read());
+  solve();
+  return 0;
+}

rbx/testdata/interactive/sols/af_ac_too_many_iter.cpp

@@ -0,0 +1,72 @@
+#include <algorithm>
+#include <cassert>
+#include <cmath>
+#include <cstdio>
+#include <cstring>
+#include <ctime>
+#include <iomanip>
+#include <iostream>
+#include <map>
+#include <queue>
+#include <set>
+#include <sstream>
+#include <string>
+#include <vector>
+
+#define forn(i, n) for (int i = 0; i < n; ++i)
+#define fore(i, l, r) for (int i = int(l); i <= int(r); ++i)
+#define sz(v) int(v.size())
+#define all(v) v.begin(), v.end()
+#define pb push_back
+#define mp make_pair
+#define x first
+#define y1 ________y1
+#define y second
+#define ft first
+#define sc second
+#define pt pair<int, int>
+
+template <typename X> inline X abs(const X &a) { return a < 0 ? -a : a; }
+template <typename X> inline X sqr(const X &a) { return a * a; }
+
+typedef long long li;
+typedef long double ld;
+
+using namespace std;
+
+const int INF = 1000 * 1000 * 1000;
+const ld EPS = 1e-9;
+const ld PI = acos(-1.0);
+
+int n;
+int lf, rg;
+
+bool read() {
+  cin >> n;
+  return true;
+}
+
+void solve() {
+  lf = 1, rg = n;
+  while (lf != rg) {
+    int mid = (lf + rg + 1) / 2;
+    cout << mid << endl;
+    fflush(stdout);
+    string s;
+    cin >> s;
+    if (s == "<")
+      rg--;
+    else
+      lf = mid;
+  }
+
+  cout << "! " << lf << endl;
+}
+
+int main() {
+  srand(time(NULL));
+  cerr << setprecision(10) << fixed;
+  assert(read());
+  solve();
+  return 0;
+}

rbx/testdata/interactive/sols/af_inf_cout_with_flush.cpp

@@ -0,0 +1,79 @@
+#include <algorithm>
+#include <cassert>
+#include <cmath>
+#include <cstdio>
+#include <cstring>
+#include <ctime>
+#include <iomanip>
+#include <iostream>
+#include <map>
+#include <queue>
+#include <set>
+#include <sstream>
+#include <string>
+#include <vector>
+
+#define forn(i, n) for (int i = 0; i < n; ++i)
+#define fore(i, l, r) for (int i = int(l); i <= int(r); ++i)
+#define sz(v) int(v.size())
+#define all(v) v.begin(), v.end()
+#define pb push_back
+#define mp make_pair
+#define x first
+#define y1 ________y1
+#define y second
+#define ft first
+#define sc second
+#define pt pair<int, int>
+
+template <typename X> inline X abs(const X &a) { return a < 0 ? -a : a; }
+template <typename X> inline X sqr(const X &a) { return a * a; }
+
+typedef long long li;
+typedef long double ld;
+
+using namespace std;
+
+const int INF = 1000 * 1000 * 1000;
+const ld EPS = 1e-9;
+const ld PI = acos(-1.0);
+
+int n;
+int lf, rg;
+
+bool read() {
+  cin >> n;
+  return true;
+}
+
+void solve() {
+  lf = 1, rg = n;
+  int it = 0;
+  while (rg - lf > 0) {
+    it++;
+    int mid = (lf + rg + 1) / 2;
+    cout << mid << endl;
+    fflush(stdout);
+    string s;
+    cin >> s;
+    if (s == "<")
+      rg = mid - 1;
+    else
+      lf = mid;
+    if (it > 5) {
+      while (true) {
+        cout << rand() % n + 1;
+        fflush(stdout);
+      }
+    }
+  }
+  cout << "! " << lf << endl;
+}
+
+int main() {
+  srand(time(NULL));
+  cerr << setprecision(10) << fixed;
+  assert(read());
+  solve();
+  return 0;
+}

rbx/testdata/interactive/sols/af_inf_cout_without_flush.cpp

@@ -0,0 +1,78 @@
+#include <algorithm>
+#include <cassert>
+#include <cmath>
+#include <cstdio>
+#include <cstring>
+#include <ctime>
+#include <iomanip>
+#include <iostream>
+#include <map>
+#include <queue>
+#include <set>
+#include <sstream>
+#include <string>
+#include <vector>
+
+#define forn(i, n) for (int i = 0; i < n; ++i)
+#define fore(i, l, r) for (int i = int(l); i <= int(r); ++i)
+#define sz(v) int(v.size())
+#define all(v) v.begin(), v.end()
+#define pb push_back
+#define mp make_pair
+#define x first
+#define y1 ________y1
+#define y second
+#define ft first
+#define sc second
+#define pt pair<int, int>
+
+template <typename X> inline X abs(const X &a) { return a < 0 ? -a : a; }
+template <typename X> inline X sqr(const X &a) { return a * a; }
+
+typedef long long li;
+typedef long double ld;
+
+using namespace std;
+
+const int INF = 1000 * 1000 * 1000;
+const ld EPS = 1e-9;
+const ld PI = acos(-1.0);
+
+int n;
+int lf, rg;
+
+bool read() {
+  cin >> n;
+  return true;
+}
+
+void solve() {
+  lf = 1, rg = n;
+  int it = 0;
+  while (rg - lf > 0) {
+    it++;
+    int mid = (lf + rg + 1) / 2;
+    cout << mid << endl;
+    fflush(stdout);
+    string s;
+    cin >> s;
+    if (s == "<")
+      rg = mid - 1;
+    else
+      lf = mid;
+    if (it > 5) {
+      while (true) {
+        cout << rand() % n + 1;
+      }
+    }
+  }
+  cout << "! " << lf << endl;
+}
+
+int main() {
+  srand(time(NULL));
+  cerr << setprecision(10) << fixed;
+  assert(read());
+  solve();
+  return 0;
+}