目录
A.1132B 排序 900:
略
B.534A 构造 1100 :
仅需特判并手动模拟1~4,其他情况均可全输出,参考如下代码
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vllvll;
inline void solve() {
ll n;
cin >> n;
if (n == 1||n == 2) {
cout << "1" << endl;
cout << "1";
return;
}
else if (n == 3) {
cout << "2" << endl;
cout << "1 3";
return;
}
else if (n == 4) {
cout << "4" << endl;
cout << "3 1 4 2";
return;
}
int l = 1, r = n / 2 + (n % 2) + 1;
cout << n << endl;
for (int i = 1; i <= n / 2; i++) {
cout << l++ << " " << r++ << " ";
}
if (n % 2)cout << n / 2 + 1;
}
int main() {
int t = 1;
//cin >> t;
while (t--)
solve();
return 0;
}
C.262B 贪心 1200 :
优先将最小的负数转化为正数,若全为正数,则只对最小的数操作。
#include<bits/stdc++.h>
using namespace std;
int n, m, a[100009], l;
long long sum;
int main()
{
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i]; if (a[i] < 0)l++;
}
if (n == 1)
if (m % 2 != 0) return cout << -a[1], 0;
else return cout << a[1], 0;
sort(a + 1, a + 1 + n);
if (m <= l)
for (int i = 1; i <= m; i++)
a[i] *= -1;
else{
for (int i = 1; i <= l; i++)a[i] *= -1;
sort(a + 1, a + 1 + n);
m -= l;
if (m % 2 != 0) {
a[1] *= -1;
}
}
for (int i = 1; i <= n; i++)sum += a[i];
cout << sum;
}
D.922B 暴力 1300 :
看似需要N^3枚举,实际上根据条件只需知道a和b即可得到c(由于a^b^c=0得c=a^b),暴力复杂度变为N^2,枚举,去重,统计即可。
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vllvll;
inline void solve() {
int n;
cin >> n;
int ans = 0;
map<vector<int>, bool> ma;
vector<int> mask;
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
int k = i ^ j;
if (!(i + j > k && i + k > j && j + k > i)||k>n)continue;
mask.push_back(i);
mask.push_back(j);
mask.push_back(k);
sort(mask.begin(), mask.end());
if (!ma[mask]) {
ans++, ma[mask] = true;
//cout << i << " " << j << " " << k << endl;
}
mask.clear();
}
}
cout << ans << endl;
}
int main() {
int t = 1;
//cin >> t;
while (t--)
solve();
return 0;
}
E.981C 树 1400 :
送分题 略
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vllvll;
inline void solve() {
int n;
cin >> n;
if (n == 2) {
cout << "Yes" << endl;
cout << "1" << endl;
cout << "1 2" << endl;
return;
}
vll into(n + 1);
for (int i = 1; i < n; i++) {
int a, b;
cin >> a >> b;
into[a]++;
into[b]++;
}
int root_id = -1;
vll yz;
for (int i = 1; i <= n; i++) {
if (into[i] > 2) {
if (root_id == -1)root_id = i;
else {
cout << "No" << endl;
return;
}
}
if (into[i] == 1)yz.push_back(i);
}
if (root_id == -1) {
for (int i = 1; i <= n; i++)if (into[i] == 2) {
root_id = i;
}
}
cout << "Yes" << endl;
cout << yz.size() << endl;
for (auto op : yz) {
cout << op << " " << root_id << endl;
}
}
int main() {
int t = 1;
//cin >> t;
while (t--)
solve();
return 0;
}
F.1061B 贪心 模拟 1400:
用一个变量mask记录纵向覆盖的进度模拟即可
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vllvll;
const int N = 200010;
inline void solve() {
ll n, m, num = 0, mask = 0;
cin >> n >> m;
vll s(n + 1);
for (int i = 1; i <= n; i++)cin >> s[i], num += s[i];
if (n == 1) return cout << 0 << endl, void();
sort(s.begin() + 1, s.end());
mask = s[n];
for (int i = n; i >= 1; i--) {
if (mask > s[i])num -= mask - s[i] + 1, mask = s[i] - 1;
else if (mask <= s[i])num--, mask--;
}
cout << num - max(0ll,mask) << endl;
}
int main() {
int t = 1;
//cin >> t;
while (t--)
solve();
return 0;
}
G.1095C 二进制 贪心 1400:
一个数字最少能拆成多少个二次幂数字,就看这个数字转化为二进制后的1的数量。例如:9(1001)最少能拆成两个二次幂数字(1,8),若最少能拆的数量大于k则不满足题目要求。
此时只需要暴力拆解直到所有数字都为1或者拆成k个二次幂。若全拆成1还不足k个数字的话则“NO”,否则“YES”。
// LUOGU_RID: 111202102
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vllvll;
const int N = 200010;
inline void solve() {
ll n, k;
priority_queue<ll> Q;
cin >> n >> k;
for (ll i = (1ll << 33); i >= 1; i >>= 1) {
if (i <= n)Q.push(i), n -= i;
}
if (Q.size() > k)return cout << "NO" << endl, void();
while (Q.size() < k) {
if (Q.top() == 1)break;
else {
Q.push(Q.top() / 2);
Q.push(Q.top() / 2);
Q.pop();
}
}
if (Q.size() != k)return cout << "NO" << endl, void();
cout << "YES" << endl;
while (!Q.empty())cout << Q.top() << " ", Q.pop();
}
int main() {
int t = 1;
//cin >> t;
while (t--)
solve();
return 0;
}
H.1385D 分治 前缀和 暴力 1500:
根据题意,固定最后一个字母的位置,便可以得到整个字符串的样子。如:n=8 将d固定在3号位置,则串必定是bbdcaaaa,若固定在2号位置,则串必定是cdbbaaaa。根据以上推论,得知最终串状态一共只有n种,O(n^2logn)便可求出所有状态的答案,取最优即可;显然时间复杂度不可取,使用前缀和优化将时间复杂度变为O(nlogn)。
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vllvll;
inline void solve() {
int ans = INT_MAX;
int n;
string s;
cin >> n >> s;
s = '1' + s;
vllvll per(26, vll(n + 1));
for (int i = 1; i <= n; i++) {
for (int j = 0; j < 26; j++) {
per[j][i] = per[j][i - 1] + (s[i] - 'a' == j);
}
}
function<void(int, int, int, int)>dfs = [&](int l, int r, int ch, int fixnum) {
int mid = l + r >> 1;
//cout << l << " " << r << " " << fixnum << endl;
if (l == r) {
ans = min(ans, fixnum + (s[l] - 'a' != ch));
return;
}
dfs(l, mid, ch + 1, fixnum + mid - l + 1 - (per[ch][r] - per[ch][mid]));
dfs(mid + 1, r, ch + 1, fixnum + r - mid - (per[ch][mid] - per[ch][l - 1]));
};
dfs(1, n, 0, 0);
cout << ans << endl;
}
int main() {
int t = 1;
cin >> t;
while (t--)
solve();
return 0;
}
I.1000B 贪心 前缀和 模拟 1500:
增加一个开关时间,本质上是改变后边段的奇偶性,前缀和为奇段长度,后缀和为偶段的长度,贪心思维,为了增加开关点后保留最大亮灯时长,也就是保留len-1。找到最大答案即可 O(n)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vllvll;
inline void solve() {
ll n, m;
cin >> n >> m;
vll s(n + 2), per(n + 3), rep(n + 3);
for (int i = 1; i <= n; i++)cin >> s[i];
s[++n] = m;
ll ans = s[1];
for (int i = 2; i + 1 <= n; i += 2)ans += s[i + 1] - s[i];
for (int i = 1; i <= n; i++) {
per[i] = per[i - 1];
if (i % 2)per[i] += s[i] - s[i - 1];
}
for (int i = n - 1; i >= 1; i--) {
rep[i] = rep[i + 1];
if (i % 2)rep[i] += s[i + 1] - s[i];
}
for (int i = 1; i <= n; i++) {
if (!(i % 2))ans = max(ans, per[i] - 1 + rep[i]);
else ans = max(ans, per[i] + rep[i] - 1);
}
cout << ans << endl;
}
int main() {
int t = 1;
//cin >> t;
while (t--)
solve();
return 0;
}