#147927 (C++11（廃止可能性あり）) No.177 制作進行の宮森あおいです！

• 問題: No.177 制作進行の宮森あおいです！
• ユーザー: yuppe19 😺
• 提出日時: 2017-02-05 16:57:13
• 言語: C++11（廃止可能性あり） (gcc 13.3.0)
• 結果: AC
• 実行時間: 2 ms / 2,000 ms
• コード長: 5,741 bytes
• コンパイル時間: 1,090 ms
• コンパイル使用メモリ: 92,716 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-12-24 06:34:02
• 合計ジャッジ時間: 1,866 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

ファイルパターン	結果
sample	AC * 3
other	AC * 13

コンパイルメッセージ

main.cpp: In function ‘int main()’:
main.cpp:206:18: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  206 |   int w, n; scanf("%d%d", &w, &n);
      |             ~~~~~^~~~~~~~~~~~~~~~
main.cpp:208:33: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  208 |   for(int i=0; i<n; ++i) { scanf("%d", &J[i]); }
      |                            ~~~~~^~~~~~~~~~~~~
main.cpp:209:15: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  209 |   int m; scanf("%d", &m);
      |          ~~~~~^~~~~~~~~~
main.cpp:211:33: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  211 |   for(int i=0; i<m; ++i) { scanf("%d", &C[i]); }
      |                            ~~~~~^~~~~~~~~~~~~
main.cpp:214:17: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  214 |     int q; scanf("%d", &q);
      |            ~~~~~^~~~~~~~~~
main.cpp:216:19: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  216 |       int x; scanf("%d", &x);
      |              ~~~~~^~~~~~~~~~

