結果
問題 | No.1069 電柱 / Pole (Hard) |
ユーザー | heno239 |
提出日時 | 2020-08-02 19:53:54 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 745 ms / 2,000 ms |
コード長 | 5,833 bytes |
コンパイル時間 | 1,849 ms |
コンパイル使用メモリ | 149,960 KB |
実行使用メモリ | 62,136 KB |
最終ジャッジ日時 | 2023-09-30 21:21:41 |
合計ジャッジ時間 | 11,624 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
8,792 KB |
testcase_01 | AC | 4 ms
8,788 KB |
testcase_02 | AC | 4 ms
8,848 KB |
testcase_03 | AC | 4 ms
8,840 KB |
testcase_04 | AC | 745 ms
58,336 KB |
testcase_05 | AC | 85 ms
44,128 KB |
testcase_06 | AC | 385 ms
41,452 KB |
testcase_07 | AC | 198 ms
41,680 KB |
testcase_08 | AC | 208 ms
26,640 KB |
testcase_09 | AC | 361 ms
41,520 KB |
testcase_10 | AC | 119 ms
45,720 KB |
testcase_11 | AC | 7 ms
15,544 KB |
testcase_12 | AC | 17 ms
11,508 KB |
testcase_13 | AC | 83 ms
13,908 KB |
testcase_14 | AC | 55 ms
13,840 KB |
testcase_15 | AC | 46 ms
13,620 KB |
testcase_16 | AC | 64 ms
26,396 KB |
testcase_17 | AC | 12 ms
11,308 KB |
testcase_18 | AC | 85 ms
24,216 KB |
testcase_19 | AC | 277 ms
28,964 KB |
testcase_20 | AC | 21 ms
9,416 KB |
testcase_21 | AC | 60 ms
9,764 KB |
testcase_22 | AC | 20 ms
9,372 KB |
testcase_23 | AC | 127 ms
10,084 KB |
testcase_24 | AC | 237 ms
53,128 KB |
testcase_25 | AC | 237 ms
52,996 KB |
testcase_26 | AC | 192 ms
53,140 KB |
testcase_27 | AC | 191 ms
53,064 KB |
testcase_28 | AC | 194 ms
53,044 KB |
testcase_29 | AC | 10 ms
26,268 KB |
testcase_30 | AC | 4 ms
11,328 KB |
testcase_31 | AC | 3 ms
8,848 KB |
testcase_32 | AC | 3 ms
8,740 KB |
testcase_33 | AC | 3 ms
8,776 KB |
testcase_34 | AC | 3 ms
8,896 KB |
testcase_35 | AC | 4 ms
8,724 KB |
testcase_36 | AC | 3 ms
8,868 KB |
testcase_37 | AC | 10 ms
11,304 KB |
testcase_38 | AC | 17 ms
11,280 KB |
testcase_39 | AC | 4 ms
8,896 KB |
testcase_40 | AC | 8 ms
9,244 KB |
testcase_41 | AC | 19 ms
11,492 KB |
testcase_42 | AC | 16 ms
11,332 KB |
testcase_43 | AC | 12 ms
11,412 KB |
testcase_44 | AC | 342 ms
30,992 KB |
testcase_45 | AC | 201 ms
18,272 KB |
testcase_46 | AC | 298 ms
22,608 KB |
testcase_47 | AC | 371 ms
31,268 KB |
testcase_48 | AC | 197 ms
44,220 KB |
testcase_49 | AC | 168 ms
32,912 KB |
testcase_50 | AC | 7 ms
11,304 KB |
testcase_51 | AC | 206 ms
39,332 KB |
testcase_52 | AC | 12 ms
15,632 KB |
testcase_53 | AC | 201 ms
43,504 KB |
testcase_54 | AC | 3 ms
8,868 KB |
testcase_55 | AC | 4 ms
8,904 KB |
testcase_56 | AC | 4 ms
8,788 KB |
testcase_57 | AC | 4 ms
8,880 KB |
testcase_58 | AC | 3 ms
8,800 KB |
testcase_59 | AC | 3 ms
8,940 KB |
testcase_60 | AC | 3 ms
8,888 KB |
testcase_61 | AC | 3 ms
8,864 KB |
testcase_62 | AC | 3 ms
8,772 KB |
testcase_63 | AC | 3 ms
8,852 KB |
testcase_64 | AC | 4 ms
8,940 KB |
testcase_65 | AC | 4 ms
8,800 KB |
testcase_66 | AC | 3 ms
8,896 KB |
testcase_67 | AC | 3 ms
8,780 KB |
testcase_68 | AC | 3 ms
8,804 KB |
testcase_69 | AC | 27 ms
55,800 KB |
testcase_70 | AC | 32 ms
62,120 KB |
testcase_71 | AC | 30 ms
60,060 KB |
testcase_72 | AC | 12 ms
32,368 KB |
testcase_73 | AC | 16 ms
38,972 KB |
testcase_74 | AC | 32 ms
62,136 KB |
testcase_75 | AC | 32 ms
62,128 KB |
testcase_76 | AC | 195 ms
48,256 KB |
testcase_77 | AC | 273 ms
46,192 KB |
testcase_78 | AC | 5 ms
9,164 KB |
testcase_79 | AC | 91 ms
13,848 KB |
testcase_80 | AC | 261 ms
31,208 KB |
testcase_81 | AC | 102 ms
15,904 KB |
testcase_82 | AC | 75 ms
15,796 KB |
ソースコード
#include<iostream> #include<string> #include<cstdio> #include<vector> #include<cmath> #include<algorithm> #include<functional> #include<iomanip> #include<queue> #include<ciso646> #include<random> #include<map> #include<set> #include<bitset> #include<stack> #include<unordered_map> #include<utility> #include<cassert> #include<complex> #include<numeric> using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; constexpr ll mod = 998244353; const ll INF = mod * mod; typedef pair<int, int>P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define Rep(i,sta,n) for(int i=sta;i<n;i++) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair<ll, ll> LP; typedef long double ld; typedef pair<ld, ld> LDP; const ld eps = 1e-12; const ld pi = acos(-1.0); ll mod_pow(ll x, ll n, ll m) { ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } struct modint { ll n; modint() :n(0) { ; } modint(ll m) :n(m) { if (n >= mod)n %= mod; else if (n < 0)n = (n % mod + mod) % mod; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, int n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } const int max_n = 1 << 18; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } struct edge { int to; ld cost; }; using speP = pair<ld, int>; ld memo[2000][2000]; void solve() { int n, m,k; cin >> n >> m>>k; vector<vector<edge>> G(n); vector<int> x(n), y(n); int s, t; cin >> s >> t; s--; t--; rep(i, n)cin >> x[i] >> y[i]; rep(i, n)Rep(j, i + 1, n) { ld dist = sqrtl(pow(x[j] - x[i], 2) + pow(y[j] - y[i],2)); memo[i][j] = memo[j][i] = dist; } rep(i, m) { int p, q; cin >> p >> q; p--; q--; ld dist = sqrtl(pow(x[p] - x[q], 2) + pow(y[p] - y[q], 2)); G[p].push_back({ q,dist }); G[q].push_back({ p,dist }); } vector<ld> dist(n, INF); vector<int> par(n); dist[s] = 0; priority_queue<speP, vector<speP>, greater<speP>> q; /*q.push({ 0,s }); while (!q.empty()) { speP p = q.top(); q.pop(); int id = p.second; if (dist[id] < p.first)continue; for (edge e : G[id]) { ld nd = e.cost + dist[id]; if (nd < dist[e.to]) { par[e.to] = id; dist[e.to] = nd; q.push({ nd,e.to }); } } }*/ map<vector<int>, bool> chked; auto calc = [&](vector<int> v)->pair<ld, vector<int>> { if (chked[v])return { -1,{} }; chked[v] = true; vector<bool>ban(n, false); for (int id : v)ban[id] = true; fill(all(dist), INF); dist[v.back()] = 0; q.push({ 0,v.back() }); while (!q.empty()) { speP p = q.top(); q.pop(); int id = p.second; if (dist[id] < p.first)continue; for (edge e : G[id]) { if (ban[e.to])continue; ld nd = e.cost + p.first; if (nd < dist[e.to]) { dist[e.to] = nd; par[e.to] = id; q.push({ nd,e.to }); } } } if (dist[t] == INF)return { -1,{} }; vector<int> res2 = v; vector<int> las; int cur = t; while (cur != v.back()) { las.push_back(cur); cur = par[cur]; } per(i, (int)las.size())res2.push_back(las[i]); return { dist[t],res2 }; }; pair<ld, vector<int>> cur = calc({ s }); vector<ld> ans(k, -1); ans[0] = cur.first; vector<vector<int>> pre; pre.push_back(cur.second); set<pair<ld, vector<int>>> st; rep1(aa, k-1) { vector<int> las = pre.back(); //cout << "??? " << las.size() << "\n"; vector<int> ids(pre.size()); rep(i, pre.size())ids[i] = i; vector<int> vc; ld s = 0; vector<bool> ban(n, false); rep(i, (int)las.size() - 1) { ban[las[i]] = true; vector<int> nex; for (int id : ids) { if (pre[id][i] == las[i])nex.push_back(id); } swap(nex, ids); //cout << "! " << ids.size() << "\n"; vc.push_back(las[i]); for (edge e : G[las[i]]) { bool valid = true; if (ban[e.to])valid = false; for (int id : ids)if (e.to == pre[id][i + 1])valid = false; if (valid) { //cout << "? " << i << " " << e.to << "\n"; vc.push_back(e.to); pair<ld, vector<int>> p = calc(vc); if (p.first >= 0) { p.first += s+memo[las[i]][e.to]; st.insert(p); } vc.pop_back(); } } s += memo[las[i]][las[i + 1]]; } if (st.empty())break; pair<ld, vector<int>> ne = *st.begin(); st.erase(st.begin()); ans[aa] = ne.first; pre.push_back(ne.second); } rep(i, k) { if (ans[i] < 0)cout << -1 << "\n"; else cout << ans[i] << "\n"; } } signed main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(10); //init_f(); //cout << grandy(2, 3, false, false) << "\n"; //int t; cin >> t; rep(i, t) solve(); return 0; }