結果
問題 | No.2955 Pizza Delivery Plan |
ユーザー | kazuppa |
提出日時 | 2024-11-08 21:28:13 |
言語 | C++23(gcc13) (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 398 ms / 2,000 ms |
コード長 | 7,132 bytes |
コンパイル時間 | 7,266 ms |
コンパイル使用メモリ | 340,272 KB |
実行使用メモリ | 71,296 KB |
最終ジャッジ日時 | 2024-11-08 21:28:27 |
合計ジャッジ時間 | 14,265 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 3 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 70 ms
21,248 KB |
testcase_09 | AC | 69 ms
21,504 KB |
testcase_10 | AC | 100 ms
25,088 KB |
testcase_11 | AC | 127 ms
29,160 KB |
testcase_12 | AC | 151 ms
32,768 KB |
testcase_13 | AC | 179 ms
36,608 KB |
testcase_14 | AC | 199 ms
40,704 KB |
testcase_15 | AC | 228 ms
44,416 KB |
testcase_16 | AC | 274 ms
48,256 KB |
testcase_17 | AC | 271 ms
52,096 KB |
testcase_18 | AC | 290 ms
55,808 KB |
testcase_19 | AC | 319 ms
59,648 KB |
testcase_20 | AC | 368 ms
63,616 KB |
testcase_21 | AC | 381 ms
67,328 KB |
testcase_22 | AC | 377 ms
71,168 KB |
testcase_23 | AC | 380 ms
71,168 KB |
testcase_24 | AC | 398 ms
71,168 KB |
testcase_25 | AC | 152 ms
32,768 KB |
testcase_26 | AC | 123 ms
29,056 KB |
testcase_27 | AC | 96 ms
25,088 KB |
testcase_28 | AC | 291 ms
55,808 KB |
testcase_29 | AC | 343 ms
59,648 KB |
testcase_30 | AC | 380 ms
71,296 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll=long long; #include <atcoder/all> using namespace atcoder; using mints=modint998244353; #pragma GCC target ("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #define rep(i,a,b) for(it i=(it)(a);i<=(it)b;i++) #define irep(i,a,b) for(int i=(int)(a);i<=(int)b;i++) #define nrep(i,a,b) for(it i=(it)(a);i>=(it)b;i--) #define inrep(i,a,b) for(int i=(int)(a);i>=(int)b;i--) #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(), v.rend() #define moda 998244353LL #define modb 1000000007LL #define gyaku 166374059LL #define dai 2500000000000000000LL #define sho -dai #define aoi 1e+18 #define tyu 2500000000 #define giri 1000000000 #define en 3.14159265358979 #define eps 1e-14 //#define endl '\n' #define yn(x) cout<<(x?"Yes\n":"No\n"); #define YN(x) cout<<(x?"YES\n":"NO\n"); #define ci(x) cin>>x; #define fi(x) cout<<fixed<<setprecision(x); using it=long long; using itn=int; using un=unsigned long long; using db=long double; using st=string; using ch=char; using bo=bool; using P=pair<it,it>; using ip=pair<int,int>; using vi=vector<it>; using ivi=vector<int>; using vd=vector<db>; using vs=vector<st>; using vc=vector<ch>; using vb=vector<bo>; using vp=vector<P>; using ivp=vector<ip>; using sp=set<P>; using isp=set<ip>; using ss=set<st>; using sc=set<ch>; using si=set<it>; using isi=set<int>; using svi=set<vi>; using vvi=vector<vi>; using ivvi=vector<ivi>; using vvd=vector<vd>; using vvs=vector<vs>; using vvb=vector<vb>; using vvc=vector<vc>; using vvp=vector<vp>; using ivvp=vector<ivp>; using vsi=vector<si>; using ivsi=vector<isi>; using vsp=vector<sp>; using ivsp=vector<isp>; using vvsi=vector<vsi>; using ivvsi=vector<ivsi>; using vvsp=vector<vsp>; using ivvsp=vector<ivsp>; using vvvi=vector<vvi>; using ivvvi=vector<ivvi>; using vvvd=vector<vvd>; using vvvb=vector<vvb>; using ivvvp=vector<ivvp>; using vvvvi=vector<vvvi>; using ivvvvi=vector<ivvvi>; using vvvvd=vector<vvvd>; using mint=modint; using minto=modint1000000007; using vm=vector<mint>; using vms=vector<mints>; using vmo=vector<minto>; using vvm=vector<vm>; using vvms=vector<vms>; using vvmo=vector<vmo>; using vvvm=vector<vvm>; using vvvms=vector<vvms>; using vvvmo=vector<vvmo>; using vvvvm=vector<vvvm>; using vvvvms=vector<vvvms>; using vvvvmo=vector<vvvmo>; using vvvvvm=vector<vvvvm>; using vvvvvms=vector<vvvvms>; using vvvvvmo=vector<vvvvmo>; using vvvvvvm=vector<vvvvvm>; using vvvvvvms=vector<vvvvvms>; using vvvvvvmo=vector<vvvvvmo>; const it dx[4]={0,1,0,-1}; const it dy[4]={1,0,-1,0}; st abc="abcdefghijklmnopqrstuvwxyz"; st ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ"; st num="0123456789"; st mb="xo"; st MB="XO"; template<typename T> void scan(vector<T> &a){ rep(i,0,a.size()-1)cin>>a[i]; } template<typename T> void scan(vector<T> &a,vector<T>&b){ rep(i,0,a.size()-1)cin>>a[i]>>b[i]; } template<typename T> void scan(vector<pair<T,T>> &a){ rep(i,0,a.size()-1)cin>>a[i].first>>a[i].second; } template<typename T> void dec(vector<T> &a){ rep(i,0,a.size()-1)a[i]--; } it gcda(it a,it b){ if(!a||!b){ return max(a,b); } while(a%b&&b%a){ if(a>b)a%=b; else b%=a; } return min(a,b); } it lcma(it a,it b){ return a/gcda(a,b)*b; } const it MOD=modb; vi fact,fact_inv,inv; /* init_nCk :二項係数のための前処理 計算量:O(n) */ void init_nCk(int SIZE){ fact.resize(SIZE+5); fact_inv.resize(SIZE+5); inv.resize(SIZE+5); fact[0]=fact[1]=1; fact_inv[0]=fact_inv[1]=1; inv[1]=1; rep(i,2,SIZE+4){ fact[i]=fact[i-1]*i%MOD; inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD; fact_inv[i]=fact_inv[i-1]*inv[i]%MOD; } } /* nCk :MODでの二項係数を求める(前処理 int_nCk が必要) 計算量:O(1) */ it nCk(int n, int k){ assert(!(n<k)); assert(!(n<0||k<0)); return fact[n]*(fact_inv[k]*fact_inv[n-k]%MOD)%MOD; } struct dsu1{ ivi par,siz; void init(int n){ rep(i,0,n-1)par.emplace_back(i); rep(i,0,n-1)siz.emplace_back(1); } int leader(int u){ if(par[u]==u)return u; return par[u]=leader(par[u]); } void merge(int u,int v){ int ru=leader(u),rv=leader(v); if(ru==rv)return; if(ru>rv)swap(ru,rv); siz[ru]+=siz[rv]; par[rv]=ru; } bool same(int u,int v){ return leader(u)==leader(v); } int size(int u){ return siz[leader(u)]; } }; struct dsu2{ ivvi par,siz;int h,w; dsu2(int h,int w){ init(h,w); } void init(int x,int y){ h=x,w=y;par.resize(h),siz.resize(h); rep(i,0,h-1) rep(j,0,w-1)par[i].emplace_back(i*w+j); rep(i,0,h-1) rep(j,0,w-1)siz[i].emplace_back(1); } int leader(int x,int y){ if(par[x][y]==x*par[0].size()+y)return x*w+y; return par[x][y]=leader(par[x][y]/w,par[x][y]%w); } void merge(int a,int b,int c,int d){ int ru=leader(a,b),rv=leader(c,d); if(ru==rv)return; if(size(ru/w,ru%w)<size(rv/w,ru%w))swap(ru,rv); siz[ru/w][ru%w]+=siz[rv/w][rv%w]; par[rv/w][rv%w]=ru; } bool same(int a,int b,int c,int d){ return leader(a,b)==leader(c,d); } int size(int a,int b){ int ru=leader(a,b); return siz[ru/w][ru%w]; } }; template<class Abel> struct potedsu{ ivi par,rank; vector<Abel> diff_weight; potedsu(int n=1,Abel SUM_UNITY=0){ init(n,SUM_UNITY); } void init(int n=1,Abel SUM_UNITY=0){ par.resize(n);rank.resize(n);diff_weight.resize(n); irep(i,0,n-1)par[i]=i,rank[i]=0,diff_weight[i]=SUM_UNITY; } int root(int x){ if(par[x]==x){ return x; } int r=root(par[x]); diff_weight[x]+=diff_weight[par[x]]; return par[x]=r; } Abel weight(int x){ root(x); return diff_weight[x]; } bool issame(int x,int y){ return root(x)==root(y); } bool merge(int x,int y,Abel w){ w+=weight(x);w-=weight(y); x=root(x);y=root(y); if(x==y)return false; if(rank[x]<rank[y])swap(x, y),w =-w; if(rank[x]==rank[y])++rank[x]; par[y]=x; diff_weight[y]=w; return true; } Abel diff(int x,int y){ return weight(y)-weight(x); } }; /*総和をもとめるセグ木 struct nod{ it val; int siz; nod(it v=0,int s=0):val(v),siz(s){} }; nod op(nod a,nod b){return nod(a.val+b.val,a.siz+b.siz);} nod e(){return nod(0,0);} struct act{ it a; act(it e=0):a(e){} }; nod mapping(act f,nod x){return nod(f.a+x.val,x.siz);} act comp(act f,act g){return act(f.a+g.a);} act id(){return act(0);}*/ db dist(db a,db b,db c,db d){return sqrt((a-c)*(a-c)+(b-d)*(b-d));} int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int n,k;cin>>n>>k; vd x(n),y(n);scan(x,y); x.emplace_back(0),y.emplace_back(0); vvvd dp((1<<n),vvd(n+1,vd(k+1,dai)));dp[0][n][k]=0; irep(i,0,(1<<n)-1) irep(j,0,n) irep(l,0,k) irep(b,0,n){ if(i&(1<<b)||j==b)continue; if(b==n)dp[i][n][k]=min(dp[i][n][k],dp[i][j][l]+dist(x[j],y[j],x[b],y[b])); else if(l)dp[i+(1<<b)][b][l-1]=min(dp[i+(1<<b)][b][l-1],dp[i][j][l]+dist(x[j],y[j],x[b],y[b])); } db ans=dai; irep(i,0,n) irep(j,0,k-1) ans=min(ans,dp[(1<<n)-1][i][j]+dist(x[i],y[i],x[n],y[n])); fi(20) cout<<ans<<endl; }