vaskes/algorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

[ya-day1] 6 1 B yandex solution

Browse Source
This commit is contained in:
Vasily Guzov
2024-11-10 16:14:16 +03:00
parent adbb265d1b
commit 5c452053f5
2 changed files with 82 additions and 36 deletions
Download Patch File Download Diff File Expand all files Collapse all files
lib/tiShortChoser/tiShortChoser.ts
+77 -31
View File
@@ -1,3 +1,54 @@
// export function tiShortChoser(
// tB: number,
// tR: number,
// sB: number,
// sR: number,
// ) {
// let tishort = 0;
// let socks = 0;
// const blueIsGrater = tB + sB > tR + sR;
// const isEquaal = tB + sB === tR + sR;
// const tIsEquale = tB === tR && tB > 0;
// const sIsEquale = sB === sR && sB > 0;
// const isBlue = tB === sB && !tIsEquale && !sIsEquale;
// const isRed = tR === sR && !tIsEquale && !sIsEquale;
// if (blueIsGrater) {
// tishort = sIsEquale && !isEquaal ? 1 : tR + 1;
// socks = tIsEquale || isEquaal ? 1 : sR + 1;
// } else {
// tishort = sIsEquale && !isEquaal ? 1 : tB + 1;
// socks = tIsEquale || isEquaal ? 1 : sB + 1;
// }
// if (tB === 0 || tR === 0) {
// tishort = 1;
// socks = tB === 0 ? sB + 1 : sR + 1;
// }
// if (sB === 0 || sR === 0) {
// socks = 1;
// tishort = sB === 0 ? tB + 1 : tR + 1;
// }
// if (isRed) {
// tishort = tR + 1;
// socks = 1;
// }
// if (isBlue) {
// tishort = tB + 1;
// socks = 1;
// }
// if (isBlue && isRed && (tB !== 0 || sB !== 0)) {
// tishort = 2;
// socks = 1;
// }
// return [tishort, socks].join(" ");
// }
export function tiShortChoser(
tB: number,
tR: number,
@@ -6,46 +57,41 @@ export function tiShortChoser(
) {
let tishort = 0;
let socks = 0;
const blueIsGrater = tB + sB > tR + sR;
const isEquaal = tB + sB === tR + sR;
const tIsEquale = tB === tR && tB > 0;
const sIsEquale = sB === sR && sB > 0;
const isBlue = tB === sB && !tIsEquale && !sIsEquale;
const isRed = tR === sR && !tIsEquale && !sIsEquale;
const ans: number[][] = [];
if (blueIsGrater) {
tishort = sIsEquale && !isEquaal ? 1 : tR + 1;
socks = tIsEquale || isEquaal ? 1 : sR + 1;
} else {
tishort = sIsEquale && !isEquaal ? 1 : tB + 1;
socks = tIsEquale || isEquaal ? 1 : sB + 1;
}
if (tB === 0 || tR === 0) {
tishort = 1;
socks = tB === 0 ? sB + 1 : sR + 1;
}
if (sB === 0 || sR === 0) {
socks = 1;
tishort = sB === 0 ? tB + 1 : tR + 1;
}
if (isRed) {
if (tB > 0 && sB > 0) {
tishort = tR + 1;
socks = 1;
socks = sR + 1;
ans.push([tishort, socks])
}
if (isBlue) {
if (tR > 0 && sR > 0) {
tishort = tB + 1;
socks = 1;
socks = sB + 1;
ans.push([tishort, socks])
}
if (isBlue && isRed && (tB !== 0 || sB !== 0)) {
tishort = 2;
if (tB > 0 && tR > 0) {
tishort = Math.max(tB, tR) + 1;
socks = 1;
ans.push([tishort, socks])
}
return [tishort, socks].join(" ");
if (sB > 0 && sR > 0) {
tishort = 1;
socks = Math.max(sB, sR) + 1;
ans.push([tishort, socks])
}
const result = ans.reduce((acc, currentValue) => {
const [t, s] = currentValue;
const [minT, minS] = acc;
const minSum = minT + minS;
const curSum = t + s;
if (acc.length === 0) return currentValue;
return (curSum < minSum) ? currentValue : acc;
}, [] as number[])
return result.join(" ");
}