A Bazoka and Mocha's Array
问题:
思路:可以想象原数组为一个环,如果在环中可以找到不降序列,则满足题意
代码:
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 55;
int n;
int a[2 * N];
void solve() {
cin >> n;
for(int i = 1; i <= n; i ++ ) cin >> a[i];
for(int i = n + 1; i <= 2 * n; i ++ ) a[i] = a[i - n];
bool flag = false;
for(int i = 1; i <= 2 * n - n + 1; i ++ ) {
int start = i, end = i + n - 1;
vector<int> b, c;
for(int j = start; j <= end; j ++ ) {
b.push_back(a[j]);
}
c = b;
sort(c.begin(), c.end());
if(c == b) flag = true;
}
if(flag) cout << "Yes" << endl;
else cout << "No" << endl;
}
int main() {
int t;
cin >> t;
while(t -- ) {
solve();
}
return 0;
}
B 378QAQ and Mocha's Array
问题:
思路:sort一下数组去重,最小的元素肯定是答案之一,紧接着遍历数组,碰见第一个不能被最小数整除的将其加入答案集合,若碰见第三个不能被当前答案集合中任意一个数整除的数,则数组不合法
代码:
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int N = 1e5 + 10;
int n;
int a[N];
void solve() {
cin >> n;
for(int i = 1; i <= n; i ++ ) cin >> a[i];
sort(a + 1, a + 1 + n);
int cnt = 1;
vector<int> di;
di.push_back(a[1]);
for(int i = 2; i <= n; i ++ ) {
bool flag = false;
for(auto t: di) {
if(!(a[i] % t)) flag = true;
}
if(!flag) {
di.push_back(a[i]);
cnt ++;
if(cnt > 2) {
cout << "NO" << endl;
return;
}
}
}
cout << "YES" << endl;
}
int main() {
int t;
cin >> t;
while(t -- ) {
solve();
}
return 0;
}
C Chamo and Mocha's Array
问题:
思路:任取数组中连续三个元素,根据定义,这三个元素最后会被变成这三个元素中的中位数a。则此时存在两个连续的a。顺着连续的a向左右两侧,每次选择两个a以及相邻的一个元素进行操作,最终数组都会变成a。因此最后的答案是所有连续三元组中的中位数的最大值。注意,当n=2时没有三元组,此时答案为两个数中的较小值
代码:
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 1e5 + 10;
int n;
int a[N];
void solve() {
cin >> n;
for(int i = 1; i <= n; i ++ ) cin >> a[i];
int maxv = 0;
for(int i = 2; i <= n - 1; i ++ ) {
vector<int> b;
for(int j = i - 1; j <= i + 1; j ++ ) {
b.push_back(a[j]);
}
sort(b.begin(), b.end());
maxv = max(maxv, b[1]);
}
for(int i = 2; i <= n; i ++ ) {
maxv = max(min(a[i], a[i - 1]), maxv);
}
if(maxv == 0) maxv = min(a[1], a[2]);
cout << maxv << endl;
}
int main() {
int t;
cin >> t;
while(t -- ) {
solve();
}
return 0;
}
D paint the tree
问题:
思路:
有结论后,题目就变成了对树的基本操作..
代码:
#include <iostream>
#include <cstring>
#include <queue>
using namespace std;
const int N = 2e5 + 10;
int n, a, b, root, depth;
int val[N << 1], ne[N << 1], h[N], idx, dist[N], dist1[N];
int fa[N], dep[N];
void add(int a, int b) {
val[idx] = b;
ne[idx] = h[a];
h[a] = idx ++;
}
int bfs() {
dist[a] = 0;
queue<int> q;
q.push(a);
while(q.size()) {
int t = q.front();
q.pop();
for(int i = h[t]; i != -1; i = ne[i]) {
int j = val[i];
if(dist[j] == -1) {
dist[j] = dist[t] + 1;
q.push(j);
fa[j] = t;
}
}
}
return dist[b];
}
void bfs1() {
queue<int> q;
q.push(root);
dist1[root] = 0;
while(q.size()) {
int t = q.front();
q.pop();
for(int i = h[t]; i != -1; i = ne[i]) {
int j = val[i];
if(dist1[j] == -1) {
dist1[j] = dist1[t] + 1;
depth = max(depth, dist1[j]);
q.push(j);
}
}
}
}
void solve() {
idx = 0;
depth = 0;
memset(h, -1, sizeof h);
memset(dist1, -1, sizeof dist1);
memset(dist, -1, sizeof dist);
cin >> n >> a >> b;
for(int i = 1; i <= n - 1; i ++ ) {
int x, y;
cin >> x >> y;
add(x, y);
add(y, x);
}
int dis = bfs();
int step1 = dis + 1 >> 1;
if(a == b) root = a;
else {
for(int i = 1; i <= dis - step1; i ++ ) {
root = fa[b];
b = fa[b];
}
if(dis & 1) root = fa[b];
}
bfs1();
int ans = 0;
ans = 2 * (n - 1) - depth + step1;
cout << ans << endl;
}
int main() {
int t;
cin >> t;
while(t -- ) {
solve();
}
return 0;
}
这里dfs一直出错,也不知道哪里的问题,抽时间补一下..
E: chain queries
题目:
思路:最开始的思路是找到任意一条黑点所构成最长链的长度是多少,再与黑点总数作比较,不出意外,tle了,代码:
#include <iostream>
#include <cstring>
using namespace std;
const int N = 2e5 + 10;
int n, m, cnt;
bool col[N], flag;
int val[N << 1], ne[N << 1], h[N], idx;
void add(int a, int b) {
val[idx] = b;
ne[idx] = h[a];
h[a] = idx ++;
}
int dfs(int u, int fa) {
int d1 = 0, d2 = 0;
for(int i = h[u]; i != -1; i = ne[i]) {
int j = val[i];
if(j == fa || !col[j]) continue;
int len = dfs(j, u) + 1;
if(len >= d1) {
d2 = d1;
d1 = len;
} else if(len > d2) {
d2 = len;
}
}
cnt = max(cnt, d1 + d2);
return d1;
}
void find(int u, int fa) {
for(int i = h[u]; i != -1; i = ne[i]) {
int j = val[i];
if(j != fa && !flag) {
if(col[j]) {
dfs(j, j);
flag = true;
} else find(j, u);
}
}
}
void solve() {
memset(h, -1, sizeof h);
cin >> n >> m;
int cntb = 0;
int root = 1;
for(int i = 1; i <= n; i ++ ) {
cin >> col[i];
if(col[i]) {
cntb ++;
}
}
for(int i = 1; i <= n - 1; i ++ ) {
int a, b;
cin >> a >> b;
add(a, b);
add(b, a);
}
for(int i = 1; i <= m; i ++ ) {
flag = false;
cnt = 0;
int x;
cin >> x;
col[x] ^= 1;
if(col[x]) cntb ++;
else cntb --;
if(!cntb) cout << "NO" << endl;
else {
find(root, root);
if(cnt < cntb - 1) cout << "NO" << endl;
else if(cnt == cntb - 1) cout << "YES" << endl;
}
}
}
int main() {
int t;
cin >> t;
while(t -- ) {
solve();
}
}
于是开始想如何把m个询问中的dfs给优化掉,暂时没想到怎么优化...
最开始我想的是找出链的一些特性,但是我找出的特性都要遍历一遍该点的临边,也是个o(n * m)的做法,看了答案后发现这个维护是可以在o(1)的时间复杂度之内完成的,答案用了set维护具体看代码:
#include <iostream>
#include <vector>
#include <cstring>
#include <set>
using namespace std;
const int N = 2e5 + 10;
int val[N << 1], ne[N << 1], h[N], col[N], idx;
int n, m;
void add(int a, int b) {
val[idx] = b;
ne[idx] = h[a];
h[a] = idx ++;
}
void dfs(int u, int father, vector<int> &fa, vector<int> &cntofson) {
fa[u] = father;
for(int i = h[u]; i != -1; i = ne[i]) {
int j = val[i];
if(j == father) continue;
if(col[j]) cntofson[u] ++;
dfs(j, u, fa, cntofson);
}
}
void solve() {
memset(h, -1, sizeof h);
cin >> n >> m;
for(int i = 1; i <= n; i ++ ) cin >> col[i];
for(int i = 1; i <= n - 1; i ++ ) {
int a, b;
cin >> a >> b;
add(a, b);
add(b, a);
}
vector<int> fa(n + 1);
vector<int> cntofson(n + 1);
vector<set<int>> cbs(5);
dfs(1, 1, fa, cntofson);
fa[1] = 0;
col[0] = 0;
for(int i = 1; i <= n; i ++ ) {
if(col[i]) cbs[min(3, cntofson[i])].insert(i);
}
for(int i = 1; i <= m; i ++ ) {
int x;
cin >> x;
col[x] ^= 1;
if(col[x]) {//change后变成黑色,以前是白色
cntofson[fa[x]] ++;
cbs[min(3, cntofson[x])].insert(x);
if(col[fa[x]]) {//如果父节点是黑色
if(col[fa[x]]) {
cbs[min(3, cntofson[fa[x]] - 1)].erase(fa[x]);
cbs[min(3, cntofson[fa[x]])].insert(fa[x]);
}
}
} else {//change后变成白色,以前是黑色
cntofson[fa[x]] --;
cbs[min(3, cntofson[x])].erase(x);
if(col[fa[x]]) {
cbs[min(3, cntofson[fa[x]] + 1)].erase(fa[x]);
cbs[min(3, cntofson[fa[x]])].insert(fa[x]);
}
}
if(cbs[3].size() > 0) {
cout << "NO" << endl;
} else if(cbs[0].size() > 2) {
cout << "NO" << endl;
} else if(cbs[0].size() == 1) {
cout << "YES" << endl;
} else if(cbs[0].size() == 2 && cbs[2].size() == 1 && !col[fa[*cbs[2].begin()]]) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
}
int main() {
int t;
cin >> t;
while(t -- ) {
solve();
}
return 0;
}