Submission #7077044


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 BipartiteMatching {
  vector< vector< int > > graph;
  vector< int > match, alive, used;
  int timestamp;

  BipartiteMatching(int n) : graph(n), alive(n, 1), used(n, 0), match(n, -1), timestamp(0) {}

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

  bool dfs(int idx) {
    used[idx] = timestamp;
    for(auto &to : graph[idx]) {
      int to_match = match[to];
      if(alive[to] == 0) continue;
      if(to_match == -1 || (used[to_match] != timestamp && dfs(to_match))) {
        match[idx] = to;
        match[to] = idx;
        return true;
      }
    }
    return false;
  }

  int bipartite_matching() {
    int ret = 0;
    for(int i = 0; i < graph.size(); i++) {
      if(alive[i] == 0) continue;
      if(match[i] == -1) {
        ++timestamp;
        ret += dfs(i);
      }
    }
    return ret;
  }

  void output() {
    for(int i = 0; i < graph.size(); i++) {
      if(i < match[i]) {
        cout << i << "-" << match[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++) {
    BipartiteMatching 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, M + l);
        }
      }
    }
    assert(bm.bipartite_matching() == M);
    for(int j = 0; j < M + M; j++) {
      if(j < bm.match[j]) {
        B[line[j]][bm.match[j] - M] = 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 4325 Byte
Status
Exec Time 137 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 122 ms 384 KB
in02.txt 130 ms 512 KB
in03.txt 137 ms 512 KB
in04.txt 103 ms 384 KB
in05.txt 104 ms 384 KB
in06.txt 103 ms 384 KB
in07.txt 10 ms 384 KB
in08.txt 20 ms 512 KB
in09.txt 109 ms 384 KB
in10.txt 126 ms 512 KB
in11.txt 117 ms 384 KB
in12.txt 42 ms 512 KB
in13.txt 104 ms 384 KB
in14.txt 108 ms 384 KB
in15.txt 103 ms 384 KB
in16.txt 11 ms 384 KB
in17.txt 13 ms 384 KB
in18.txt 16 ms 512 KB
in19.txt 44 ms 512 KB
in20.txt 43 ms 512 KB
in21.txt 43 ms 512 KB
in22.txt 137 ms 512 KB
in23.txt 1 ms 256 KB
sample01.txt 1 ms 256 KB
sample02.txt 1 ms 256 KB