A Phone Desktop
早上vp这div3一开始看这题还看错了,其实就是贪心的先放2*2的方格,之后考虑剩余的方格放1*1的方格,计算所需的数量即可
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<bitset>
#include<string>
#include<cstring>
#include<iomanip>
#include<iostream>
#include<algorithm>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using ull=unsigned long long ;
#define endl '\n'
#define int long long
constexpr int N = 2e5+10,P=131;
constexpr int mod = 998244353;
/*inline __int128 read()
{
__int128 x=0,t=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')t=-1;c=getchar();}
while(c>='0'&&c<='9'){x=(__int128)(x<<1)+(__int128)(x<<3)+(c^48);c=getchar();}
return t*x;
}
inline void write(__int128 x)
{
if(x<0){x=-x;putchar('-');}
if(x>9)write(x/10);
putchar(x%10+'0');
}*/
void solve()
{
int x,y;
cin>>x>>y;
int v=y/2;
int s=v*7;
if(y%2)s+=11,v++;
if(x<=s)cout<<v<<endl;
else cout<<v+(x-s)/15+((x-s)%15!=0)<<endl;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int t;
cin>>t;
while(t--)
solve();
system("pause");
return 0;
}
B Symmetric Encoding
根据题目意思来,先遍历一遍字符串得到r串,再根据r串先预处理字符对应应当修改的字符并建立相关的映射,再遍历一遍原字符串输出即可
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<bitset>
#include<string>
#include<cstring>
#include<iomanip>
#include<iostream>
#include<algorithm>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using ull=unsigned long long ;
#define endl '\n'
#define int long long
constexpr int N = 2e5+10,P=131;
constexpr int mod = 998244353;
/*inline __int128 read()
{
__int128 x=0,t=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')t=-1;c=getchar();}
while(c>='0'&&c<='9'){x=(__int128)(x<<1)+(__int128)(x<<3)+(c^48);c=getchar();}
return t*x;
}
inline void write(__int128 x)
{
if(x<0){x=-x;putchar('-');}
if(x>9)write(x/10);
putchar(x%10+'0');
}*/
int n;
string s;
void solve()
{
cin>>n;
cin>>s;
string r="";
set<char>v;
for(int i=0;i<n;i++)
v.insert(s[i]);
for(auto val:v)r+=val;
map<char,char>mp;
for(int i=0;i<r.size();i++)
mp[r[i]]=r[r.size()-i-1];
for(int i=0;i<n;i++)
cout<<mp[s[i]];
cout<<endl;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int t;
cin>>t;
while(t--)
solve();
system("pause");
return 0;
}
C Beautiful Triple Pairs
这题其实比D题难,这题我是先重后向前遍历一遍数组,每次分别记录{ a[i] ,0, a[i+2] },{0, a[i+1], a[i+2] },{ a[i],a[i+1],0 }之下分别有几个a[i+1],a[i],a[i+2],再记录其下有几种方案,拿总数方案数减去{ a[i] ,a[i+1], a[i+2] }的方案数(因为要保证每对序列要有一个不相同,所以要减去与当前全部相同的方案),一开始我是用map套multiset的方式记录的,但是每次count一遍a[i]的总数是O(n)的时间复杂度。容易超时,这里我们应该用map套map的方式记录,可以使每次获取a[i]的数量降为O(log n),输出即可;
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<bitset>
#include<string>
#include<cstring>
#include<iomanip>
#include<iostream>
#include<algorithm>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using ull=unsigned long long ;
#define endl '\n'
#define int long long
constexpr int N = 2e5+10,P=131;
constexpr int mod = 998244353;
/*inline __int128 read()
{
__int128 x=0,t=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')t=-1;c=getchar();}
while(c>='0'&&c<='9'){x=(__int128)(x<<1)+(__int128)(x<<3)+(c^48);c=getchar();}
return t*x;
}
inline void write(__int128 x)
{
if(x<0){x=-x;putchar('-');}
if(x>9)write(x/10);
putchar(x%10+'0');
}*/
struct node
{
int x,y,z;
bool operator<(const node&W)const
{
if(x==W.x)
{
if(y==W.y)
return z<W.z;
return y<W.y;
}
return x<W.x;
}
};
struct vv
{
int sum;
map<int,int>p;
};
int n;
int a[N];
void solve()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
int ans=0;
map<node,vv>v;
for(int i=n-2;i>=1;i--)
{
int n1=a[i],n2=a[i+1],n3=a[i+2];
if(!v[{0,n2,n3}].p.size())
v[{0,n2,n3}].sum=1;
else
{
ans+=v[{0,n2,n3}].sum-v[{0,n2,n3}].p[n1];
v[{0,n2,n3}].sum++;
}
v[{0,n2,n3}].p[n1]++;
if(!v[{n1,0,n3}].p.size())
v[{n1,0,n3}].sum=1;
else
{
ans+=v[{n1,0,n3}].sum-v[{n1,0,n3}].p[n2];
v[{n1,0,n3}].sum++;
}
v[{n1,0,n3}].p[n2]++;
if(!v[{n1,n2,0}].p.size())
v[{n1,n2,0}].sum=1;
else
{
ans+=v[{n1,n2,0}].sum-v[{n1,n2,0}].p[n3];
v[{n1,n2,0}].sum++;
}
v[{n1,n2,0}].p[n3]++;
}
cout<<ans<<endl;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int t;
cin>>t;
while(t--)
solve();
system("pause");
return 0;
}
D Ingenuity-2
贪心+构造,列出几种方案可以发现两方每一次选的方向要么与对方相同,要么与对方相反,因此总共可分配方案数n必定是一个偶数,同时上下的方案总数与左右的方案总数必定为偶数,然后我们交替的分配双方,如果发现只分配了一方就不合法,反之输出合法方案即可;
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<bitset>
#include<string>
#include<cstring>
#include<iomanip>
#include<iostream>
#include<algorithm>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using ull=unsigned long long ;
#define endl '\n'
#define int long long
constexpr int N = 2e5+10,P=131;
constexpr int mod = 998244353;
/*inline __int128 read()
{
__int128 x=0,t=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')t=-1;c=getchar();}
while(c>='0'&&c<='9'){x=(__int128)(x<<1)+(__int128)(x<<3)+(c^48);c=getchar();}
return t*x;
}
inline void write(__int128 x)
{
if(x<0){x=-x;putchar('-');}
if(x>9)write(x/10);
putchar(x%10+'0');
}*/
int n;
char ans[N];
void solve()
{
cin>>n;
string s;
cin>>s;
if(s.size()%2)
{
cout<<"NO"<<endl;
return ;
}
else
{
map<char,vector<int>>v;
for(int i=0;i<n;i++)
v[s[i]].push_back(i);
if((v['N'].size()+v['S'].size())%2||(v['E'].size()+v['W'].size())%2)
{
cout<<"NO"<<endl;
return ;
}
int i=0;
int minv=min(v['N'].size(),v['S'].size());
for(i=0;i<minv;i++)
{
if(i&1)
{
ans[v['N'][i]]='R';
ans[v['S'][i]]='R';
}
else
{
ans[v['N'][i]]='H';
ans[v['S'][i]]='H';
}
}
for(;i<v['N'].size();i++)
if(i&1)ans[v['N'][i]]='R';
else ans[v['N'][i]]='H';
for(;i<v['S'].size();i++)
if(i&1)ans[v['S'][i]]='R';
else ans[v['S'][i]]='H';
i=0;
minv=min(v['E'].size(),v['W'].size());
for(i=0;i<minv;i++)
{
if(i&1)
{
ans[v['E'][i]]='H';
ans[v['W'][i]]='H';
}
else
{
ans[v['E'][i]]='R';
ans[v['W'][i]]='R';
}
}
for(;i<v['E'].size();i++)
if(i&1)
ans[v['E'][i]]='R';
else ans[v['E'][i]]='H';
for(;i<v['W'].size();i++)
if(i&1)
ans[v['W'][i]]='R';
else ans[v['W'][i]]='H';
}
char b=ans[0];
bool flag=false;
for(int i=0;i<n;i++)
if(b!=ans[i])flag=true;
if(!flag)cout<<"NO";
else
{
for(int i=0;i<n;i++)
cout<<ans[i];
}
cout<<endl;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int t;
cin>>t;
while(t--)
solve();
system("pause");
return 0;
}
E Money Buys Happiness
考虑背包,但是我们发现如果直接以总花费作为背包容量太大,这里我们可以反过来以幸福度作为背包容量,即表示再第i月幸福度为j情况下的最小花费,最后遍历一遍得到小于(m-1)*x的最大幸福度即可;
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<bitset>
#include<string>
#include<cstring>
#include<iomanip>
#include<iostream>
#include<algorithm>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using ull=unsigned long long ;
#define endl '\n'
#define int long long
constexpr int N = 2e5+10,P=131;
constexpr int mod = 998244353;
/*inline __int128 read()
{
__int128 x=0,t=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')t=-1;c=getchar();}
while(c>='0'&&c<='9'){x=(__int128)(x<<1)+(__int128)(x<<3)+(c^48);c=getchar();}
return t*x;
}
?
inline void write(__int128 x)
{
if(x<0){x=-x;putchar('-');}
if(x>9)write(x/10);
putchar(x%10+'0');
}*/
int n,m;
int f[60][N];
int v[N],w[N];
void solve()
{
cin>>n>>m;
int sz=0;
for(int i=1;i<=n;i++)
{
cin>>w[i]>>v[i];
sz=max(sz,v[i]);
}
int tt=sz*50;
for(int i=0;i<=n;i++)
for(int j=0;j<=tt;j++)
f[i][j]=1e18;
f[0][0]=0;
for(int i=1;i<=n;i++)
{
for(int j=tt;j>=0;j--)
{
f[i][j]=f[i-1][j];
if(j>=v[i])
f[i][j]=min(f[i][j],f[i-1][j-v[i]]+w[i]);
}
for(int j=0;j<=tt;j++)
if(f[i][j]>(i-1)*m)f[i][j]=1e18;
}
int ans=0;
for(int i=0;i<=tt;i++)
if(f[n][i]<=(n-1)*m)
ans=max(ans,i);
cout<<ans<<endl;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int t;
cin>>t;
while(t--)
solve();
system("pause");
return 0;
}