Harigami

#include <bits/stdc++.h> using namespace std; bool flag; queue<int> que; const int INF = 1e9+7; string s[501]; int d[501][501]; int dx[4]={-1,1,0,0}; int dy[4]={0,0,1,-1}; int R,C,K; void bfs(int x,int y,int cost){ for(int i=0;i<501;i++)for(int j=0;j<501;j++)d[i][j]=INF; que.push(1000*x+y); d[x][y]=0; flag = true; while(que.empty()==false){ int temp = que.front(); que.pop(); int tx = temp/1000; int ty = temp%1000; if(d[tx][ty]==K-1)continue; for(int i=0;i<4;i++){ if(s[x+dx[i]][y+dy[i]]=='o'){ if(d[x+dx[i]][y+dy[i]]>d[tx][ty]+1)d[x+dx[i]][y+dy[i]]=d[tx][ty]+1; que.push((x+dx[i])*1000+y+dy[i]); }else{ flag = false; } } if(flag==false){ while (!que.empty()) que.pop(); break; } } } bool check(int x,int y){ flag = false; bfs(x,y,0); return flag; } int main(void){ cin >> R >> C >> K; for(int i=0;i<R;i++){ cin >> s[i]; } int ans = 0; for(int i=K-1;i<=R-K;i++){ for(int j=K-1;j<=C-K

#include <bits/stdc++.h> #define ALL(A) (A).begin(),(A).end() #define rep(i,n) for(int i=0;i<(n);i++) using namespace std; int main(void){ int N,M; cin >> N; vector<int> d(N); rep(i,N)cin >> d[i]; vector<int> T(M); rep(i,M)cin >> T[i]; sort(ALL(T)); int cnt = 0; for(int i=0;i<N;i++){ } cout << cnt << endl; }

#include <bits/stdc++.h> using namespace std; #define ALL(A) (A).begin(),(A).end() #define ll long long const ll mod = 1e9+7; const ll INF = 2*1e18; const int inf = 1e9+7; int main(void){ int N,X,cnt; cin >> N >> X; vector<int> a(N),ans; int Y = X; for(int i=0;i<N;i++){ cin >> a[i]; Y ^= a[i]; if(a[i] == -1){ cnt++; ans.push_back(i); } } for(int i=0;i<cnt;i++){ int now = 0; for(int j=30;j>=0;j--){ if( ((1<<j)&Y )){ if( ((1<<j) + now )<=X){ Y-=(1<<j); now += (1<<j); } } } a[ans[cnt]] = now; } if(Y){ cout << -1 << endl; }else{ for(int i=0;i<N;i++){ if(i!=0)cout << " "; cout << a[i]; } cout << endl; } }

#include <bits/stdc++.h> using namespace std; #define ALL(A) (A).begin(),(A).end() #define ll long long ll msize; ll count(vector<int> &c){ ll ret = 0; cout << "c.size() = " << c.size() << endl; for(auto x:c) cout << x << " "; for(int i=1;i<c.size();i++){ for(int j=i;j<=c.size();j++){ if(c[j]-c[i-1]>=0)ret++; } } cout << " ret= " << ret << endl; return ret; } bool check(vector<int> &a,int k){ vector<int> b = a,c(a.size()+1); for(int i=0;i<b.size();i++){ if(b[i] >= k)b[i]=1; else b[i] = -1; } c[0] = 0; for(int i=0;i<b.size();i++){ c[i+1] = c[i] + b[i]; } //cのある区間について、k以上の数をカウントする if(count(c) >= (msize+1)/2)return 1; else return 0; } int main(void){ int N,Max=0; cin >> N; vector<int> a(N); msize = N*(N+1)/2; for(int i=0;i<N;i++){ cin >> a[i]; Max = max(Max,a[i]); } int ok = 0; int ng = Max+1; while(abs(ok-ng)>1){ int mid = (ok+ng)/2; //check(vector<int> &a,mid)はmid以上の数がmに半分以上含まれていた場合1を返す if(c

#include <bits/stdc++.h> #define ALL(A) (A).begin(),(A).end() #define ll long long #define rep(i,n) for(int i=0;i<(n);i++) using namespace std; ll dp[10][2002]; int main(void){ cin.tie(0); ios::sync_with_stdio(false); int N,K; cin >> N >> K; vector<vector<ll>> a(10),b(10,vector<ll>(2002)); rep(i,N){ int c,g; cin >> c >> g; g--; a[g].push_back(c); } rep(i,10){ sort(ALL(a[i]),greater<>()); rep(j,a[i].size()+1){ if(j==0)continue; b[i][j] = a[i][j-1]+b[i][j-1]; } rep(j,a[i].size()+1){ b[i][j] += j*(j-1); } } ll ans = 0; //b[i][j] := ジャンルiをj冊売った時の価格 // dp[i][j] := ジャンルをi番目まで見て,j冊売った時の最大の価格 rep(i,10){ rep(j,K+1){ if(j<=a[i].size()){ if(i==0){ dp[i][j] = b[i][j]; }else{ dp[i][j] = max(dp[i-1][K],dp[i-1][K-j] + b[i][j]); } }else{ if(i==0)dp[i][j] = dp[i][j-1]; else dp[i][j] = max(dp[i][j-1],dp[i-1][K]);; } } } cout << dp[9][K] << endl; }