什么，你问我维森莫有的题目不能AC，那我告诉你，下面这个骂的就是我！😦
问题 A: God Sequence
样例输入
【样例1】 1 1
【样例2】 1 4
【样例3】 7 5
样例输出
【样例1】 1001 -1001
【样例2】 -8 -6 -9 120 -97
【样例3】 323 -320 411 206 -259 298 -177 -564 167 392 -628 151
提示
样例1解释
A sequence (1001,−1001) contains A=1 positive integer and B=1 negative integer totaling 1001+(−1001)=0. It also satisfies the other conditions and thus is a god sequence.
样例2解释
A sequence (−8,−6,−9,120,−97) contains A=1 positive integer and B=4 negative integers totaling (−8)+(−6)+(−9)+120+(−97)=0. It also satisfies the other conditions and thus is a god sequence.
签到题，模拟
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n,m,ans=0;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n >> m;
if(n==m)
for(int i=1; i<=n; i++)
cout << i << " " << i*(-1) << " ";
else if(n>m)
{
for(int i=1; i<=m-1; i++)
cout << i << " " << i*(-1) << " ";
for(int i=m; i<=n; i++) {
cout << i << " ";
ans += i;
}
cout << ans*(-1);
}
else
{
for(int i=1; i<=n-1; i++)
cout << i << " " << i*(-1) << " ";
for(int i=n; i<=m; i++) {
cout << i*(-1) << " ";
ans += i;
}
cout << ans << endl;
}
return 0;
}
问题 B: ARC Wrecker
样例输入
【样例1】 2 1 2
【样例2】 6 5 3 4 1 5 2
【样例3】 7 314 159 265 358 979 323 846
样例输出
【样例1】 4
【样例2】 32
【样例3】 492018656
提示
样例1解释
There are four possible combinations of heights of the buildings, as follows:
(Building 1, Building 2) = (0,0) (Building 1, Building 2) = (0,1)
(Building 1, Building 2) = (1,1) (Building 1, Building 2) = (1,2)
样例3解释
There are 20192492160000 possible final sceneries. The correct output is that number modulo 109+7, which is 492018656.
除了不同的数会变得相同，其他相对大小不会改变。
设高度取值（包括最低点 0）排序后的集合为 a，独立选择把每个间距（ai+1−ai）减到多少，
答案就是 ∏(ai+1−ai+1)。
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int M=1e9+7,N=1e5;
int n,a[N],res;
struct op {
int x;
op(int x):x(x) {}
friend op operator + (const op &a, const op b) {
const int x = a.x+b.x;
return op(x>=M?x-M:x);
}
friend op operator - (const op &a, const op b) {
const int x = a.x-b.x;
return op(x<0?x+M:x);
}
friend op operator * (const op &a, const op b) {
return op(1ll*a.x*b.x%M);
}
};
int ok(int a, int x=M-2, int res=1) {
for(; x; x>>=1, a=(op(a)*a).x)
if(x&1) res=(op(res)*a).x;
return res;
}
int main()
{
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin>>n;
for(int i=0; i<n; ++i)
cin>>a[i];
sort(a,a+n), n = unique(a,a+n)-a;
res = a[0]+1;
for(int i=0; i<n-1; ++i)
res = (op(res)*(a[i+1]-a[i]+1)).x;
cout<<res<<endl;
return 0;
}
问题 C: Tricolor Pyramid
样例输入
【样例1】 3 BWR
【样例2】 4 RRBB
【样例3】 6 BWWRBW
【样例4】 8 WWBRBBWB
【样例5】 21 BWBRRBBRWBRBBBRRBWWWR
样例输出
【样例1】 W
【样例2】 W
【样例3】 B
【样例4】 R
【样例5】 B
提示
样例1解释
In this case, we will pile up blocks as follows: the 1-st and 2-nd blocks from the left in the bottom row are respectively blue and white, so we place a red block on top of it;
the 2-nd and 3-rd blocks from the left in the bottom row are respectively white and red, so we
place a blue block on top of it;
the blocks in the 2-nd row from the bottom are respectively red and blue, so we place a white block on top of it. Thus, the block at the top will be white;
we should print W.样例2解释
In this case, we will pile up blocks as follows:
the 1-st and 2-nd blocks from the left in the bottom row are both red, so we place a red block on top of it;
the 2-nd and 3-rd blocks from the left in the bottom row are respectively red and blue, so we place
a white block on top of it;
the 3-rd and 4-th blocks from the left in the bottom row are both blue, so we place a blue block on top of it;
the 1-st and 2-nd blocks from the left in the 2-nd row from the bottom are respectively red and white, so we place a blue block on top of it;
the 2-nd and 3-rd blocks from the left in the 2-nd row from the bottom are respectively white and blue, so we place a red block on top of it;
the blocks in the 3-rd row from the bottom are respectively blue and red, so we place a white block on top of it. Thus, the block at the will be white;
we should print W.
公式转换：a⊗b=−(a+b)mod3
组合数算贡献即可。处理阶乘时如果 n≥3，就会 n!≡0(mod3)
所以维护一个数的同时维护它当中因数 3 的个数
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N=4e5,M=3;
string s;
int n,res;
struct op {
int x;
op(int x):x(x) {}
friend op operator + (const op &a, const op b) {
const int x = a.x+b.x;
return op(x>=M?x-M:x);
}
friend op operator - (const op &a, const op b) {
const int x = a.x-b.x;
return op(x<0?x+M:x);
}
friend op operator * (const op &a, const op b) {
return op(1ll*a.x*b.x%M);
}
};
int ok(int a, int x=M-2, int res=1) {
for(; x; x>>=1, a=(op(a)*a).x)
if(x & 1) res=(op(res)*a).x;
return res;
}
struct par {
int p,c;
par(int x):p(x),c(0) { while (!(p%M)) {p/=M,++c;} }
};
int main()
{
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin>>n>>s;
par f=1;
for(int i=0; i<n; i++) {
int x = s[i]=='B'?0:(s[i]=='W'?1:2);
if(!f.c) res = (res+op(f.p)*x).x;
if(i==n-1) break;
par m = n-1-i, d=i+1;
f.p = (op(f.p)*m.p*ok(d.p)).x;
f.c = f.c+m.c-d.c;
}
if(!(n&1)) res = (op(0)-res).x;
cout<<(res==0?'B':(res ==1?'W':'R'))<<endl;
return 0;
}
问题 D: Miracle Tree
无根树必须找根。必然有一个点 u 满足 Eu=1，就设它为根。
对于两条叶子到根的链，它们受到根的距离的约束必然没有互相之间距离的约束大，但是又不足以大到要把 Eu 跟深度反着标。所以标法必然是维护一个时间，DFS 整棵树，在一个节点进栈的时候时间 +1，出栈的时候时间 +1，然后一个节点的 Eu 为进栈时间。
会发现最大的标号的节点（终止节点） v 的标号是 2n−dep[v]。所以根和终止节点取直径的两端即可。
#include <bits/stdc++.h>
#define ll long long
#define sz(a) int((a).size())
#define all(a) (a).begin(), (a).end()
using namespace std;
const int N = 200000+10;
int n,d[N],rt,h[N],a[N],ia=1;
vector<int> G[N];
void bfs(int s) {
for(int u=0; u<n; u++) d[u]=-1;
queue<int> q;
q.push(s), d[s]=0;
while(sz(q)) {
int u = q.front();
q.pop();
for(const int &v : G[u]) {
if(!~d[v])
d[v] = d[u]+1, q.push(v);
}
}
}
void GetH(int u, int fa=-1) {
h[u]=-1;
for(const int &v : G[u]) {
if(v!=fa)
GetH(v,u), h[u]=max(h[u],h[v]);
}
++h[u];
}
void GetA(int u, int fa=-1)
{
a[u] = ia++;
for(const int &v:G[u])
if(v!=fa) GetA(v,u);
++ia;
}
int main()
{
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin>>n;
for(int i=0; i<n-1; i++) {
int u,v;
cin>>u>>v,--u,--v;
G[u].push_back(v), G[v].push_back(u);
}
bfs(0), rt = max_element(d,d+n)-d;
GetH(rt);
for(int u=0; u<n; u++) {
sort(all(G[u]), [&](const int &i, const int &j) {return h[i] < h[j];});}
GetA(rt);
for(int u=0; u<n; u++)
cout<<a[u]<<' ';
cout << endl;
return 0;
}
问题 E: Zero-Sum Ranges 2
样例输入
【样例1】 1 1
【样例2】 2 3
【样例3】 3 7
【样例4】 8 24
【样例5】 30 230
【样例6】 25 455
样例输出
【样例1】 2
【样例2】 2
【样例3】 6
【样例4】 568
【样例5】 761128315856702
【样例6】 0
注意数组大小！容我偷个题解…
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll ans,c[62][62],f[62][62*62][62];
int n,m;
int main()
{
scanf("%d%d",&n,&m);
for(int i=0; i<65; i++) {
c[i][0] = c[i][i]=1;
for(int j=1; j<i; j++)
c[i][j] = c[i-1][j-1]+c[i-1][j];
}
for(int i=1; i<=n+1; i++)
f[i][c[i][2]][i-1] = 1;
for(int i=1; i<=2*n+1; i++)
for(int j=0; j<=m; j++)
for(int k=0; k<i; k++)
for(int x=k+2; x<=2*n+1-i; x++)
if (j+c[x][2]<=m)
f[i+x][j+c[x][2]][x-(k+2)] += c[x-1][k+1]*f[i][j][k];
for(int i=1; i<=2*n+1; i++)
for(int j=0; j<=m; j++)
for(int k=1; k<i; k++)
for(int x=k; x<=2*n+1-i; x++)
if (j+c[x][2]<=m)
f[i+x][j+c[x][2]][x-k] += c[x-1][k-1]*f[i][j][k];
printf("%lld",ans+f[2*n+1][m][0]);
return 0;
}
问题 G: 展示玩具
sort一下，二分
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e4+10;
int n,k,maxn,a[N];
int main()
{
cin>>n>>k;
for(int i=1; i<=n; i++) cin>>a[i];
sort(a+1,a+n+1);
for(int i=1; i<=n; i++)
{
int l=i,r=n;
while(l<r)
{
int mid=(l+r+1)/2;
if(a[mid]<=a[i]+k) l=mid;
else r=mid-1;
}
maxn=max(maxn,l-i+1);
}
cout<<maxn<<endl;
return 0;
}
问题 K: 促销骰子
这提示给的，难度直接降到最低…直接分类讨论
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int a,b,c,t;
int main()
{
cin>>a;
if(a!=6) cout<<"0"<<endl;
else if(a==6)
{
cin>>b;
if(b!=6) cout<<"10"<<endl;
else {
cin>>c;
if(c!=6) cout<<"100"<<endl;
else cout<<"1000"<<endl;
}
}
return 0;
}
扫一扫
810
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
