Kiyago (stylized as キヤー子) stands for Kiyago Is Yet Another Grader Optimized for POSN-KKU (recursive nomenclature is the best).

Kiyago offers more flexible choice of grading task for competitive programming contest. Each problem is fully customizable and inherently well-structured.

• Scalable for future projects.
• Error well-handled.
• Well structured.
• Easy to maintain.

Python 3.8 or newer

sudo apt install python3

All problem directory goes in problems/ which itself placed in root directory of the project.

To use standard_judge a problem directory is required to follow this struture :

PROBLEM_ID/
├── compile_space/
├── inputs/
├── solutions/
└── config.yaml

Please read this table for more information :

Example :

problems/
└── 001/
   ├── compile_space/
   │   ├── 001_001.c
   │   └── 001_001_bin
   ├── inputs/
   │   ├── 1.in
   │   ├── 2.in
   │   └── 3.in
   ├── solutions/
   │   ├── 1.sol
   │   ├── 2.sol
   │   └── 3.sol
   └── config.yaml

However, if the problem uses custom_judge, Kiyago offers full flexibity to the custom_judge by only requires compile_space and config.yaml to exist in the problem's root directory. Please note that compiling task still belongs to Kiyago.

problems/
└── 002/
   ├── compile_space/
   │   ├── custom_lib_1.h
   │   ├── custom_lib_2.h
   │   ├── 001_001.c
   │   └── 001_001_bin
   ├── judge_binary
   └── config.yaml

While every subject's binary is deleted after finished grading, their coresponded source file is moved to archives/USER_ID/PROBLEM_ID and renamed to the time its was submitted as second since EPOCH (any decimal point is removed).

In this example, there are 2 problems and 3 subjects.

.
└── archives/
    ├── 001/
    │   ├──001/
    │   │  ├── 1591386889.cpp
    │   │  └── 1591387078.cpp
    │   └──002/
    │      ├── 1591387921.cpp
    │      └── 1591388078.cpp
    ├── 002/
    │   ├──001/
    │   │  └── 1591387143.cpp
    │   └──002/
    │      ├── 1591387951.cpp
    │      ├── 1591388239.cpp
    │      └── 1591388312.cpp
    └── 003/
        ├──001/
        │  └── 1591385127.cpp
        └──002/
           └── 1591388299.cpp

.
├── archives/
│   ├── 001/
│   │   ├──001/
│   │   │  ├── 1591386889.cpp
│   │   │  └── 1591387078.cpp
│   │   └──002/
│   ├── 002/
│   └── 003/
├── kiyago/
├── problems/
│   ├── 001/
│   │   ├── compile_space/
│   │   │   └── subject_src.c
│   │   ├── inputs/
│   │   │   ├── 1.in
│   │   │   ├── 2.in
│   │   │   └── 3.in
│   │   ├── solutions/
│   │   │   ├── 1.sol
│   │   │   ├── 2.sol
│   │   │   └── 3.sol
│   │   ├── config.yaml
│   │   └── subject_bin
│   └── 002/
│       ├── compile_space/
│       │   ├── custom_header_1.h
│       │   └── custom_header_2.h
│       ├── config.yaml
│       └── grading_binary
├── run_kiyago
├── LICENSE
└── README.md

Strictly enforced (OTOG standard) :

Optional (replace X):

Custom grading binary/script (shall be, henceforth, called "custom_judge") runs once per testcase using command in config.yaml.

To enable custom_judge, add this to config.yaml

custom_judge : True
judge_command : CMD_TO_RUN_JUDGE

If you use the custom judge, Kiyago provides these following information via :

[PROBLEM_DIR]/judge_binary [PROBLEM_DIR] [#]

For example

// judge_binary.c
char *current_dir = argv[1];
int   this_case   = atoi(argv[2]);

The verdict of the testcase are expected to contain ALL of these following information for each testcase.

where KESE stands for Kiyago Standard Error Signal which are :

passing through STDOUT via PIPE using this format :

verdic;elapse;score;kses

For example, if the program ran correctly; 25 ms elapsed; 10 score for each case :

P;25;10;OK

Partially correct; 73 ms elapsed; scored 5 :

S;5;73;OK

Runtime error of segmentation fault:

X;0;0;SEGMFLT

TLE :

T;0;0;TIMELXC

Please note that verdic could contain ; nor whitespace in it.

If there is any non-standard formatting (e.g. extra ; or any absence of data)

T;0;

The ! verdict are automatically thrown with KSES of JUDGEER.

!;0;0;JUDGEER

• Krit Patyarath - Original work - pannxe

This project is licensed under the MIT License - see the LICENSE file for details