ソースコード

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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
#include <iostream>
#include <algorithm>
#include <array>
#include <tuple>
#include <queue>
using namespace std;
constexpr int inf = 987654321;
struct Edge {
  int dst, rev;
  int capa;
  int cost;
};
class Graph {
protected:
  int size;
  vector<vector<Edge>> g;
public:
  Graph(int size) : size(size) { g.resize(size); }
  void add_edge(int src, int dst, int capa);
  void add_edge(int src, int dst, int capa, int cost);
  int max_flow(int s, int t) { throw; }
  int min_cost_flow_ford(int s, int t, int flow); // ベルマンフォード
  int min_cost_flow_dijk(int s, int t, int flow); // ダイクストラ
};
class FordFulkerson : public Graph {
  vector<bool> used;
  int dfs(int v, int t, int flow);
public:
  FordFulkerson(int size) : Graph(size) {}
  int max_flow(int s, int t);
};
class Dinic : public Graph {
  vector<int> level, iter;
  void bfs(int s);
  int dfs(int v, int t, int flow);
public:
  Dinic(int size) : Graph(size) {}
  int max_flow(int s, int t);
};
void Graph::add_edge(int src, int dst, int capa) {
  add_edge(src, dst, capa, 0);
}
void Graph::add_edge(int src, int dst, int capa, int cost) {
  g[src].push_back(Edge({dst, int(g[dst].size()),   capa,  cost}));
  g[dst].push_back(Edge({src, int(g[src].size())-1,    0, -cost}));
}
int Graph::min_cost_flow_ford(int s, int t, int flow) {
  int res = 0;
  vector<int> prev_v(size), prev_e(size);
  vector<int> dist;
  while(flow > 0) {
    dist.assign(size, inf);
    dist[s] = 0;
    bool update = true;
    while(update) {
      update = false;
      for(int v=0; v<size; ++v) {
        if(dist[v] == inf) { continue; }
        for(int i=0, n=g[v].size(); i<n; ++i) {
          Edge& e = g[v][i];
          if(e.capa > 0 && dist[e.dst] > dist[v] + e.cost) {
            dist[e.dst] = dist[v] + e.cost;
            prev_v[e.dst] = v;
            prev_e[e.dst] = i;
            update = true;
          }
        }
      }
    }
    if(dist[t] == inf) { return inf; }
    int d = flow;
    for(int v=t; v!=s; v=prev_v[v]) {
      d = min(d, g[prev_v[v]][prev_e[v]].capa);
    }
    flow -= d;
    res += d * dist[t];
    for(int v=t; v!=s; v=prev_v[v]) {
      Edge& e = g[prev_v[v]][prev_e[v]];
      e.capa -= d;
      g[v][e.rev].capa += d;
    }
  }
  return res;
}
int Graph::min_cost_flow_dijk(int s, int t, int flow) {
  int res = 0;
  vector<int> prev_v(size), prev_e(size);
  vector<int> h(size);
  while(flow > 0) {
    vector<int> dist(size, inf);
    dist[s] = 0;
    queue<pair<int, int>> que;
    // 最短距離、番号
    que.emplace(0, s);
    while(!que.empty()) {
      int c, v; tie(c, v) = que.front(); que.pop();
      if(dist[v] < c) { continue; }
      for(int i=0; i<g[v].size(); ++i) {
        Edge& e = g[v][i];
        if(e.capa > 0 && dist[e.dst] > dist[v] + e.cost + h[v] - h[e.dst]) {
          dist[e.dst] = dist[v] + e.cost + h[v] - h[e.dst];
          prev_v[e.dst] = v;
          prev_e[e.dst] = i;
          que.emplace(dist[e.dst], e.dst);
        }
      }
    }
    if(dist[t] == inf) { return inf; }
    for(int v=0; v<size; ++v) { h[v] += dist[v]; }
    int d = flow;
    for(int v=t; v!=s; v=prev_v[v]) {
      d = min(d, g[prev_v[v]][prev_e[v]].capa);
    }
    flow -= d;
    res += d * h[t];
    for(int v=t; v!=s; v=prev_v[v]) {
      Edge& e = g[prev_v[v]][prev_e[v]];
      e.capa -= d;
      g[v][e.rev].capa += d;
    }
  }
  return res;
}
int FordFulkerson::dfs(int v, int t, int flow) {
  if(v == t) { return flow; }
  used[v] = true;
  for(Edge& e : g[v]) {
    if(used[e.dst] || e.capa <= 0) { continue; }
    int d = dfs(e.dst, t, min(flow, e.capa));
    if(d > 0) {
      e.capa -= d;
      g[e.dst][e.rev].capa += d;
      return d;
    }
  }
  return 0;
}
int FordFulkerson::max_flow(int s, int t) {
  int res = 0;
  while(true) {
    used.assign(size, false);
    int flow = dfs(s, t, inf);
    if(flow == 0) { return res; }
    res += flow;
    if(res >= inf) { return inf; }
  }
}
void Dinic::bfs(int s) {
  level.assign(size, -1);
  queue<int> que;
  level[s] = 0;
  que.push(s);
  while(!que.empty()) {
    int v = que.front(); que.pop();
    for(Edge& e : g[v]) {
      if(e.capa > 0 && level[e.dst] < 0) {
        level[e.dst] = level[v] + 1;
        que.push(e.dst);
      }
    }
  }
}
int Dinic::dfs(int v, int t, int flow) {
  if(v == t) { return flow; }
  for(int& i=iter[v], n=g[v].size(); i<n; ++i) {
    Edge& e = g[v][i];
    if(e.capa <= 0 || level[v] >= level[e.dst]) { continue; }
    int d = dfs(e.dst, t, min(flow, e.capa));
    if(d > 0) {
      e.capa -= d;
      g[e.dst][e.rev].capa += d;
      return d;
    }
  }
  return 0;
}
int Dinic::max_flow(int s, int t) {
  int res = 0;
  while(true) {
    bfs(s);
    if(level[t] < 0) { return res; }
    iter.assign(size, 0);
    int flow;
    while((flow = dfs(s, t, inf)) > 0) {
      res += flow;
      if(res >= inf) { return inf; }
    }
  }
}
int main(void) {
  int w, n; scanf("%d%d", &w, &n);
  vector<int> J(n);
  for(int i=0; i<n; ++i) { scanf("%d", &J[i]); }
  int m; scanf("%d", &m);
  vector<int> C(m);
  for(int i=0; i<m; ++i) { scanf("%d", &C[i]); }
  vector<vector<bool>> G(n, vector<bool>(m, true)); // G[n][m]
  for(int i=0; i<m; ++i) {
    int q; scanf("%d", &q);
    for(int j=0; j<q; ++j) {
      int x; scanf("%d", &x);
      G[--x][i] = false;
    }
  }
  Dinic graph(n + m + 2);
  int s = n + m, t = s + 1;
  for(int i=0; i<n; ++i) {
    graph.add_edge(s, i, J[i]);
  }
  for(int i=0; i<m; ++i) {
    graph.add_edge(n+i, t, C[i]);
  }
  for(int i=0; i<n; ++i) {
    for(int j=0; j<m; ++j) {
      if(G[i][j]) {
        graph.add_edge(i, n+j, inf);
      }
    }
  }
  int min_cut = graph.max_flow(s, t);
  bool able = min_cut >= w;
  puts(able ? "SHIROBAKO" : "BANSAKUTSUKITA");
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX