結果
| 問題 | No.161 制限ジャンケン |
| ユーザー |
 uwi
|
| 提出日時 | 2015-03-05 23:50:20 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 72 ms / 5,000 ms |
| コード長 | 8,230 bytes |
| コンパイル時間 | 3,832 ms |
| コンパイル使用メモリ | 86,756 KB |
| 実行使用メモリ | 38,112 KB |
| 最終ジャッジ日時 | 2024-11-30 04:26:12 |
| 合計ジャッジ時間 | 5,732 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 16 |
ソースコード
package q2xx;import java.io.ByteArrayInputStream;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.List;public class Q252 {static InputStream is;static PrintWriter out;static String INPUT = "";static void solve(){int g = ni(), c = ni(), p = ni();char[] s = ns().toCharArray();int eg = 0, ec = 0, ep = 0;for(char x : s){if(x == 'G')eg++;if(x == 'C')ec++;if(x == 'P')ep++;}List<Edge> es = new ArrayList<>();int src = 6, sink = 7;es.add(new Edge(src, 0, g, 0));es.add(new Edge(src, 1, c, 0));es.add(new Edge(src, 2, p, 0));es.add(new Edge(3, sink, eg, 0));es.add(new Edge(4, sink, ec, 0));es.add(new Edge(5, sink, ep, 0));es.add(new Edge(0, 3, 9999, 2));es.add(new Edge(1, 4, 9999, 2));es.add(new Edge(2, 5, 9999, 2));es.add(new Edge(0, 4, 9999, 0));es.add(new Edge(1, 5, 9999, 0));es.add(new Edge(2, 3, 9999, 0));es.add(new Edge(0, 5, 9999, 3));es.add(new Edge(1, 3, 9999, 3));es.add(new Edge(2, 4, 9999, 3));out.println(3*s.length-solveMinCostFlow(compileWD(sink+1, es), src, sink, s.length));}public static class Edge{public int from, to;public int capacity;public int cost;public int flow;public Edge complement;// public int iniflow;public Edge(int from, int to, int capacity, int cost) {this.from = from;this.to = to;this.capacity = capacity;this.cost = cost;}}public static Edge[][] compileWD(int n, List<Edge> edges){Edge[][] g = new Edge[n][];// cloningfor(int i = edges.size()-1;i >= 0;i--){Edge origin = edges.get(i);Edge clone = new Edge(origin.to, origin.from, origin.capacity, -origin.cost);clone.flow = origin.capacity;clone.complement = origin;origin.complement = clone;edges.add(clone);}int[] p = new int[n];for(Edge e : edges)p[e.from]++;for(int i = 0;i < n;i++)g[i] = new Edge[p[i]];for(Edge e : edges)g[e.from][--p[e.from]] = e;return g;}public static long solveMinCostFlow(Edge[][] g, int source, int sink, long all){int n = g.length;long mincost = 0;int[] potential = new int[n];final int[] d = new int[n];MinHeap q = new MinHeap(n);while(all > 0){// shortest path src->sinkEdge[] inedge = new Edge[n];Arrays.fill(d, Integer.MAX_VALUE / 2);d[source] = 0;q.add(source, 0);while(q.size() > 0){int cur = q.argmin();q.remove(cur);for(Edge ne : g[cur]){if(ne.capacity - ne.flow > 0){int nd = d[cur] + ne.cost + potential[cur] - potential[ne.to];if(d[ne.to] > nd){inedge[ne.to] = ne;d[ne.to] = nd;q.update(ne.to, nd);}}}}if(inedge[sink] == null)break;long minflow = all;long sumcost = 0;for(Edge e = inedge[sink];e != null;e = inedge[e.from]){if(e.capacity - e.flow < minflow)minflow = e.capacity - e.flow;sumcost += e.cost;}mincost += minflow * sumcost;for(Edge e = inedge[sink];e != null;e = inedge[e.from]){e.flow += minflow;e.complement.flow -= minflow;}all -= minflow;for(int i = 0;i < n;i++){potential[i] += d[i];}}return mincost;}public static class MinHeap {public int[] a;public int[] map;public int[] imap;public int n;public int pos;public static int INF = Integer.MAX_VALUE;public MinHeap(int m){n = m+2;a = new int[n];map = new int[n];imap = new int[n];Arrays.fill(a, INF);Arrays.fill(map, -1);Arrays.fill(imap, -1);pos = 1;}public int add(int ind, int x){int ret = imap[ind];if(imap[ind] < 0){a[pos] = x; map[pos] = ind; imap[ind] = pos;pos++;up(pos-1);}return ret != -1 ? a[ret] : x;}public int update(int ind, int x){int ret = imap[ind];if(imap[ind] < 0){a[pos] = x; map[pos] = ind; imap[ind] = pos;pos++;up(pos-1);}else{int o = a[ret];a[ret] = x;up(ret);down(ret);// if(a[ret] > o){// up(ret);// }else{// down(ret);// }}return x;}public int remove(int ind){if(pos == 1)return INF;if(imap[ind] == -1)return INF;pos--;int rem = imap[ind];int ret = a[rem];map[rem] = map[pos];imap[map[pos]] = rem;imap[ind] = -1;a[rem] = a[pos];a[pos] = INF;map[pos] = -1;up(rem);down(rem);return ret;}public int min() { return a[1]; }public int argmin() { return map[1]; }public int size() { return pos-1; }private void up(int cur){for(int c = cur, p = c>>>1;p >= 1 && a[p] > a[c];c>>>=1, p>>>=1){int d = a[p]; a[p] = a[c]; a[c] = d;int e = imap[map[p]]; imap[map[p]] = imap[map[c]]; imap[map[c]] = e;e = map[p]; map[p] = map[c]; map[c] = e;}}private void down(int cur){for(int c = cur;2*c < pos;){int b = a[2*c] < a[2*c+1] ? 2*c : 2*c+1;if(a[b] < a[c]){int d = a[c]; a[c] = a[b]; a[b] = d;int e = imap[map[c]]; imap[map[c]] = imap[map[b]]; imap[map[b]] = e;e = map[c]; map[c] = map[b]; map[b] = e;c = b;}else{break;}}}}public static void main(String[] args) throws Exception{long S = System.currentTimeMillis();is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());out = new PrintWriter(System.out);solve();out.flush();long G = System.currentTimeMillis();tr(G-S+"ms");}private static boolean eof(){if(lenbuf == -1)return true;int lptr = ptrbuf;while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;try {is.mark(1000);while(true){int b = is.read();if(b == -1){is.reset();return true;}else if(!isSpaceChar(b)){is.reset();return false;}}} catch (IOException e) {return true;}}private static byte[] inbuf = new byte[1024];static int lenbuf = 0, ptrbuf = 0;private static int readByte(){if(lenbuf == -1)throw new InputMismatchException();if(ptrbuf >= lenbuf){ptrbuf = 0;try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }if(lenbuf <= 0)return -1;}return inbuf[ptrbuf++];}private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }private static double nd() { return Double.parseDouble(ns()); }private static char nc() { return (char)skip(); }private static String ns(){int b = skip();StringBuilder sb = new StringBuilder();while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')sb.appendCodePoint(b);b = readByte();}return sb.toString();}private static char[] ns(int n){char[] buf = new char[n];int b = skip(), p = 0;while(p < n && !(isSpaceChar(b))){buf[p++] = (char)b;b = readByte();}return n == p ? buf : Arrays.copyOf(buf, p);}private static char[][] nm(int n, int m){char[][] map = new char[n][];for(int i = 0;i < n;i++)map[i] = ns(m);return map;}private static int[] na(int n){int[] a = new int[n];for(int i = 0;i < n;i++)a[i] = ni();return a;}private static int ni(){int num = 0, b;boolean minus = false;while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));if(b == '-'){minus = true;b = readByte();}while(true){if(b >= '0' && b <= '9'){num = num * 10 + (b - '0');}else{return minus ? -num : num;}b = readByte();}}private static long nl(){long num = 0;int b;boolean minus = false;while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));if(b == '-'){minus = true;b = readByte();}while(true){if(b >= '0' && b <= '9'){num = num * 10 + (b - '0');}else{return minus ? -num : num;}b = readByte();}}private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }}