Task: | Ruudukko |
Sender: | Turtleb01 |
Submission time: | 2022-11-02 13:14:34 +0200 |
Language: | Node.js |
Status: | READY |
Result: | 61 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 28 |
#2 | ACCEPTED | 33 |
#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.13 s | 2, 3 | details |
#5 | ACCEPTED | 0.15 s | 2, 3 | details |
#6 | ACCEPTED | 0.16 s | 2, 3 | details |
#7 | TIME LIMIT EXCEEDED | -- | 3 | details |
#8 | TIME LIMIT EXCEEDED | -- | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
const { readSync,readFileSync } = 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 mod = 1e9+7; const n = Number(readline()); //let buf = Buffer.alloc((String(n**2).length+1)*(n**2), 10); //console.log(readSync(0, buf,0,200000)); //const table = buf.toString("utf8").split("\n").filter(e=>e).map(e=>e.split(" ")).flat(1).map(e=>parseInt(e)); const tablestr = readFileSync(0,{encoding:"utf8"}); let table = []; let itemstr = ""; for(let i=0; i<tablestr.length; i++) { switch (tablestr[i]) { case " ": case "\n": itemstr&&table.push(parseInt(itemstr)); itemstr=""; break; default: itemstr+=tablestr[i]; } } let paths = Array(n**2).fill(0); let nummap = Array(n**2+10).fill(); //const nummap = Array(n**2+10).fill().map(()=>[]); //console.log(table.length); table.forEach((e,i)=>nummap[e]?nummap[e].push(i):nummap[e]=[i]); //table.forEach((e,i)=>nummap[e].push(i)); let newpaths = []; nummap.forEach((e,i)=>{ // if(!(i%1000)) console.log(i); if(e) { newpaths = []; e.forEach(x=>{ let sum = 1; let a=x-x%n, b=x%n; for(let y=0;y<n;y++) { sum+=paths[a+y]; sum+=paths[b+y*n]; } newpaths.push([x,sum%mod]); }) newpaths.forEach(e=>paths[e[0]]=e[1]); // console.log(paths); } }); console.log((paths.reduce((v,e)=>(v+e)%mod,0)%mod).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: ACCEPTED
input |
---|
100 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
correct output |
---|
187458477 |
user output |
---|
187458477 |
Test 6
Group: 2, 3
Verdict: ACCEPTED
input |
---|
100 2995 8734 1018 2513 7971 5063 ... |
correct output |
---|
964692694 |
user output |
---|
964692694 |
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) |