#655476 (C++14) No.1502 Many Simple Additions

• 問題: No.1502 Many Simple Additions
• ユーザー: tnakao0123
• 提出日時: 2021-05-08 02:20:04
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 2,769 bytes
• コンパイル時間: 1,160 ms
• コンパイル使用メモリ: 103,880 KB
• 実行使用メモリ: 11,208 KB
• 最終ジャッジ日時: 2024-09-15 16:37:56
• 合計ジャッジ時間: 3,330 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

ファイルパターン	結果
sample	AC * 5
other	AC * 35 WA * 4

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
/* -*- coding: utf-8 -*-
 *
 * 1502.cc:  No.1502 Many Simple Additions - yukicoder
 */
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;
/* constant */
const int MAX_N = 100000;
const int MOD = 1000000007;
/* typedef */
typedef long long ll;
typedef queue<int> qi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
/* global variables */
vpii nbrs[MAX_N];
int ps[MAX_N], as[MAX_N];
ll bs[MAX_N];
/* subroutines */
/* main */
int main() {
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 0; i < m; i++) {
    int x, y, z;
    scanf("%d%d%d", &x, &y, &z);
    x--, y--;
    nbrs[x].push_back(pii(y, z));
    nbrs[y].push_back(pii(x, z));
  }
  int p0 = 1, p1 = 1;
  for (int st = 0; st < n; st++)
    if (as[st] == 0) {
      ps[st] = -1;
      as[st] = 1, bs[st] = 0;
      int minx = 1, maxx = k;
      bool minf = false, maxf = true;
      qi q;
      q.push(st);
      while (! q.empty()) {
    int u = q.front(); q.pop();
    for (auto pe: nbrs[u]) {
      int v = pe.first;
      ll z = pe.second;
      if (as[v] == 0) {
        ps[v] = u;
        // (au*x+bu)+(av*x+bv)=z -> av*x+bv=-au*x+(z-bu)
        as[v] = -as[u], bs[v] = z - bs[u];
        // 1<=av*x+bv<=k -> 1-bv<=av*x<=k-bv
        if (as[v] > 0) {
          // av == 1 -> 1-bv<=x<=k-bv
          ll x0 = 1 - bs[v], x1 = k - bs[v];
          if (maxx < x0 || x1 < minx) { puts("0"); return 0; }
          if (minx < x0) minx = x0, minf = false;
          if (maxx > x1) maxx = x1, maxf = true;
        }
        else {
          // av == -1 -> bv-1>=x>=bv-k
          ll x0 = bs[v] - k, x1 = bs[v] - 1;
          if (maxx < x0 || x1 < minx) { puts("0"); return 0; }
          if (minx < x0) minx = x0, minf = true;
          if (maxx > x1) maxx = x1, maxf = false;
        }
        q.push(v);
      }
      else if (v != ps[u]) {
        int sa = as[u] + as[v];
        ll sb = bs[u] + bs[v];
        if (sa == 0) {
          if (sb != z) { puts("0"); return 0; }
        }
        else {
          if ((z - sb) & 1) { puts("0"); return 0; }
          ll x = (z - sb) / sa;
          bool f = (as[u] * x + bs[u] == k) || (as[v] * x + bs[v] == k);
          if (maxx < x || x < minx) { puts("0"); return 0; }
          if (minx < x) minx = x, minf = f;
          if (maxx > x) maxx = x, maxf = f;
        }
      }
    }
      }
      //printf("minx=%d,minf=%d maxx=%d,maxf=%d\n", minx, minf, maxx, maxf);
      int r1 = maxx - minx + 1;
      int r0 = r1 - (minf ? 1 : 0) - (maxf ? 1 : 0);
      p0 = (ll)p0 * r0 % MOD;
      p1 = (ll)p1 * r1 % MOD;
    }
  printf("%d\n", (p1 + MOD - p0) % MOD);
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX