| Task: | Ruudukko |
| Sender: | Esinko |
| Submission time: | 2022-11-04 00:22:44 +0200 |
| Language: | Node.js |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.11 s | 1, 2, 3 | details |
| #2 | WRONG ANSWER | 0.11 s | 1, 2, 3 | details |
| #3 | WRONG ANSWER | 0.11 s | 1, 2, 3 | details |
| #4 | WRONG ANSWER | 0.45 s | 2, 3 | details |
| #5 | WRONG ANSWER | 0.69 s | 2, 3 | details |
| #6 | WRONG ANSWER | 0.73 s | 2, 3 | details |
| #7 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #8 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
// const { performance } = require("perf_hooks")
// const start = performance.now()
// Get input
const [length, ...lines] = require("fs").readFileSync(0, "utf8").trim().split("\n").map(l => l.trim().split(" ").map(Number))
function getRelations(x, y) {
const val = lines[y][x]
const relations = []
// Above
for (let i = y; i > -1; i--){
if (lines[i][x] < val) relations.push([x, i])
}
// Below
for (let i = y; i < length; i++){
if (lines[i][x] < val) relations.push([x, i])
}
// Left
for (let i = x; i > -1; i--){
if (lines[y][i] < val) relations.push([i, y])
}
// Right
for (let i = x; i < length; i++){
if (lines[y][i] < val) relations.push([i, y])
}
return relations
}
// Build relational object
const relations = Object.fromEntries(lines
.map((line, y) => line.map((val, x) => ({
val,
x,
y,
relations: getRelations(x, y)
})))
.flat(1)
.map((obj) => [`${obj.x}-${obj.y}`, obj.relations]))
// console.log(" -> Parsed in", (performance.now() - start) / 1000 + "s")
// Calculate paths
function getPaths(pointRelations, visited = []) {
let pathCount = pointRelations.length // Every path of 0 length is still a path (right?)
if (visited.length === 0) ++pathCount
/*if (pointRelations.length > 0) pathCount += pointRelations
.filter(([x, y]) => !visited.includes(`${x}-${y}`))
.map(([x, y]) => getPaths(relations[`${x}-${y}`], visited.concat([x, y])))
.reduce((a, b) => a + b)*/
pathCount += pointRelations.length + 1
return pathCount
}
/*const paths = Object.keys(relations)
.map((point) => relations[point].length > 0 ? getPaths(relations[point]) : 0)
.reduce((a, b) => a + b)
% ((10 ** 9) + 7)*/
let paths = 0
for (const point in relations) {
paths += getPaths(relations[point])
}
console.log(paths)
// console.log(" -> Done in", (performance.now() - start) / 1000 + "s")Test details
Test 1
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 3 1 1 1 1 1 1 1 1 1 |
| correct output |
|---|
| 9 |
| user output |
|---|
| 18 |
Test 2
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 3 1 2 3 6 5 4 7 8 9 |
| correct output |
|---|
| 135 |
| user output |
|---|
| 54 |
Test 3
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 3 7 8 1 4 5 4 3 9 6 |
| correct output |
|---|
| 57 |
| user output |
|---|
| 52 |
Test 4
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 10000 |
| user output |
|---|
| 20000 |
Test 5
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| correct output |
|---|
| 187458477 |
| user output |
|---|
| 2000000 |
Test 6
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100 2995 8734 1018 2513 7971 5063 ... |
| correct output |
|---|
| 964692694 |
| user output |
|---|
| 1999804 |
Test 7
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 1000000 |
| user output |
|---|
| (empty) |
Test 8
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| correct output |
|---|
| 229147081 |
| user output |
|---|
| (empty) |
Test 9
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 520283 805991 492643 75254 527... |
| correct output |
|---|
| 951147313 |
| user output |
|---|
| (empty) |
