A
Solved: 00:34 BPM136
对于0的个数和1的个数不相等直接输出0或1,否则输出10000…/01111…
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int num0 = 0, num1 = 0;
for (auto c : s)
if (c == '0')
++num0;
else
++num1;
if (num0 == num1) {
int t = s[0] - '0';
cout << 1 - t;
for (int i = 1; i < s.size(); ++i)
cout << t;
cout << '\n';
} else {
int t = num0 > num1 ? 1 : 0;
for (int i = 0; i < s.size(); ++i)
cout << t;
cout << '\n';
}
}
B
Unsolved
C
Unsolved
对于N小的时候跑欧拉路径,对于N大的时候直接随机(未补)
D
Solved: 00:35 zkp
#include <bits/stdc++.h>
using namespace std;
char a[510][510];
int main()
{
int n,m,ans=0;
bool w=false;
cin>>n>>m;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=1;i<n-1;i++)for(int j=1;j<m-1;j++)if(a[i][j]!='#')ans++;
for(int i=1;i<m-1;i++)if(a[0][i]=='#'||a[n-1][i]=='#')w=true;
for(int i=1;i<n-1;i++)if(a[i][0]=='#'||a[i][m-1]=='#')w=true;
if(!w)ans++;
if(m<=2)
{
ans=0;
for(int i=1;i<n-1;i++)if(!(a[i][0]=='#'||a[i][m-1]=='#'))ans++;
}
if(n<=2)
{
ans=0;
for(int i=1;i<m-1;i++)if(!(a[0][i]=='#'||a[n-1][i]=='#'))ans++;
}
if(n<=2&&m<=2)ans=0;
cout<<ans<<endl;
return 0;
}
E
Unsolved
F
Solved: 02:57 BPM136
贪心即可,每次引爆最可怕的
#include <bits/stdc++.h>
using namespace std;
#define SZ(x) ((int)(x).size())
using ll = long long;
int const N = 100005;
int a[N], b[N];
int mx[N];
int n;
ll m;
int main() {
int bal = 0;
cin >> n >> m;
ll lst = 0;
int cansol = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
lst += a[i];
if (lst <= m)
++cansol;
}
for (int i = 0; i < n; ++i)
cin >> b[i];
if (cansol == 0) {
puts("-1");
return 0;
}
for (int i = cansol - 1; i >= 0; --i)
mx[i] = max(mx[i + 1], b[i]);
lst = 0;
ll lsta = 0;
vector<ll> ans;
bool can = 0;
int p = 0;