| Task: | Ruudukko |
| Sender: | Esinko |
| Submission time: | 2022-11-03 11:41:37 +0200 |
| Language: | Node.js |
| Status: | READY |
| Result: | 28 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 28 |
| #2 | TIME LIMIT EXCEEDED | 0 |
| #3 | TIME LIMIT EXCEEDED | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.11 s | 1, 2, 3 | details |
| #2 | ACCEPTED | 0.11 s | 1, 2, 3 | details |
| #3 | ACCEPTED | 0.11 s | 1, 2, 3 | details |
| #4 | ACCEPTED | 0.46 s | 2, 3 | details |
| #5 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
| #6 | TIME LIMIT EXCEEDED | -- | 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
}
function getPaths(relations, all, visited = []) {
let pathCount = relations.length // Every path of 0 length is still a path (right?)
if (visited.length === 0) ++pathCount
for (const [x, y] of relations) {
if (visited.includes(`${x}-${y}`)) continue
const nVisited = visited.slice(0)
nVisited.push(`${x}-${y}`)
pathCount += getPaths(all[`${x}-${y}`], all, nVisited)
}
return pathCount
}
// 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]))
// Calculate paths
const paths = Object.keys(relations)
.map((point, ) => getPaths(relations[point], relations))
.reduce((a, b) => a + b)
console.log(paths)
//console.log("Took", (performance.now() - start) / 1000 + "s")Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 3 1 1 1 1 1 1 1 1 1 |
| correct output |
|---|
| 9 |
| user output |
|---|
| 9 |
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 3 1 2 3 6 5 4 7 8 9 |
| correct output |
|---|
| 135 |
| user output |
|---|
| 135 |
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 3 7 8 1 4 5 4 3 9 6 |
| correct output |
|---|
| 57 |
| user output |
|---|
| 57 |
Test 4
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 10000 |
| user output |
|---|
| 10000 |
Test 5
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| correct output |
|---|
| 187458477 |
| user output |
|---|
| (empty) |
Test 6
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100 2995 8734 1018 2513 7971 5063 ... |
| correct output |
|---|
| 964692694 |
| user output |
|---|
| (empty) |
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) |
