Submission #66760963

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
'use strict'
const main = (arg) => {
  const input = arg.trim().split('\n')
  const [N, M] = input[0].split(' ').map(Number)
  const ABW = input.slice(1).map(line => line.split(' ').map(Number))
  
  // グラフ構築
  const graph = Array.from({ length: N + 1 }, () => [])
  for (const [a, b, w] of ABW) {
    graph[a].push([b, w])
  }
  
  // BFSで頂点1から各頂点へのXOR距離を計算
  const d = Array(N + 1).fill(-1)
  d[1] = 0
  const queue = [1]
  while (queue.length) {
    const u = queue.shift()
    for (const [v, w] of graph[u]) {
      if (d[v] === -1) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

'use strict'

const main = (arg) => {
  const input = arg.trim().split('\n')
  const [N, M] = input[0].split(' ').map(Number)
  const ABW = input.slice(1).map(line => line.split(' ').map(Number))
  
  // グラフ構築
  const graph = Array.from({ length: N + 1 }, () => [])
  for (const [a, b, w] of ABW) {
    graph[a].push([b, w])
  }
  
  // BFSで頂点1から各頂点へのXOR距離を計算
  const d = Array(N + 1).fill(-1)
  d[1] = 0
  const queue = [1]
  while (queue.length) {
    const u = queue.shift()
    for (const [v, w] of graph[u]) {
      if (d[v] === -1) {
        d[v] = d[u] ^ w
        queue.push(v)
      }
    }
  }
  
  if(d[N] === -1){
    console.log(-1)
    return
  }
  
  // XOR基底の構築
  let basis = []
  for (const [a, b, w] of ABW) {
    if(d[a] === -1 || d[b] === -1) continue
    let cycle = d[a] ^ w ^ d[b]
    // 基底に挿入
    for (let bval of basis) {
      cycle = Math.min(cycle, cycle ^ bval)
    }
    if(cycle !== 0){
      basis.push(cycle)
      basis.sort((x, y) => y - x) // 降順ソート
    }
  }
  
  // d[N]を基底で最小化
  let ans = d[N]
  for(let bval of basis){
    ans = Math.min(ans, ans ^ bval)
  }
  
  console.log(ans)
}

main(require('fs').readFileSync('/dev/stdin', 'utf8'))

Submission Info

Judge Result