| Task: | Ruudukko |
| Sender: | Turtleb01 |
| Submission time: | 2022-11-02 13:55:18 +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.14 s | 2, 3 | details |
| #5 | WRONG ANSWER | 0.15 s | 2, 3 | details |
| #6 | WRONG ANSWER | 0.15 s | 2, 3 | details |
| #7 | WRONG ANSWER | 0.72 s | 3 | details |
| #8 | WRONG ANSWER | 0.83 s | 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());
const tablestr = readFileSync(0,{encoding:"utf8"});
let table = [];
let itemstr = "";
let nummap = Array(n**2+10).fill();
let e=0;
for(let i=0; i<tablestr.length; i++) {
switch (tablestr[i]) {
case " ":
case "\n":
if(itemstr) {
nummap[e]?nummap[e].push(parseInt(itemstr)):nummap[e]=[parseInt(itemstr)];
e++;
}
itemstr="";
break;
default:
itemstr+=tablestr[i];
}
}
//let nummap = Array(n**2+10).fill().map(()=>[]);
//let nummap = [];
//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 paths = Array(n**2).fill(0);
let xpaths = Array(n).fill(0);
let ypaths = Array(n).fill(0);
let newxpaths = [];
let newypaths = [];
nummap.forEach((a,i)=>{
// if(!(i%1000)) console.log(i);
if(a) {
newxpaths = [];
newypaths = [];
a.forEach(e=>{
let x=e%n;
let y=e/n|0;
let b=(1+xpaths[x]+ypaths[y])%mod;
// console.log(i,b);
newxpaths.push([x,b]);
newypaths.push([y,b]);
paths[e]=b;
});
newxpaths.forEach(e=>xpaths[e[0]]+=e[1]);
newypaths.forEach(e=>ypaths[e[0]]+=e[1]);
// console.log(xpaths, ypaths);
}
});
console.log(paths.reduce((v,e)=>(v+e)%mod,0).toString());
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 |
|---|
| 6561 |
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 |
|---|
| NaN |
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 |
|---|
| NaN |
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 |
|---|
| 631876486 |
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 |
|---|
| NaN |
Test 6
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100 2995 8734 1018 2513 7971 5063 ... |
| correct output |
|---|
| 964692694 |
| user output |
|---|
| 798423013 |
Test 7
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 1000000 |
| user output |
|---|
| 21645138 |
Test 8
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 1000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| correct output |
|---|
| 229147081 |
| user output |
|---|
| NaN |
Test 9
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 520283 805991 492643 75254 527... |
| correct output |
|---|
| 951147313 |
| user output |
|---|
| (empty) |
