#14824 (C++11) No.161 制限ジャンケン

• 問題: No.161 制限ジャンケン
• ユーザー: koyumeishi
• 提出日時: 2015-03-05 23:30:09
• 言語: C++11 (gcc 13.3.0)
• 結果: AC
• 実行時間: 8 ms / 5,000 ms
• コード長: 2,571 bytes
• コンパイル時間: 754 ms
• コンパイル使用メモリ: 81,252 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-30 04:24:23
• 合計ジャッジ時間: 1,302 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

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

ソースコード

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
#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;
#define INF 1e9
typedef struct{
    int to;
    int cap;
    int cost;
    int rev;
}edge;
//min cost : s->t (flow:f)
int min_cost_flow(vector<vector<edge> > &G, int s, int t, int f){
    int cost = 0;
    vector<int> prev_v(G.size(),-1);
    vector<int> prev_e(G.size(),-1);
    
    while(f>0){
        //min distance(cost based) search with Belman-Ford
        vector<int> dist(G.size(), INF);
        dist[s] = 0;
        prev_v[s] = s;
        bool update=true;
        while(update){
            update = false;
            for(int i=0; i<G.size(); i++){
                if(dist[i] >= INF) continue;
                
                vector<edge> &e = G[i];
                for(int j=0; j<e.size(); j++){
                    if(dist[e[j].to] > dist[i] + e[j].cost && e[j].cap>0){
                        dist[e[j].to] = dist[i] + e[j].cost;
                        update = true;
                        prev_v[ e[j].to ] = i;
                        prev_e[ e[j].to ] = j;
                    }
                }
            }
        }
        //cannot achieved to "t" return -1
        if(dist[t]>=INF) return -1;
        
        //add cost of s->t with flow=d
        int pos=t;
        int d=INF;
        while(pos!=s){
            int i=prev_v[pos];
            int j=prev_e[pos];
            pos = i;
            d = min(d, G[i][j].cap);
        }
        
        pos = t;
        //cout << t ;
        while(pos!=s){
            int i=prev_v[pos];
            int j=prev_e[pos];
            G[i][j].cap -= d;
            G[ G[i][j].to ][ G[i][j].rev ].cap += d;
            //cost += G[i][j].cost * d;
            pos = i;
            //cout << " <- " << pos;
        }
        //cout << endl;
        cost += d * dist[t];
        f -= d;
        //f==0 then end
    }
    return cost;
}
void add_edge(vector<vector<edge> > &G, int from, int to, int cap, int cost){
    G[from].push_back((edge){to, cap, cost, (int)G[to].size()});
    G[to].push_back((edge){from, 0, -cost, (int)G[from].size()-1});
}
int main(){
    int G,C,P;
    cin >> G >> C >> P;
    
    string S;
    cin >> S;
    int n = S.size();
    vector<vector<edge>> Graph(n + 3 + 2);
    int s = n+3+0;
    int t = n+3+1;
    int g = n+0;
    int c = n+1;
    int p = n+2;
    for(int i=0; i<n; i++){
        if(S[i] == 'G'){
            add_edge(Graph, g, i, 1, 3-1);
            add_edge(Graph, c, i, 1, 3-0);
            add_edge(Graph, p, i, 1, 3-3);
        }else if(S[i] == 'C'){
            add_edge(Graph, g, i, 1, 3-3);
            add_edge(Graph, c, i, 1, 3-1);
            add_edge(Graph, p, i, 1, 3-0);
        }else if(S[i] == 'P'){
            add_edge(Graph, g, i, 1, 3-0);
            add_edge(Graph, c, i, 1, 3-3);
            add_edge(Graph, p, i, 1, 3-1);
        }
        add_edge(Graph, i, t, 1, 0);
    }
    add_edge(Graph, s, g, G, 0);
    add_edge(Graph, s, c, C, 0);
    add_edge(Graph, s, p, P, 0);
    int ans = 3*n - min_cost_flow(Graph, s, t, n);
    cout << ans << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX