Submission #2337420


Source Code Expand

#include <bits/stdc++.h>
 
using namespace std;
 
 
const int INF = 1 << 30;
 
typedef vector< int > vi;
 
vi operator+(const vi &t, const vi &s)
{
  vi ret(52);
  for(int i = 0; i < 52; i++) ret[i] = t[i] + s[i];
  return (ret);
}
 
vi operator-(const vi &t)
{
  vi ret(52);
  for(int i = 0; i < 52; i++) ret[i] = t[i] * -1;
  return (ret);
}
 
vi operator*(const vi &t, int k)
{
  vi ret(52);
  for(int i = 0; i < 52; i++) ret[i] = t[i] * k;
  return (ret);
}
 
struct Primal_Dual
{
  typedef pair< vi, int > Pi;
 
  struct edge
  {
    int to, cap;
    vi cost;
    int rev;
  };
 
  vector< vector< edge > > graph;
  vector< vi > potential, min_cost;
  vector< int > prevv, preve;
 
  Primal_Dual(int V) : graph(V) {}
 
  void add_edge(int from, int to, int cap, vi cost)
  {
    graph[from].push_back((edge) {to, cap, cost, (int) graph[to].size()});
    graph[to].push_back((edge) {from, 0, -cost, (int) graph[from].size() - 1});
  }
 
  vi min_cost_flow(int s, int t, int f)
  {
    int V = graph.size();
    vi ret(52, 0);
    priority_queue< Pi, vector< Pi >, greater< Pi > > que;
    potential.assign(V, vi(52, 0));
    preve.assign(V, -1);
    prevv.assign(V, -1);
 
    while(f > 0) {
      min_cost.assign(V, vi(52, INF));
      que.push(Pi(vi(52, 0), s));
      min_cost[s] = vi(52, 0);
 
      while(!que.empty()) {
        Pi p = que.top();
        que.pop();
        if(min_cost[p.second] < p.first) continue;
        for(int i = 0; i < graph[p.second].size(); i++) {
          edge &e = graph[p.second][i];
          vi nextCost = min_cost[p.second] + e.cost + potential[p.second] + -potential[e.to];
          if(e.cap > 0 && min_cost[e.to] > nextCost) {
            min_cost[e.to] = nextCost;
            prevv[e.to] = p.second, preve[e.to] = i;
            que.push(Pi(min_cost[e.to], e.to));
          }
        }
      }
      if(min_cost[t][0] == INF) return (vi(52, -1));
      for(int v = 0; v < V; v++) potential[v] = potential[v] + min_cost[v];
      int addflow = f;
      for(int v = t; v != s; v = prevv[v]) {
        addflow = min(addflow, graph[prevv[v]][preve[v]].cap);
      }
      f -= addflow;
      ret = ret + potential[t] * addflow;
      for(int v = t; v != s; v = prevv[v]) {
        edge &e = graph[prevv[v]][preve[v]];
        e.cap -= addflow;
        graph[v][e.rev].cap += addflow;
      }
    }
    return ret;
  }
};
 
const string temp = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
 
int main()
{
  int N;
  string S[50];
 
  cin >> N;
  for(int i = 0; i < N; i++) {
    cin >> S[i];
  }
 
  Primal_Dual flow(N + N + 2);
  const int s = N + N, t = N + N + 1;
  vi vc(52, 0);
  for(int i = 0; i < N; i++) flow.add_edge(s, i, 1, vc);
  for(int i = 0; i < N; i++) flow.add_edge(i + N, t, 1, vc);
  for(int i = 0; i < N; i++) {
    for(int j = 0; j < N; j++) {
      vc[temp.find(S[i][j])]--;
      flow.add_edge(i, j + N, 1, vc);
      vc[temp.find(S[i][j])]++;
    }
  }
 
  auto cost = flow.min_cost_flow(s, t, N);
  for(int i = 0; i < 52; i++) cout << string(-cost[i], temp[i]);
  cout << endl;
}

Submission Info

