結果
| 問題 |
No.177 制作進行の宮森あおいです！
|
| コンテスト | |
| ユーザー |
 ぴろず
|
| 提出日時 | 2015-04-02 23:41:38 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 114 ms / 2,000 ms |
| コード長 | 5,687 bytes |
| コンパイル時間 | 2,364 ms |
| コンパイル使用メモリ | 79,564 KB |
| 実行使用メモリ | 53,040 KB |
| 最終ジャッジ日時 | 2024-07-04 01:27:57 |
| 合計ジャッジ時間 | 4,079 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 13 |
ソースコード
package no177;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
public class Main {
static IO io = new IO();
public static void main(String[] args) {
int w = io.nextInt();
int n = io.nextInt();
int[] J = io.nextIntArray(n);
int m = io.nextInt();
int[] C = io.nextIntArray(m);
MaximumFlow mf = new MaximumFlow(n+m+2, n+m, n+m+1);
for(int i=0;i<n;i++) {
mf.addEdge(n+m, i, J[i]);
}
for(int i=0;i<m;i++) {
mf.addEdge(n+i, n+m+1, C[i]);
}
for(int i=0;i<m;i++) {
int q = io.nextInt();
boolean[] bad = new boolean[n];
for(int j=0;j<q;j++) {
bad[io.nextInt()-1] = true;
}
for(int j=0;j<n;j++) {
if (!bad[j]) {
mf.addEdge(j, n+i, w);
}
}
}
System.out.println(mf.fordFulkerson() >= w ? "SHIROBAKO" : "BANSAKUTSUKITA");
}
}
class MaximumFlow {
public static final int INF = 100000000;
int V;
int source;
int sink;
ArrayList<Edge>[] graph;
boolean[] used;
@SuppressWarnings("unchecked")
public MaximumFlow(int V,int source,int sink) {
this.V = V;
this.source = source;
this.sink = sink;
graph = new ArrayList[V];
for(int i=0;i<V;i++) {
graph[i] = new ArrayList<Edge>();
}
used = new boolean[V];
}
public void addEdge(int from,int to,int cap) {
graph[from].add(new Edge(to,cap,graph[to].size()));
graph[to].add(new Edge(from,0,graph[from].size()-1));
}
public int fordFulkerson() {
int flow = 0;
while(true) {
Arrays.fill(used, false);
int f = dfsFF(source,sink,INF);
if (f==0) {
break;
}
flow += f;
}
return flow;
}
private int dfsFF(int v,int t,int f) {
if (v==t) {
return f;
}
used[v] = true;
for(int i=0;i<graph[v].size();i++) {
Edge e = graph[v].get(i);
if(!used[e.to] && e.cap>0) {
int d = dfsFF(e.to,t,Math.min(f, e.cap));
if(d>0) {
e.cap-=d;
graph[e.to].get(e.rev).cap += d;
return d;
}
}
}
return 0;
}
}
class Edge {
int to;
int cap;
int rev;
public Edge(int to,int cap,int rev) {
this.to = to;
this.cap = cap;
this.rev = rev;
}
}
class IO extends PrintWriter {
private final InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
public IO() { this(System.in);}
public IO(InputStream source) { super(System.out); this.in = source;}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}
public String next() {
if (!hasNext()) {
throw new NoSuchElementException();
}
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public char[] nextCharArray(int len) {
if (!hasNext()) {
throw new NoSuchElementException();
}
char[] s = new char[len];
int i = 0;
int b = readByte();
while(isPrintableChar(b)) {
if (i == len) {
throw new InputMismatchException();
}
s[i++] = (char) b;
b = readByte();
}
return s;
}
public String nextLine() {
if (!hasNextLine()) {
throw new NoSuchElementException();
}
StringBuilder sb = new StringBuilder();
int b = readByte();
while(!isNewLine(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) {
throw new NoSuchElementException();
}
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
throw new NumberFormatException();
}
return (int) nl;
}
public char nextChar() {
if (!hasNext()) {
throw new NoSuchElementException();
}
return (char) readByte();
}
public double nextDouble() { return Double.parseDouble(next());}
public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}