結果
| 問題 | No.1669 パズル作成 |
| ユーザー |
 yuto1115
|
| 提出日時 | 2021-09-03 23:19:09 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 221 ms / 2,000 ms |
| コード長 | 7,430 bytes |
| コンパイル時間 | 2,626 ms |
| コンパイル使用メモリ | 217,328 KB |
| 最終ジャッジ日時 | 2025-01-24 07:09:54 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 29 |
ソースコード
#include<bits/stdc++.h>#define overload4(_1, _2, _3, _4, name, ...) name#define rep1(i, n) for (ll i = 0; i < ll(n); ++i)#define rep2(i, s, n) for (ll i = ll(s); i < ll(n); ++i)#define rep3(i, s, n, d) for(ll i = ll(s); i < ll(n); i+=d)#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)#define rrep1(i, n) for (ll i = ll(n)-1; i >= 0; i--)#define rrep2(i, n, t) for (ll i = ll(n)-1; i >= (ll)t; i--)#define rrep3(i, n, t, d) for (ll i = ll(n)-1; i >= (ll)t; i-=d)#define rrep(...) overload4(__VA_ARGS__,rrep3,rrep2,rrep1)(__VA_ARGS__)#define all(a) a.begin(),a.end()#define rall(a) a.rbegin(),a.rend()#define SUM(a) accumulate(all(a),0LL)#define MIN(a) *min_element(all(a))#define MAX(a) *max_element(all(a))#define SZ(a) int(a.size())#define popcount(x) __builtin_popcountll(x)#define pf push_front#define pb push_back#define ef emplace_front#define eb emplace_back#define ppf pop_front#define ppb pop_back#ifdef __LOCAL#define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); cout << flush; }#else#define debug(...) void(0);#endif#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)using namespace std;using ll = long long;using ld = long double;using P = pair<int, int>;using LP = pair<ll, ll>;using vi = vector<int>;using vvi = vector<vi>;using vvvi = vector<vvi>;using vl = vector<ll>;using vvl = vector<vl>;using vvvl = vector<vvl>;using vd = vector<double>;using vvd = vector<vd>;using vs = vector<string>;using vc = vector<char>;using vvc = vector<vc>;using vb = vector<bool>;using vvb = vector<vb>;using vp = vector<P>;using vvp = vector<vp>;template<class S, class T>istream &operator>>(istream &is, pair<S, T> &p) { return is >> p.first >> p.second; }template<class S, class T>ostream &operator<<(ostream &os, const pair<S, T> &p) { return os << '{' << p.first << ", " << p.second << '}'; }template<class S, class T, class U>istream &operator>>(istream &is, tuple<S, T, U> &t) { return is >> get<0>(t) >> get<1>(t) >> get<2>(t); }template<class S, class T, class U>ostream &operator<<(ostream &os, const tuple<S, T, U> &t) {return os << '{' << get<0>(t) << ", " << get<1>(t) << ", " << get<2>(t) << '}';}template<class T>istream &operator>>(istream &is, vector<T> &v) {for (T &t : v) { is >> t; }return is;}template<class T>ostream &operator<<(ostream &os, const vector<T> &v) {os << '[';rep(i, v.size()) os << v[i] << (i == int(v.size() - 1) ? "" : ", ");return os << ']';}template<class T>ostream &operator<<(ostream &os, const set<T> &st) {os << '{';auto it = st.begin();while (it != st.end()) {os << (it == st.begin() ? "" : ", ") << *it;it++;}return os << '}';}template<class T>void vecout(const vector<T> &v, char div = '\n') {rep(i, v.size()) cout << v[i] << (i == int(v.size() - 1) ? '\n' : div);}template<class T>bool chmin(T &a, T b) {if (a > b) {a = b;return true;}return false;}template<class T>bool chmax(T &a, T b) {if (a < b) {a = b;return true;}return false;}void scan() {}template<class Head, class... Tail>void scan(Head &head, Tail &... tail) {cin >> head;scan(tail...);}template<class T>void print(const T &t) { cout << t << '\n'; }template<class Head, class... Tail>void print(const Head &head, const Tail &... tail) {cout << head << ' ';print(tail...);}template<class... T>void fin(const T &... a) {print(a...);exit(0);}struct Init_io {Init_io() {ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);cout << boolalpha << fixed << setprecision(15);cerr << boolalpha << fixed << setprecision(15);}} init_io;const string yes[] = {"no", "yes"};const string Yes[] = {"No", "Yes"};const string YES[] = {"NO", "YES"};const int inf = 1001001001;const ll linf = 1001001001001001001;template<class T, class S>vector<T> cumsum(const vector<S> &v, bool shift_one = true) {int n = v.size();vector<T> res;if (shift_one) {res.resize(n + 1);rep(i, n) res[i + 1] = res[i] + v[i];} else {res.resize(n);if (n) {res[0] = v[0];rep(i, 1, n) res[i] = res[i - 1] + v[i];}}return res;}vvi graph(int n, int m, bool directed = false, int origin = 1) {vvi G(n);rep(_, m) {INT(u, v);u -= origin, v -= origin;G[u].pb(v);if (!directed) G[v].pb(u);}return G;}template<class T>vector<vector<pair<int, T>>> weighted_graph(int n, int m, bool directed = false, int origin = 1) {vector<vector<pair<int, T>>> G(n);rep(_, m) {int u, v;T w;scan(u, v, w);u -= origin, v -= origin;G[u].eb(v, w);if (!directed) G[v].eb(u, w);}return G;}class unionfind {int n;vector<int> par, rank;public:unionfind(int n) : n(n), par(n, -1), rank(n, 0) {}int root(int x) {if (par[x] < 0) return x;else return par[x] = root(par[x]);}bool is_root(int x) { return root(x) == x; }bool same(int x, int y) { return root(x) == root(y); };bool merge(int x, int y) {x = root(x);y = root(y);if (x == y) return false;if (rank[x] < rank[y]) swap(x, y);if (rank[x] == rank[y]) rank[x]++;par[x] += par[y];par[y] = x;return true;}int size(int x) { return -par[root(x)]; };vi roots() {vi res;rep(i, n) if (root(i) == i) res.pb(i);return res;}bool connected() {return roots().size() == 1;}};int main() {INT(n, m);vvi row(n), col(n);rep(_, m) {INT(r, c);--r, --c;row[r].pb(c);col[c].pb(r);}unionfind uf(n);rep(i, n) {rep(j, row[i].size() - 1) uf.merge(row[i][j], row[i][j + 1]);}map<int, vi> mp;rep(i, n) mp[uf.root(i)].pb(i);vp ls;int rem = n;for (auto[_, v] : mp) {set<int> st;for (int i : v) {for (int j : col[i]) st.insert(j);}ls.eb(v.size(), st.size());rem -= st.size();}int sz = ls.size();vvi mn(sz + 1, vi(n + 1, inf));vvi mx(sz + 1, vi(n + 1, -inf));mn[0][0] = mx[0][0] = 0;rep(i, sz) rep(j, n + 1) {auto[r, c] = ls[i];if (mn[i][j] != inf) {chmin(mn[i + 1][j], mn[i][j]);chmin(mn[i + 1][j + r], mn[i][j] + c);}if (mx[i][j] != -inf) {chmax(mx[i + 1][j], mx[i][j]);chmax(mx[i + 1][j + r], mx[i][j] + c);}}int ans = inf;rep(i, n + 1) {if (mn[sz][i] == inf) continue;chmin<int>(ans, i * mn[sz][i] + (n - i) * (n - rem - mn[sz][i]) + rem * min<int>(i, n - i));chmin<int>(ans, i * mx[sz][i] + (n - i) * (n - rem - mx[sz][i]) + rem * min<int>(i, n - i));}fin(ans - m);}