Weishen/Hydro
2
0 Fork 0
mirror of https://gitcode.com/gh_mirrors/hy/Hydro.git synced 2026-10-17 09:36:08 +08:00
Code Issues Packages Projects Releases Wiki Activity

judge: objective: new syntax support

Browse Source
This commit is contained in:
undefined committed 2022-12-29 18:00:40 +08:00
1 parent b606ab2852
commit 44b2911f77
2 files changed
+32 -77
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

packages/hydrojudge/src/judge/objective.ts
+31 -76
View File
@@ -32,83 +32,38 @@ export async function judge({
let totalStatus = 0;
if (!Object.keys(answers).length) throw new FormatError('Invalid standard answer.');
for (const key in config.answers) {
const [subtaskId, caseId] = key.split('-').map(Number);
const ansInfo = config.answers[key] as [string | string[], number];
const score = (+ansInfo[1]) || 0;
const baseInfo = {
subtaskId,
id: caseId,
time: 0,
memory: 0,
const ansInfo = config.answers[key] as [string | string[], number] | Record<string, number>;
// eslint-disable-next-line @typescript-eslint/no-loop-func
const report = (status: STATUS, score: number, message: string) => {
const [subtaskId, caseId] = key.split('-').map(Number);
totalScore += score;
totalStatus = Math.max(totalStatus, status);
next({
status: totalStatus,
case: {
subtaskId,
id: caseId,
time: 0,
memory: 0,
status,
score,
message,
},
});
};
if (typeof answers[key] === 'string') {
const stdAns = typeof ansInfo[0] === 'string' ? [ansInfo[0]] : ansInfo[0];
if (stdAns.some((ans) => ans.trim() === (answers[key] as any)?.trim())) {
totalScore += score;
totalStatus = Math.max(totalStatus, STATUS.STATUS_ACCEPTED);
next({
status: totalStatus,
case: {
...baseInfo,
status: STATUS.STATUS_ACCEPTED,
score,
message: 'Correct',
},
});
} else {
totalStatus = STATUS.STATUS_WRONG_ANSWER;
next({
status: totalStatus,
case: {
...baseInfo,
status: STATUS.STATUS_WRONG_ANSWER,
score: 0,
message: 'Incorrect',
},
});
}
} else {
const stdAns = new Set(ansInfo[0] || []);
const ans = new Set(answers[key] || []);
const correct = stdAns.size === ans.size && [...stdAns].every((x) => ans.has(x));
const partialCorrect = [...stdAns].some((x) => ans.has(x)) && [...ans].every((x) => stdAns.has(x));
if (correct) {
totalScore += score;
totalStatus = Math.max(totalStatus, STATUS.STATUS_ACCEPTED);
next({
status: totalStatus,
case: {
...baseInfo,
status: STATUS.STATUS_ACCEPTED,
score,
message: 'Correct',
},
});
} else if (partialCorrect) {
totalScore += Math.floor(score / 2);
totalStatus = STATUS.STATUS_WRONG_ANSWER;
next({
status: totalStatus,
case: {
...baseInfo,
status: STATUS.STATUS_WRONG_ANSWER,
score: Math.floor(score / 2),
message: 'Partially Correct',
},
});
} else {
totalStatus = STATUS.STATUS_WRONG_ANSWER;
next({
status: totalStatus,
case: {
...baseInfo,
status: STATUS.STATUS_WRONG_ANSWER,
score: 0,
message: 'Incorrect',
},
});
}
}
const usrAns = answers[key].toString();
if (ansInfo instanceof Array) {
const fullScore = (+ansInfo[1]) || 0;
const stdAns = ansInfo[0];
if (stdAns instanceof Array) {
const ans = new Set(answers[key] instanceof Array ? answers[key] : [answers[key]]);
if (stdAns.length === ans.size && Set.isSuperset(ans, stdAns)) report(STATUS.STATUS_ACCEPTED, fullScore, 'Correct');
else if (ans.size && Set.isSuperset(ans, stdAns)) report(STATUS.STATUS_WRONG_ANSWER, Math.floor(fullScore / 2), 'Partially Correct');
else report(STATUS.STATUS_WRONG_ANSWER, 0, 'Incorrect');
} else if (stdAns.toString() === usrAns.trim()) report(STATUS.STATUS_ACCEPTED, fullScore, 'Correct ');
else report(STATUS.STATUS_WRONG_ANSWER, 0, 'Incorrect');
} else if (!ansInfo[usrAns]) report(STATUS.STATUS_WRONG_ANSWER, 0, 'Incorrect');
else report(STATUS.STATUS_ACCEPTED, +ansInfo[usrAns] || 0, 'Correct');
}
end({
status: totalStatus, score: totalScore, time: 0, memory: 0,
packages/utils/lib/common.ts
+1 -1
View File
@@ -14,7 +14,7 @@ declare global {
sum: (...args: Array<number[] | number>) => number;
}
interface SetConstructor {
isSuperset: (set: Set<any>, subset: Set<any>) => boolean;
isSuperset: (set: Set<any>, subset: Set<any> | Array<any>) => boolean;
intersection: <T>(setA: Set<T> | Array<T>, setB: Set<T> | Array<T>) => Set<T>;
union: <T>(setA: Set<T> | Array<T>, setB: Set<T> | Array<T>) => Set<T>;
}