Codeforces Round #368 (Div 2) A,B,C,D,E
来源:互联网 发布:php的意思 编辑:程序博客网 时间:2024/05/16 09:22
比赛题目链接
A、Brain’s Photos
给一个
暴力判断,时间复杂度:
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <climits>#include <cmath>#include <ctime>#include <cassert>#define IOS ios_base::sync_with_stdio(0); cin.tie(0);using namespace std;typedef long long ll;const int MAX_N = 110;int n, m;int main(){ while (~scanf("%d%d", &n, &m)) { int flag = 0; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { char s[5]; scanf("%s", s); if (s[0] == 'C' || s[0] == 'M' || s[0] == 'Y'){ flag = 1; } } } if (flag) printf("#Color\n"); else printf("#Black&White\n"); } return 0;}
B、Bakery
给
如果存在最短距离的话,一定是一条边的两个端点,只要判断是否存在这样的边然后取最短即可。
也可以不用先
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <climits>#include <cmath>#include <ctime>#include <cassert>#define IOS ios_base::sync_with_stdio(0); cin.tie(0);using namespace std;typedef long long ll;const int MAX_N = 100010;int n, m, k;int vis[MAX_N];struct Edge { int u, v, w; bool operator < (const Edge& rhs) const { return w < rhs.w; }} edge[MAX_N];int main(){ while (~scanf("%d%d%d", &n, &m, &k)) { memset(vis, 0, sizeof(vis)); for (int i = 0; i < m; ++i) { int u, v, w; scanf("%d%d%d", &u, &v, &w); edge[i].u = u, edge[i].v = v; edge[i].w = w; } sort(edge, edge + m); for (int i = 0; i < k; ++i) { int u; scanf("%d", &u); vis[u] = 1; } int ans = -1; for (int i = 0; i < m; ++i) { int u = edge[i].u, v = edge[i].v, w = edge[i].w; if (vis[u] && !vis[v]) ans = w; if (vis[v] && !vis[u]) ans = w; if (ans != -1) break; } printf("%d\n", ans); } return 0;}
C、Pythagorean Triples
给一个
当
当
当
当
时间复杂度:
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <climits>#include <cmath>#include <ctime>#include <cassert>#define IOS ios_base::sync_with_stdio(0); cin.tie(0);using namespace std;typedef long long ll;int n;ll m;void solve(){ m = 1ll * n * n; if (n == 1 || n == 2) printf("-1\n"); else if (m % 4 == 0) printf("%I64d %I64d\n", m / 4 - 1, m / 4 + 1); else if (m & 1) printf("%I64d %I64d\n", (m - 1) / 2, (m - 1) / 2 + 1);}int main(){ while (~scanf("%d", &n)) { solve(); } return 0;}
D、Persistent Bookcase
给一个
1 i j :如果第i 排的第j 个位置是空的,就放一本书上去。2 i j :如果第i 排的第j 个位置上有书,那就把这本书取下来。3 i :将第i 排的所有位置状态颠倒:有书的位置把书取下,没书的位置放上书。4 i :回到第i 个操作时的状态,初始状态是第0 操作。
对于每次操作输出书架上书的总数量。
数据范围:
最基本的for循环就是最简单、最显式的dfs
如果没有第四种操作,直接按照题意for循环下去即可。对于第四种操作可以记录每个操作的儿子(后继操作),然后dfs下去并还原即可,注意细节。
借助
时间复杂度:
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <climits>#include <cmath>#include <ctime>#include <cassert>#include <vector>#include <set>#define IOS ios_base::sync_with_stdio(0); cin.tie(0);using namespace std;typedef long long ll;const int MAX_Q = 100010;const int MAX_N = 1010;int n, m, Q;vector<int> children[MAX_Q];set<int> s[MAX_N];int cnt[MAX_N];struct Query { int type, x, y, ans;} query[MAX_Q];void init(){ for (int i = 0; i <= n; ++i) { children[i].clear(); s[i].clear(); cnt[i] = 0; }}// cnt[x] 为奇:s[x]是不存在的;cnt[x]为偶:s[x]是存在的void dfs(int cur, int sum){ int type = query[cur].type, x = query[cur].x, y = query[cur].y, flag = 0; if (type == 1) { if (cnt[x] % 2 == 0 && s[x].find(y) == s[x].end()) { s[x].insert(y); sum++; flag = 1; } else if (cnt[x] % 2 && s[x].find(y) != s[x].end()) { s[x].erase(y); sum++; flag = 1; } } else if (type == 2) { if (cnt[x] % 2 == 0 && s[x].find(y) != s[x].end()) { s[x].erase(y); sum--; flag = 1; } else if (cnt[x] % 2 && s[x].find(y) == s[x].end()) { s[x].insert(y); sum--; flag = 1; } } else if (type == 3) { if (cnt[x] % 2 == 0) { sum -= s[x].size(); sum += (m - s[x].size()); } else { sum -= (m - s[x].size()); sum += s[x].size(); } cnt[x]++; flag = 1; }// printf("cur = %d x = %d y = %d sum = %d\n", cur, x, y, sum); query[cur].ans = sum; for (int i = 0; i < children[cur].size(); ++i) { dfs(children[cur][i], sum); } if (flag) { if (type == 1) { if (cnt[x] % 2 == 0) s[x].erase(y); else s[x].insert(y); sum--; } else if (type == 2) { if (cnt[x] % 2 == 0) s[x].insert(y); else s[x].erase(y); sum++; } else { // type = 3 if (cnt[x] % 2 == 0) { sum -= s[x].size(); sum += (m - s[x].size()); } else { sum -= (m - s[x].size()); sum += s[x].size(); } cnt[x]--; } }}int main(){ while (~scanf("%d%d%d", &n, &m, &Q)) { init(); for (int i = 1; i <= Q; ++i) { query[i].y = -1; scanf("%d%d", &query[i].type, &query[i].x); if (query[i].type < 3) { scanf("%d", &query[i].y); } if (query[i].type == 4) { children[query[i].x].push_back(i); } else { children[i - 1].push_back(i); } } for (int i = 0; i < children[0].size(); ++i) { dfs(children[0][i], 0); } for (int i = 1; i <= Q; ++i) { printf("%d\n", query[i].ans); } } return 0;}
E、Garlands
给一个
- 改变第
i 个花环:开变关,关变开 - 求左上角下标为
(a,b) ,右下角下标为(c,d) 的矩形内所有开着的花的价值之和。
对于每个第二种操作,输出相应价值和。
数据范围:
这也太暴力了。
直接上二维树状数组,对于每种花环的状态记录类似于
时间复杂度:
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <climits>#include <cmath>#include <ctime>#include <cassert>#define IOS ios_base::sync_with_stdio(0); cin.tie(0);using namespace std;typedef long long ll;const int MAX_N = 2010;int n, m, K, Q;int num[MAX_N], cur[MAX_N], state[MAX_N];ll C[MAX_N][MAX_N];struct Garland { int x, y, w;} garland[MAX_N][MAX_N];inline int lowbit(int x){ return x & (-x);}void update(int x, int y, int w){ for(int i = x; i <= n; i += lowbit(i)) { for (int j = y; j <= m; j += (lowbit(j))) { C[i][j] += w; } }}ll sum(int x, int y){ ll res = 0; for (int i = x; i > 0; i -= lowbit(i)) { for (int j = y; j > 0; j -= lowbit(j)) { res += C[i][j]; } } return res;}int main(){ while (~scanf("%d%d%d", &n, &m, &K)) { memset(state, 0, sizeof(state)); memset(cur, 0, sizeof(cur)); memset(C, 0, sizeof(C)); for (int i = 0; i < K; ++i) { scanf("%d", &num[i]); for (int j = 0; j < num[i]; ++j) { int x, y, w; scanf("%d%d%d", &x, &y, &w); garland[i][j].x = x, garland[i][j].y = y, garland[i][j].w = w; update(x, y, w); } } scanf("%d", &Q); for (int i = 0; i < Q; ++i) { char s[10]; scanf("%s", s); if (s[0] == 'S') { int id; scanf("%d", &id); id--; state[id] ^= 1; // 细节! cur[id] ^= 1; } else { int a, b, c, d; scanf("%d%d%d%d", &a, &b, &c, &d); for (int i = 0; i < K; ++i) { if (state[i] == 0) continue; int flag = 1; if (cur[i] == 1) flag = -1; state[i] = 0; for (int j = 0; j < num[i]; ++j) { int x = garland[i][j].x, y = garland[i][j].y, w = garland[i][j].w; update(x, y, flag * w); } } ll ans = sum(c, d) + sum(a - 1, b - 1) - sum(c, b - 1) - sum(a - 1, d); printf("%lld\n", ans); } } } return 0;}
- Codeforces Round #368 (Div 2) A,B,C,D,E
- Codeforces Round #186 (Div. 2)A、B、C、D、E
- Codeforces Round #258 (Div. 2)-(A,B,C,D,E)
- Codeforces Round #261 (Div. 2) A,B,C,D,E
- Codeforces Round #263 (Div. 2) A,B,C,D,E
- Codeforces Round #264 (Div. 2) A,B,C,D,E
- Codeforces Round #277 (Div. 2) A,B,C,D,E
- Codeforces Round #280 (Div. 2 A,B,C,D,E)
- Codeforces Round #287 (Div. 2) A、B、C、D、E
- Codeforces Round #287 (Div. 2)A,B,C,D,E
- Codeforces Round #288 (Div. 2) A,B,C,D,E
- Codeforces Round #293 (Div. 2) (A B C D E)
- Codeforces Round #308 (Div. 2) A B C D E
- Codeforces Round #312 (Div. 2) A B C D E
- Codeforces Round #311 (Div. 2) A,B,C,D,E
- Codeforces Round #320 (Div. 2) A B C D E
- Codeforces Round #330 (Div. 2)(A,B,C,D,E)
- Codeforces Round #346 (Div. 2) A B C D E
- 曼彻斯特码编解码原理以及Verilog实现
- ubuntu16。04安裝谷歌等中文輸入法
- Jq通过td获取同行其它列td
- Android学习
- 如果用 Maven添加本地项目里的jar ?
- Codeforces Round #368 (Div 2) A,B,C,D,E
- PHP判断访客是否是手机端(移动端浏览器)访问的4种方法
- iOS_pch文件
- 20160723------JAVA初体验
- 概率图模型(06): 概率图双重对偶视角 || 马尔可夫网 & 条件随机场及应用
- CodeForces 691C
- Linux下SQLite3的移植与使用
- State模式
- "INFO metrics.MetricsUtil: Unable to obtain hostName"