結果
問題 | No.2675 KUMA |
ユーザー |
![]() |
提出日時 | 2024-03-15 22:22:55 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 5,308 bytes |
コンパイル時間 | 2,487 ms |
コンパイル使用メモリ | 211,324 KB |
実行使用メモリ | 23,680 KB |
最終ジャッジ日時 | 2024-03-15 22:23:03 |
合計ジャッジ時間 | 5,627 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 21 ms
23,168 KB |
testcase_01 | AC | 22 ms
23,168 KB |
testcase_02 | AC | 22 ms
23,168 KB |
testcase_03 | RE | - |
testcase_04 | RE | - |
testcase_05 | AC | 34 ms
23,680 KB |
testcase_06 | AC | 31 ms
23,680 KB |
testcase_07 | AC | 22 ms
23,168 KB |
testcase_08 | AC | 33 ms
23,680 KB |
testcase_09 | AC | 30 ms
23,424 KB |
testcase_10 | AC | 34 ms
23,680 KB |
testcase_11 | AC | 36 ms
23,680 KB |
testcase_12 | AC | 27 ms
23,296 KB |
testcase_13 | AC | 24 ms
23,168 KB |
testcase_14 | AC | 25 ms
23,296 KB |
testcase_15 | AC | 23 ms
23,168 KB |
testcase_16 | AC | 39 ms
23,680 KB |
testcase_17 | AC | 23 ms
23,168 KB |
testcase_18 | AC | 22 ms
23,168 KB |
testcase_19 | AC | 22 ms
23,168 KB |
testcase_20 | AC | 22 ms
23,168 KB |
testcase_21 | AC | 22 ms
23,168 KB |
testcase_22 | AC | 22 ms
23,168 KB |
testcase_23 | AC | 23 ms
23,168 KB |
testcase_24 | AC | 23 ms
23,168 KB |
testcase_25 | AC | 22 ms
23,168 KB |
testcase_26 | AC | 22 ms
23,168 KB |
testcase_27 | AC | 22 ms
23,168 KB |
testcase_28 | AC | 23 ms
23,168 KB |
testcase_29 | AC | 22 ms
23,168 KB |
testcase_30 | AC | 22 ms
23,168 KB |
testcase_31 | AC | 23 ms
23,296 KB |
testcase_32 | AC | 22 ms
23,296 KB |
testcase_33 | AC | 23 ms
23,296 KB |
testcase_34 | AC | 23 ms
23,296 KB |
testcase_35 | AC | 23 ms
23,296 KB |
testcase_36 | AC | 22 ms
23,296 KB |
testcase_37 | AC | 22 ms
23,296 KB |
testcase_38 | AC | 24 ms
23,296 KB |
testcase_39 | AC | 23 ms
23,296 KB |
testcase_40 | AC | 23 ms
23,296 KB |
testcase_41 | AC | 25 ms
23,296 KB |
testcase_42 | AC | 25 ms
23,296 KB |
testcase_43 | AC | 25 ms
23,296 KB |
testcase_44 | AC | 25 ms
23,296 KB |
testcase_45 | AC | 29 ms
23,424 KB |
testcase_46 | AC | 28 ms
23,424 KB |
testcase_47 | AC | 29 ms
23,424 KB |
testcase_48 | AC | 33 ms
23,680 KB |
ソースコード
//#pragma GCC target("avx,avx2") //#pragma GCC optimize("O3") //#pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> #ifdef LOCAL #include <debug.hpp> #define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else #define debug(...) (static_cast<void>(0)) #endif using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; using pll = pair<ll, ll>; using pii = pair<int, int>; 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 vul = vector<ull>; using vpii = vector<pii>; using vpll = vector<pll>; using vs = vector<string>; template<class T> using pq = priority_queue<T, vector<T>, greater<T>>; #define overload4(_1, _2, _3, _4, name, ...) name #define overload3(a,b,c,name,...) name #define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER) #define rep2(i, n) for (ll i = 0; i < (n); ++i) #define rep3(i, a, b) for (ll i = (a); i < (b); ++i) #define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep1(n) for(ll i = (n) - 1;i >= 0;i--) #define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--) #define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--) #define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c) #define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__) #define all1(i) begin(i) , end(i) #define all2(i,a) begin(i) , begin(i) + a #define all3(i,a,b) begin(i) + a , begin(i) + b #define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__) #define sum(...) accumulate(all(__VA_ARGS__),0LL) template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; } template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; } template<class T> auto min(const T& a){return *min_element(all(a));} template<class T> auto max(const T& a){return *max_element(all(a));} template<class... Ts> void in(Ts&... t); #define INT(...) int __VA_ARGS__; in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__; in(__VA_ARGS__) #define STR(...) string __VA_ARGS__; in(__VA_ARGS__) #define CHR(...) char __VA_ARGS__; in(__VA_ARGS__) #define DBL(...) double __VA_ARGS__; in(__VA_ARGS__) #define LD(...) ld __VA_ARGS__; in(__VA_ARGS__) #define VEC(type, name, size) vector<type> name(size); in(name) #define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name) ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;} ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; } void Yes() {cout << "Yes\n";return;} void No() {cout << "No\n";return;} void YES() {cout << "YES\n";return;} void NO() {cout << "NO\n";return;} namespace IO{ #define VOID(a) decltype(void(a)) struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting; template<int I> struct P : P<I-1>{}; template<> struct P<0>{}; template<class T> void i(T& t){ i(t, P<3>{}); } void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; } template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; } template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); } template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);} template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});} #undef VOID } #define unpack(a) (void)initializer_list<int>{(a, 0)...} template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); } #undef unpack static const double PI = 3.1415926535897932; template <class F> struct REC { F f; REC(F &&f_) : f(forward<F>(f_)) {} template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }}; constexpr int mod = 998244353; //constexpr int mod = 1000000007; int dp[2][1 << 16]; int main() { INT(n); vi x(n),y(n); rep(i,n) cin >> x[i] >> y[i]; vvvi D(4,vvi(1003,vi(1003))); rep(i,n) { x[i] += 2; y[i] += 2; D[0][x[i]-2][y[i]+1] |= 1 << i; D[0][x[i]-2][y[i]-1] |= 1 << i; D[1][x[i]+2][y[i]+1] |= 1 << i; D[1][x[i]+2][y[i]-1] |= 1 << i; D[2][x[i]-1][y[i]-2] |= 1 << i; D[2][x[i]+1][y[i]-2] |= 1 << i; D[3][x[i]-1][y[i]+2] |= 1 << i; D[3][x[i]+1][y[i]+2] |= 1 << i; } rep(i,n) { rep(j,4) { D[j][x[i]][y[i]] = 0; } } rep(i,1,1<<n) dp[0][i] = 1e9; int now = 0; rep(i,1003) { rep(j,1003) { int f = 0; rep(k,4) if(D[k][i][j] != 0) f = 1; if(f == 0) continue; rep(k,1 << n) dp[1 - now][k] = dp[now][k]; rep(k,4) { if(D[k][i][j] != 0) { rep(l,1 << n) { chmin(dp[1 - now][l ^ D[k][i][j]],dp[now][l] + 1); } } } now ^= 1; } } if(dp[now][(1 << n) - 1] == (int)1e9) cout << -1 << '\n'; else cout << dp[now][(1 << n) - 1] << '\n'; }