Submission Time
Task C - Decoding Ancient Messages
User ei13333
Language C++14 (GCC 5.4.1)
Score 100
Code Size 3185 Byte
Status AC
Exec Time 152 ms
Memory 1792 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 43
Set Name Test Cases
All 00_sample_00, 00_sample_01, 00_sample_02, 10_Random_03_09, 10_Random_05_00, 10_Random_08_03, 10_Random_09_12, 10_Random_10_06, 10_Random_13_10, 10_Random_16_01, 10_Random_19_07, 10_Random_19_13, 10_Random_26_04, 10_Random_30_05, 10_Random_34_14, 10_Random_35_08, 10_Random_44_02, 10_Random_46_11, 10_Random_50_15, 20_SkewRandom_13_12, 20_SkewRandom_14_08, 20_SkewRandom_20_00, 20_SkewRandom_25_04, 20_SkewRandom_29_16, 20_SkewRandom_31_13, 20_SkewRandom_36_01, 20_SkewRandom_38_09, 20_SkewRandom_41_17, 20_SkewRandom_47_05, 20_SkewRandom_50_02, 20_SkewRandom_50_03, 20_SkewRandom_50_06, 20_SkewRandom_50_07, 20_SkewRandom_50_10, 20_SkewRandom_50_11, 20_SkewRandom_50_14, 20_SkewRandom_50_15, 20_SkewRandom_50_18, 20_SkewRandom_50_19, 90_teuchi_00, 90_teuchi_01, 90_teuchi_02, 90_teuchi_03
Case Name Status Exec Time Memory
00_sample_00 AC 1 ms 256 KB
00_sample_01 AC 59 ms 1152 KB
00_sample_02 AC 1 ms 256 KB
10_Random_03_09 AC 1 ms 256 KB
10_Random_05_00 AC 1 ms 256 KB
10_Random_08_03 AC 2 ms 256 KB
10_Random_09_12 AC 2 ms 384 KB
10_Random_10_06 AC 3 ms 384 KB
10_Random_13_10 AC 4 ms 384 KB
10_Random_16_01 AC 7 ms 512 KB
10_Random_19_07 AC 11 ms 512 KB
10_Random_19_13 AC 11 ms 512 KB
10_Random_26_04 AC 24 ms 768 KB
10_Random_30_05 AC 34 ms 896 KB
10_Random_34_14 AC 48 ms 1024 KB
10_Random_35_08 AC 53 ms 1152 KB
10_Random_44_02 AC 100 ms 1536 KB
10_Random_46_11 AC 113 ms 1664 KB
10_Random_50_15 AC 144 ms 1792 KB
20_SkewRandom_13_12 AC 5 ms 384 KB
20_SkewRandom_14_08 AC 5 ms 384 KB
20_SkewRandom_20_00 AC 12 ms 512 KB
20_SkewRandom_25_04 AC 22 ms 640 KB
20_SkewRandom_29_16 AC 32 ms 768 KB
20_SkewRandom_31_13 AC 39 ms 896 KB
20_SkewRandom_36_01 AC 59 ms 1152 KB
20_SkewRandom_38_09 AC 68 ms 1280 KB
20_SkewRandom_41_17 AC 84 ms 1408 KB
20_SkewRandom_47_05 AC 123 ms 1664 KB
20_SkewRandom_50_02 AC 149 ms 1792 KB
20_SkewRandom_50_03 AC 148 ms 1792 KB
20_SkewRandom_50_06 AC 148 ms 1792 KB
20_SkewRandom_50_07 AC 150 ms 1792 KB
20_SkewRandom_50_10 AC 147 ms 1792 KB
20_SkewRandom_50_11 AC 151 ms 1792 KB
20_SkewRandom_50_14 AC 150 ms 1792 KB
20_SkewRandom_50_15 AC 152 ms 1792 KB
20_SkewRandom_50_18 AC 147 ms 1792 KB
20_SkewRandom_50_19 AC 151 ms 1792 KB
90_teuchi_00 AC 148 ms 1792 KB
90_teuchi_01 AC 1 ms 256 KB
90_teuchi_02 AC 1 ms 256 KB
90_teuchi_03 AC 149 ms 1792 KB