競プロ向けc++

(const int dx[8]={-1,0,1,-1,1,-1,0,1};)

const int dx[8]={-1,0,1,-1,1,-1,0,1};

(for(int i=0;i<N;i++)cin>>A[i];)

for(int i=0;i<N;i++)cin>>A[i];

(for(int j=0;j<N;j++)for(int k=0;k<N;k++))

for(int j=0;j<N;j++)for(int k=0;k<N;k++)

(for(int i=S.size();i>=0;i--))

for(int i=S.size();i>=0;i--)

(int u,v;cin>>u>>v;u--,v--;)

int u,v;cin>>u>>v;u--,v--;

(for(int d=0;d<8;d++))

for(int d=0;d<8;d++)

(int nx=x+dx[d],ny=y+dy[d];)

int nx=x+dx[d],ny=y+dy[d];

(if(nx<0||nx>=H||ny<0||ny>=W||S[nx][ny]!='#')continue;)

if(nx<0||nx>=H||ny<0||ny>=W||S[nx][ny]!='#')continue;

(if(j+w<=W)dp[i+1][j+w]=max(dp[i+1][j+w],dp[i][j]+v);)

if(j+w<=W)dp[i+1][j+w]=max(dp[i+1][j+w],dp[i][j]+v);

(cout<<fixed<<setprecision(10)<<ans<<endl;)

cout<<fixed<<setprecision(10)<<ans<<endl;

(for(auto[k,v]:mp))

for(auto[k,v]:mp)

(A.push_back(make_pair(i,j));)

A.push_back(make_pair(i,j));

(for(int v:g[i]))

for(int v:g[i])

(map<int>mp;)

map<int>mp;

(for(;Q--;))

for(;Q--;)

(for(;T--;))

for(;T--;)

(while(!q.empty))

while(!q.empty)

(int pc=__builtin_popcount(N);)

int pc=__builtin_popcount(N);

(long mid=(l+r)/2;)

long mid=(l+r)/2;

(while(r-l>1))

while(r-l>1)

(long sum[2<<17];)

long sum[2<<17];

(for(int i=1;i<=N;i++))

for(int i=1;i<=N;i++)

(sum[i]=sum[i-1]+A[i];)

sum[i]=sum[i-1]+A[i];

(for(int i=1;i<1<<N;i++))

for(int i=1;i<1<<N;i++)

(if(i>>j&1)ans.push_back(A[j]);)

if(i>>j&1)ans.push_back(A[j]);

(sort(A,A+N);)

sort(A,A+N);

(auto it=lower_bound(A,N+1,x);)

auto it=lower_bound(A,N+1,x);

(bool vis[2<<17];)

bool vis[2<<17];

(int dist[2<<17];)

int dist[2<<17];

(dist[v]=dist[u]+1;)

dist[v]=dist[u]+1;

(int cnt=0;)

int cnt=0;

(int ans=0;)

int ans=0;

(long mn=1e18;)

long mn=1e18;

(long mx=0;)

long mx=0;

(dp[i][j]=min(dp[i][j],dp[i-1][j-A[i-1]+x);)

dp[i][j]=min(dp[i][j],dp[i-1][j-A[i-1]+x);

(if(vis[v])continue;)

if(vis[v])continue;

(if(dist[v]>0)continue;)

if(dist[v]>0)continue;

(int u=q.front();q.pop();)

int u=q.front();q.pop();

(#include<atcoder/segtree>)

#include<atcoder/segtree>

(int op(int a,int b){return max(a,b);})

int op(int a,int b){return max(a,b);}

(int e(){return 0;})

int e(){return 0;}

(segtree<int,op,e>seg(A);)

segtree<int,op,e>seg(A);

(priority_queue<pair<long,int>,vector<pair<long,int> >,greater<pair<long,int> > >q;)

priority_queue<pair<long,int>,vector<pair<long,int> >,greater<pair<long,int> > >q;

(set<long>st;)

set<long>st;

(const int d[5]={0,1,0,-1};)

const int d[5]={0,1,0,-1};

(for(int r=0;r<4;r++))

for(int r=0;r<4;r++)

(int x=i+d[r],y=j+d[r+1];)

int x=i+d[r],y=j+d[r+1];

(if(x<0||y<0||x>=H||y>=W)continue;)

if(x<0||y<0||x>=H||y>=W)continue;

(int id=lower_bound(S.begin(),S.end(),make_pair(x,0))-S.begin();)

int id=lower_bound(S.begin(),S.end(),make_pair(x,0))-S.begin();

(sort(A.begin(),A.end(),[&](int i,int j){return x[i]<x[j];});)

sort(A.begin(),A.end(),[&](int i,int j){return x[i]<x[j];});