A Bookshelf Filling
贪心依次放即可,注意选择的是 0 ≤ k ≤ m − 1 0\leq k\leq m-1 0≤k≤m−1个,答案满足单调性,check函数判断选择了 x x x本书后的长度是否不超过原来的长度去掉 x x x本书即可。
#include <bits/stdc++.h>
#define all(a) a.begin(),a.end()
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define nrep(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
using ll = long long ;
ll a,b,n,m,h,k;
bool check(ll x){
if(h==b){
if(x>=k)return (k+h-a-1)/(h-a)*b-n%b<=0;
else return 0;
}
return x+(x+h-b-1)/(h-b)*b-n%b<=k;
}
void solve()
{
cin>>a>>b>>n>>m>>h;
k=m-min(m,(n/b*(h-a)));
if(k==0){
cout<<n+1<<'\n';
return ;
}
ll l=1,r=k;
while(l<r){
ll mid=l+r>>1;
if(check(mid)){
l=mid+1;
}
else {
r=mid;
}
}
cout<<k-(l-1)+n<<"\n";
}
int main()
{
ios::sync_with_stdio(false);
int t=1;
cin>>t;
while(t--){
solve();
}
return 0;
}
F 342 and Xiangqi
签到题
#include <bits/stdc++.h>
#define all(a) a.begin(),a.end()
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define nrep(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
using ll = long long ;
map<pair<int,int>,int>mp;
int fan(int x,int y){
return mp[{x,y}];
}
void solve()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<min((fan(a,c)+fan(b,d)),(fan(a,d)+fan(b,c)))<<'\n';
}
int main()
{
mp[{1,2}]=1;
mp[{1,3}]=1;
mp[{1,4}]=2;
mp[{1,5}]=3;
mp[{1,6}]=3;
mp[{1,7}]=4;
mp[{2,1}]=1;
mp[{2,3}]=2;
mp[{2,4}]=1;
mp[{2,5}]=2;
mp[{2,6}]=2;
mp[{2,7}]=3;
mp[{3,1}]=1;
mp[{3,2}]=2;
mp[{3,4}]=1;
mp[{3,5}]=2;
mp[{3,6}]=2;
mp[{3,7}]=3;
mp[{4,1}]=2;
mp[{4,2}]=1;
mp[{4,3}]=1;
mp[{4,5}]=1;
mp[{4,6}]=1;
mp[{4,7}]=2;
mp[{5,1}]=3;
mp[{5,2}]=2;
mp[{5,3}]=2;
mp[{5,4}]=1;
mp[{5,6}]=2;
mp[{5,7}]=1;
mp[{6,1}]=3;
mp[{6,2}]=2;
mp[{6,3}]=2;
mp[{6,4}]=1;
mp[{6,5}]=2;
mp[{6,7}]=1;
mp[{7,1}]=4;
mp[{7,2}]=3;
mp[{7,3}]=3;
mp[{7,4}]=2;
mp[{7,5}]=1;
mp[{7,6}]=1;
ios::sync_with_stdio(false);
int t=1;
cin>>t;
while(t--){
solve();
}
return 0;
}
G Chevonne’s Necklace
#include <bits/stdc++.h>
using namespace std;
const int N = 2e3+10 ;
int a[N],dp[N];
bool vis[N];
const int mod = 998244353 ;
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
vis[0]=dp[0]=1;
for(int i=1;i<=n;i++)if(a[i]){
for(int j=n;j>=a[i];j--){
vis[j]|=vis[j-a[i]];
dp[j]=(dp[j]+dp[j-a[i]])%mod;
}
}
int p=n;
while(vis[p]==0)p--;
cout<<p<<' '<<dp[p];
}
H Kanbun
模拟每个 ) ) )对应的 ( ( (的位置输出即可
#include <bits/stdc++.h>
#define all(a) a.begin(),a.end()
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define nrep(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
using ll = long long ;
int a[100010];
void solve()
{
memset(a,-1,sizeof a);
int n;
cin>>n;
string s;
cin>>s;
stack<int>st;
for(int i=0;i<n;i++){
if(s[i]=='('){
st.push(i);
}else if(s[i]==')'){
a[i]=st.top();
st.pop();
}
}
for(int i=0;i<n;i++){
if(s[i]=='(')continue;
else if(s[i]==')'){
cout<<i+1<<" "<<a[i]+1<<" ";
}else{
cout<<i+1<<" ";
}
}
}
int main()
{
ios::sync_with_stdio(false);
int t=1;
//cin>>t;
while(t--){
solve();
}
return 0;
}
I Equal Sum Arrays
签到题
#include <bits/stdc++.h>
#define all(a) a.begin(),a.end()
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define nrep(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
using ll = long long ;
int n;
int ans=0;
void dfs(int x){
if(x>n)return ;
if(x==n)ans++;
else{
for(int i=1;i<=n;i++)
dfs(x+i);
}
}
void solve()
{
cin>>n;
dfs(0);
cout<<ans;
}
int main()
{
ios::sync_with_stdio(false);
int t=1;
//cin>>t;
while(t--){
solve();
}
return 0;
}
L Let’s Swap
通过暴力可以发现答案是一个圆环,暴力O(n)查找第一个点往左还是往右的位置,对 b b b串进行二倍长度哈希,在反向进行哈希,暴力之前搜过的位置查看对应长度 n n n的哈希与 a a a串的哈希是否相同即可。
#include <bits/stdc++.h>
#define all(a) a.begin(),a.end()
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define nrep(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
using ll = unsigned long long ;
const int N = 1e6+10 ;
const ll P = 1331;
char a[N],b[N];
ll u[N],ha1[N],ha2[N],ha3[N];
const ll mod = ULLONG_MAX;
int n;
ll mi(ll a,ll b,ll p){
ll r=1;
while(b){
if(1&b)r=r*a%p;
a=a*a%p;
b>>=1;
}
return r;
}
int fan(int x,int y){
if(x<=y){
assert(y-x+1>0);
return y-x+1;
}
else {
assert(n-(x-y)+1>0);
return n-(x-y)+1;
}
}
ll ge(ll *ha,ll l,ll r){
return ha[r]-ha[l-1]*u[r-l+1];
}
void solve()
{
scanf("%s",a+1);
scanf("%s",b+1);
n=strlen(a+1);
for(int i=n+1;i<=2*n;i++)
b[i]=b[i-n];
b[2*n+1]='\0';
ha1[0]=1;
for(int i=1;i<=n*2;i++){
ha1[i]=ha1[i-1]*P+b[i];
}
reverse(b+1,b+1+n);
for(int i=n+1;i<=2*n;i++)
b[i]=b[i-n];
ha2[0]=1;
for(int i=1;i<=2*n;i++){
ha2[i]=ha2[i-1]*P+b[i];
}
ha3[0]=1;
for(int i=1;i<=n;i++){
ha3[i]=ha3[i-1]*P+a[i];
}
int L,R;
scanf("%d%d",&L,&R);
map<int,bool>l,r;
queue<pair<int,int>>q;
l[1]=true;
q.push({1,1});
while(!q.empty()){
pair<int,int> t=q.front();q.pop();
if(t.second&1){
if(!r.count(fan(t.first,L))){
r[fan(t.first,L)]=true;
q.push({fan(t.first,L),t.second+1});
}
if(!r.count(fan(t.first,R))){
r[fan(t.first,R)]=true;
q.push({fan(t.first,R),t.second+1});
}
}else{
if(!l.count(fan(t.first,L))){
l[fan(t.first,L)]=true;
q.push({fan(t.first,L),t.second+1});
}
if(!l.count(fan(t.first,R))){
l[fan(t.first,R)]=true;
q.push({fan(t.first,R),t.second+1});
}
}
}
for(auto &[t,val]:l){
if(ge(ha1,t,t+n-1)==ge(ha3,1,n)){
printf("yes\n");
return ;
}
}
for(auto &[t,val]:r){
int u=n-t+1;
if(ge(ha2,u,u+n-1)==ge(ha3,1,n)){
printf("yes\n");
return ;
}
}
printf("no\n");
}
int main()
{
u[0]=1;
for(int i=1;i<N;i++) u[i]=u[i-1]*P;
int t=1;
cin>>t;
while(t--){
solve();
}
return 0;
}