Submission #7076983


Source Code Expand

Copy
#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

struct HopcroftKarp {
  vector< vector< int > > graph;
  vector< int > dist, match;
  vector< bool > used, vv;

  HopcroftKarp(int n, int m) : graph(n), match(m, -1), used(n) {}

  void add_edge(int u, int v) {
    graph[u].push_back(v);
  }

  void bfs() {
    dist.assign(graph.size(), -1);
    queue< int > que;
    for(int i = 0; i < graph.size(); i++) {
      if(!used[i]) {
        que.emplace(i);
        dist[i] = 0;
      }
    }

    while(!que.empty()) {
      int a = que.front();
      que.pop();
      for(auto &b : graph[a]) {
        int c = match[b];
        if(c >= 0 && dist[c] == -1) {
          dist[c] = dist[a] + 1;
          que.emplace(c);
        }
      }
    }
  }

  bool dfs(int a) {
    vv[a] = true;
    for(auto &b : graph[a]) {
      int c = match[b];
      if(c < 0 || (!vv[c] && dist[c] == dist[a] + 1 && dfs(c))) {
        match[b] = a;
        used[a] = true;
        return (true);
      }
    }
    return (false);
  }

  int bipartite_matching() {
    int ret = 0;
    while(true) {
      bfs();
      vv.assign(graph.size(), false);
      int flow = 0;
      for(int i = 0; i < graph.size(); i++) {
        if(!used[i] && dfs(i)) ++flow;
      }
      if(flow == 0) return (ret);
      ret += flow;
    }
  }

  void output() {
    for(int i = 0; i < match.size(); i++) {
      if(~match[i]) {
        cout << match[i] << "-" << i << endl;
      }
    }
  }
};

int main() {
  int N, M;
  cin >> N >> M;
  auto A = make_v< int >(N, M);
  cin >> A;
  for(auto &vs : A) for(auto &p : vs) --p;
  auto B = make_v< int >(N, M);
  fill_v(B, -1);
  for(int i = 0; i < N; i++) {
    HopcroftKarp bm(M, M);
    vector< int > line(M);
    for(int j = 0; j < N; j++) {
      for(int k = 0; k < M; k++) {
        if(A[j][k] / M != i) continue;
        line[A[j][k] % M] = j;
        for(int l = 0; l < M; l++) {
          if(~B[j][l]) continue;
          bm.add_edge(A[j][k] % M, l);
        }
      }
    }
    assert(bm.bipartite_matching() == M);
    vector< int > inv(M);
    for(int j = 0; j < M; j++) inv[bm.match[j]] = j;
    for(int j = 0; j < M; j++) {
      B[line[j]][inv[j]] = i * M + j;
    }
  }

  for(auto &vs : B) {
    for(auto &p : vs) ++p;
    cout << vs << endl;
  }

  auto C = make_v< int >(N, M);
  for(int i = 0; i < M; i++) {
    vector< int > be;
    for(int j = 0; j < N; j++) {
      be.emplace_back(B[j][i]);
    }
    sort(begin(be), end(be));
    for(int j = 0; j < N; j++) {
      C[j][i] = be[j];
    }
  }

  for(auto &vs : C) {
    cout << vs << endl;
  }


}

Submission Info

Submission Time
Task D - Sorting a Grid
User ei13333
Language C++14 (GCC 5.4.1)
Score 0
Code Size 4751 Byte
Status
Exec Time 113 ms
Memory 512 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample01.txt, sample02.txt
All 0 / 1100 sample01.txt, sample02.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, sample01.txt, sample02.txt
Case Name Status Exec Time Memory
in01.txt 109 ms 384 KB
in02.txt 111 ms 384 KB
in03.txt 113 ms 384 KB
in04.txt 101 ms 256 KB
in05.txt 100 ms 256 KB
in06.txt 100 ms 256 KB
in07.txt 100 ms 384 KB
in08.txt 103 ms 384 KB
in09.txt 102 ms 384 KB
in10.txt 108 ms 384 KB
in11.txt 106 ms 384 KB
in12.txt 19 ms 512 KB
in13.txt 101 ms 384 KB
in14.txt 102 ms 384 KB
in15.txt 100 ms 256 KB
in16.txt 5 ms 384 KB
in17.txt 6 ms 384 KB
in18.txt 7 ms 384 KB
in19.txt 19 ms 512 KB
in20.txt 20 ms 512 KB
in21.txt 20 ms 512 KB
in22.txt 113 ms 384 KB
in23.txt 1 ms 256 KB
sample01.txt 1 ms 256 KB
sample02.txt 1 ms 256 KB