結果
問題 | No.2675 KUMA |
ユーザー | shobonvip |
提出日時 | 2024-03-15 22:40:50 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 84 ms / 2,000 ms |
コード長 | 2,731 bytes |
コンパイル時間 | 5,029 ms |
コンパイル使用メモリ | 278,720 KB |
実行使用メモリ | 37,248 KB |
最終ジャッジ日時 | 2024-03-15 22:40:58 |
合計ジャッジ時間 | 6,939 ms |
ジャッジサーバーID (参考情報) |
judge10 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,676 KB |
testcase_01 | AC | 2 ms
6,676 KB |
testcase_02 | AC | 2 ms
6,676 KB |
testcase_03 | AC | 2 ms
6,676 KB |
testcase_04 | AC | 2 ms
6,676 KB |
testcase_05 | AC | 42 ms
19,584 KB |
testcase_06 | AC | 31 ms
15,488 KB |
testcase_07 | AC | 2 ms
6,676 KB |
testcase_08 | AC | 45 ms
21,376 KB |
testcase_09 | AC | 18 ms
10,112 KB |
testcase_10 | AC | 52 ms
23,808 KB |
testcase_11 | AC | 48 ms
22,144 KB |
testcase_12 | AC | 20 ms
10,752 KB |
testcase_13 | AC | 2 ms
6,676 KB |
testcase_14 | AC | 2 ms
6,676 KB |
testcase_15 | AC | 2 ms
6,676 KB |
testcase_16 | AC | 84 ms
37,248 KB |
testcase_17 | AC | 2 ms
6,676 KB |
testcase_18 | AC | 2 ms
6,676 KB |
testcase_19 | AC | 2 ms
6,676 KB |
testcase_20 | AC | 2 ms
6,676 KB |
testcase_21 | AC | 2 ms
6,676 KB |
testcase_22 | AC | 2 ms
6,676 KB |
testcase_23 | AC | 2 ms
6,676 KB |
testcase_24 | AC | 2 ms
6,676 KB |
testcase_25 | AC | 2 ms
6,676 KB |
testcase_26 | AC | 2 ms
6,676 KB |
testcase_27 | AC | 2 ms
6,676 KB |
testcase_28 | AC | 2 ms
6,676 KB |
testcase_29 | AC | 2 ms
6,676 KB |
testcase_30 | AC | 2 ms
6,676 KB |
testcase_31 | AC | 2 ms
6,676 KB |
testcase_32 | AC | 3 ms
6,676 KB |
testcase_33 | AC | 2 ms
6,676 KB |
testcase_34 | AC | 2 ms
6,676 KB |
testcase_35 | AC | 3 ms
6,676 KB |
testcase_36 | AC | 5 ms
6,676 KB |
testcase_37 | AC | 4 ms
6,676 KB |
testcase_38 | AC | 8 ms
6,676 KB |
testcase_39 | AC | 7 ms
6,676 KB |
testcase_40 | AC | 8 ms
6,676 KB |
testcase_41 | AC | 13 ms
8,448 KB |
testcase_42 | AC | 14 ms
8,448 KB |
testcase_43 | AC | 15 ms
8,576 KB |
testcase_44 | AC | 13 ms
8,192 KB |
testcase_45 | AC | 30 ms
14,976 KB |
testcase_46 | AC | 30 ms
14,720 KB |
testcase_47 | AC | 29 ms
14,336 KB |
testcase_48 | AC | 49 ms
22,912 KB |
ソースコード
#include<bits/stdc++.h> using namespace std; //* ATCODER #include<atcoder/all> using namespace atcoder; typedef modint998244353 mint; //*/ /* BOOST MULTIPRECISION #include<boost/multiprecision/cpp_int.hpp> using namespace boost::multiprecision; //*/ typedef long long ll; #define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++) #define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--) template <typename T> bool chmin(T &a, const T &b) { if (a <= b) return false; a = b; return true; } template <typename T> bool chmax(T &a, const T &b) { if (a >= b) return false; a = b; return true; } template <typename T> T max(vector<T> &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]); return ret; } template <typename T> T min(vector<T> &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]); return ret; } template <typename T> T sum(vector<T> &a){ T ret = 0; for (int i=0; i<(int)a.size(); i++) ret += a[i]; return ret; } int main(){ int n; cin >> n; set<pair<int,int>> st; map<pair<int,int>,int> pts; vector<int> x(n), y(n); rep(i,0,n){ cin >> x[i] >> y[i]; pts[pair(x[i], y[i])]=i; } rep(i,0,n){ for (auto [a, b]: { pair(x[i]-2, y[i]+1), pair(x[i]-2, y[i]-1), pair(x[i]+2, y[i]+1), pair(x[i]+2, y[i]-1), pair(x[i]-1, y[i]+2), pair(x[i]-1, y[i]-2), pair(x[i]+1, y[i]+2), pair(x[i]+1, y[i]-2) } ){ if (pts.find(pair(a, b)) != pts.end()) continue; st.insert(pair(a, b)); } } vector<int> a, b; for (auto [i, j]: st){ a.push_back(i); b.push_back(j); } int m = a.size(); vector dp(m + 1, vector<int>(1 << n, 1e9)); dp[0][0] = 0; rep(i,0,m){ // HIGASHI vector<int> tar(4); if (pts.find(pair(a[i]+2, b[i]+1)) != pts.end()) tar[0] |= 1 << pts[pair(a[i]+2, b[i]+1)]; if (pts.find(pair(a[i]+2, b[i]-1)) != pts.end()) tar[0] |= 1 << pts[pair(a[i]+2, b[i]-1)]; if (pts.find(pair(a[i]-2, b[i]+1)) != pts.end()) tar[1] |= 1 << pts[pair(a[i]-2, b[i]+1)]; if (pts.find(pair(a[i]-2, b[i]-1)) != pts.end()) tar[1] |= 1 << pts[pair(a[i]-2, b[i]-1)]; if (pts.find(pair(a[i]-1, b[i]-2)) != pts.end()) tar[2] |= 1 << pts[pair(a[i]-1, b[i]-2)]; if (pts.find(pair(a[i]+1, b[i]-2)) != pts.end()) tar[2] |= 1 << pts[pair(a[i]+1, b[i]-2)]; if (pts.find(pair(a[i]-1, b[i]+2)) != pts.end()) tar[3] |= 1 << pts[pair(a[i]-1, b[i]+2)]; if (pts.find(pair(a[i]+1, b[i]+2)) != pts.end()) tar[3] |= 1 << pts[pair(a[i]+1, b[i]+2)]; rep(j,0,1<<n){ chmin(dp[i+1][j], dp[i][j]); rep(k,0,4){ chmin(dp[i+1][j|tar[k]], dp[i][j] + 1); } } } if (dp[m][(1<<n)-1] > 1e8){ cout << -1 << '\n'; }else{ cout << dp[m][(1<<n)-1] << '\n'; } }