| Task: | Ruudukko |
| Sender: | Turtleb01 |
| Submission time: | 2022-11-01 00:05:16 +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.20 s | 2, 3 | details |
| #5 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
| #6 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
| #7 | RUNTIME ERROR | 0.11 s | 3 | details |
| #8 | RUNTIME ERROR | 0.11 s | 3 | details |
| #9 | RUNTIME ERROR | 0.11 s | 3 | details |
Code
const { readSync } = require('fs');
const { Buffer } = require('buffer');
function readline() {
let buf = Buffer.alloc(1000, 10);
for(i=0; i<1000; i++) {
if(!readSync(0, buf, i, 1) || buf[i]===10) {
return buf.toString("utf8").split("\n")[0];
}
}
}
const n = Number(readline());
const table = Array(n).fill().map(()=>readline().split(" ").map(f=>Number(f))).flat();
const paths = [];
const nummap = [];
table.forEach(e=>nummap[e]=true);
for(let i=1;i<=n**2;i++) {
if(nummap[i])
for(let x=0;x<n**2;x++) {
if(table[x]==i) {
paths[x]=1;
for(let y=0;y<n;y++) {
if(table[x-x%n+y]<i) {
paths[x]+=paths[x-x%n+y];
}
if(table[x%n+y*n]<i) {
paths[x]+=paths[x%n+y*n];
}
}
}
}
// console.log(paths);
}
console.log((paths.reduce((v,e)=>v+BigInt(e),0n)%BigInt(1e9+7)).toString());
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: RUNTIME ERROR
| input |
|---|
| 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 1000000 |
| user output |
|---|
| (empty) |
Error:
/box/input/code.js:17
const table = Array(n).fill().map(()=>readline().split(" ").map(f=>N...Test 8
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 1000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| correct output |
|---|
| 229147081 |
| user output |
|---|
| (empty) |
Error:
/box/input/code.js:17
const table = Array(n).fill().map(()=>readline().split(" ").map(f=>N...Test 9
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 1000 520283 805991 492643 75254 527... |
| correct output |
|---|
| 951147313 |
| user output |
|---|
| (empty) |
Error:
/box/input/code.js:17
const table = Array(n).fill().map(()=>readline().split(" ").map(f=>N...