Round 1A 2020 - Code Jam 2020
Problem A. Pattern Matching
把每个字符串分成第一个之前，最后一个之后，中间的部分 三个部分
每个字符串的中间的部分可以直接拼接
前后两个部分需要判断下是否合法
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define MP make_pair
#define ll long long
#define ld long double
#define null NULL
#define all(a) a.begin(), a.last()
#define forn(i, n) for (int i = 0; i < n; ++i)
#define sz(a) (int)a.size()
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
#define bitCount(a) __builtin_popcount(a)
template<class T> int gmax(T &a, T b) { if (b > a) { a = b; return 1; } return 0; }
template<class T> int gmin(T &a, T b) { if (b < a) { a = b; return 1; } return 0; }
using namespace std;
const int INF = 0x3f3f3f3f;
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string) s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; }
template <typename A>
string to_string(A v) { bool first = true; string res = "{"; for (const auto &x : v) { if (!first) { res += ", "; } first = false; res += to_string(x); } res += "}"; return res; }
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << " " << to_string(H); debug_out(T...); }
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
char seq[55][105];
int main() {
int T;
scanf("%d", &T);
for(int cas = 1; cas <= T; ++cas) {
int n;
scanf("%d", &n);
for(int i = 0; i < n; ++i) {
scanf("%s", seq[i]);
}
vector<string> front, last;
string mid_result;
for(int i = 0; i < n; ++i) {
int len = strlen(seq[i]);
vector<string> split;
string tmp;
if(seq[i][0] == '*') split.push_back("");
for(int j = 0; j < len; ++j) {
// cout << seq[i][j] << endl;
if(seq[i][j] == '*') {
if((int)tmp.size() != 0) split.push_back(tmp);
tmp.clear();
} else tmp += seq[i][j];
}
if((int)tmp.size() != 0) split.push_back(tmp);
// debug(split);
if(seq[i][len - 1] == '*') split.push_back("");
front.push_back(split[0]); last.push_back(split.back());
if(split.size() > 2) {
for(int j = 1, split_len = split.size(); j < split_len - 1; ++j) {
mid_result += split[j];
}
}
}
auto cmp = [](string &A, string &B) { return A.size() < B.size(); };
sort(front.begin(), front.end(), cmp);
sort(last.begin(), last.end(), cmp);
// debug(front, last, mid_result);
bool suc = true;
for(int i = 0, len = front.size(); i < len - 1 && suc; ++i) {
string &now = front[i]; string &tem = front.back();
for(int j = 0, len_now = now.size(); j < len_now && suc; ++j) {
if(now[j] != tem[j]) { suc = false; }
}
}
// debug(suc);
for(int i = 0, len = last.size(); i < len - 1 && suc; ++i) {
string &now = last[i]; string &tem = last.back(); int len_tem = tem.size();
for(int j = 0, len_now = now.size(); j < len_now && suc; ++j) {
if(now[j] != tem[len_tem + j - len_now]) {
// debug(now, tem, j);
suc = false;
}
}
}
string result = front.back() + mid_result + last.back();
printf("Case #%d: ", cas);
if(suc == false) printf("*\n");
else printf("%s\n", result.c_str());
}
return 0;
}
/*
2
5
*CONUTS
*COCONUTS
*OCONUTS
*CONUTS
*S
2
*XZ
*XYZ
*/
problem B. Pascal Walk
这是一个 非常巧妙的构造题
首先想到一个杨辉三角的每一个层的和是 2^i ，如果我们可以跳跃就好了，直接按照N的二进制表示，使用对应层的和
问题在于我们无法跳跃，怎么办
通过构造可以发现我们可以将两个很远的两层连在一起，下面举例5，19的情况，具体的逻辑可以去代码里面体会
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define MP make_pair
#define ll long long
#define ld long double
#define null NULL
#define all(a) a.begin(), a.last()
#define forn(i, n) for (int i = 0; i < n; ++i)
#define sz(a) (int)a.size()
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
#define bitCount(a) __builtin_popcount(a)
template<class T> int gmax(T &a, T b) { if (b > a) { a = b; return 1; } return 0; }
template<class T> int gmin(T &a, T b) { if (b < a) { a = b; return 1; } return 0; }
using namespace std;
const int INF = 0x3f3f3f3f;
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string) s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; }
template <typename A>
string to_string(A v) { bool first = true; string res = "{"; for (const auto &x : v) { if (!first) { res += ", "; } first = false; res += to_string(x); } res += "}"; return res; }
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << " " << to_string(H); debug_out(T...); }
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
void add(vector<pair<int, int> >& vc, int pre, int target, int times) {
// debug(pre, target, vc);
int dir = 0;
if( times % 2 == 0) dir = 0; else dir = 1;
int preX = -1, preY = 0;
if(vc.size() != 0) {
preX = vc.back().first; preY = vc.back().second;
}
int needFloor = target - pre - 1;
if(needFloor == 0) {
vc.push_back(dir ? MP(preX + 1, preY + 1) : MP(preX + 1, preY));
for(int i = 0; i < target; ++i) {
vc.push_back(dir ? MP(vc.back().first, vc.back().second - 1) : MP(vc.back().first, vc.back().second + 1));
}
} else {
vc.push_back(dir ? MP(preX + 1, preY + 1) : MP(preX + 1, preY));
int count = 2;
for(int i = 0; i < needFloor - 1; ++i) {
int tmp_count = count - 1; int now_dir = (i & 1) ^ (needFloor & 1) ^ dir;
vc.push_back(now_dir ? MP(vc.back().first + 1, vc.back().second + 1) : MP(vc.back().first + 1, vc.back().second));
while(tmp_count --) {
vc.push_back(now_dir ? MP(vc.back().first, vc.back().second - 1) : MP(vc.back().first, vc.back().second + 1));
}
count ++;
}
vc.push_back(dir ? MP(vc.back().first + 1, vc.back().second) : MP(vc.back().first + 1, vc.back().second + 1));
for(int i = 0; i < target - count + 1; ++i) {
vc.push_back(dir ? MP(vc.back().first, vc.back().second - 1) : MP(vc.back().first, vc.back().second + 1));
}
}
}
int main() {
int T;
scanf("%d", &T);
for(int cas = 1; cas <= T; ++cas) {
int n;
scanf("%d", &n);
vector<pair<int, int> > vc;
int floor = -1; int cnt = 0; int times = 0;
while(n) {
if(n & 1) {
add(vc, floor, cnt, times);
times ++;
floor = cnt;
}
cnt ++;
n /= 2;
}
assert((int)vc.size() < 500);
printf("Case #%d: \n", cas);
for(int i = 0, len = vc.size(); i < len; ++i) {
printf("%d %d\n", vc[i].first + 1, vc[i].second + 1);
}
}
return 0;
}
Problem C: Square Dance
这题看起来就是暴力，能过小数据
有个显而易见的优化，就是每次删除一个点之后，下一轮潜在的可能删除点一定是上轮被删点的邻居
复杂度不太会算，题解说这样优化后能到O(R * C)
找邻居这种数据结构 我用十字链表维护的
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define MP make_pair
#define ll long long
#define ld long double
#define null NULL
#define all(a) a.begin(), a.last()
#define forn(i, n) for (int i = 0; i < n; ++i)
#define sz(a) (int)a.size()
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
#define bitCount(a) __builtin_popcount(a)
template<class T> int gmax(T &a, T b) { if (b > a) { a = b; return 1; } return 0; }
template<class T> int gmin(T &a, T b) { if (b < a) { a = b; return 1; } return 0; }
using namespace std;
const int INF = 0x3f3f3f3f;
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string) s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; }
template <typename A>
string to_string(A v) { bool first = true; string res = "{"; for (const auto &x : v) { if (!first) { res += ", "; } first = false; res += to_string(x); } res += "}"; return res; }
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << " " << to_string(H); debug_out(T...); }
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
struct Node{
int u, d, l, r;
int val;
Node() {
u = d = l = r = -1; val = 0;
}
};
vector<Node> mp;
int R, C;
int getId(int x, int y) { return x * (C + 2) + y; }
void erase(int x) {
mp[mp[x].l].r = mp[x].r;
mp[mp[x].r].l = mp[x].l;
mp[mp[x].u].d = mp[x].d;
mp[mp[x].d].u = mp[x].u;
mp[x].val = 0;
}
vector<int> update(vector<int> &choosList, ll &ans, ll &origin) {
// debug(origin);
vector<int> needErase;
vector<int> newList, _newList;
ans += origin;
for(int i = 0, len = choosList.size(); i < len; ++i) {
int x = choosList[i];
int neiNum = 0; int neiVal = 0;
if(mp[mp[x].r].val != 0) { neiNum ++; neiVal += mp[mp[x].r].val; }
if(mp[mp[x].l].val != 0) { neiNum ++; neiVal += mp[mp[x].l].val; }
if(mp[mp[x].u].val != 0) { neiNum ++; neiVal += mp[mp[x].u].val; }
if(mp[mp[x].d].val != 0) { neiNum ++; neiVal += mp[mp[x].d].val; }
// debug(x / (C + 2), x % (C + 2), neiVal, neiNum, mp[x].val);
if(neiVal > mp[x].val * neiNum) {
// debug("erase", x / (C + 2), x % (C + 2));
origin -= mp[x].val;
needErase.push_back(x);
}
}
for(auto x : needErase) {
assert(mp[x].r != -1); assert(mp[x].l != -1); assert(mp[x].u != -1); assert(mp[x].d != -1);
if(mp[mp[x].r].val != 0) { _newList.push_back(mp[x].r); }
if(mp[mp[x].l].val != 0) { _newList.push_back(mp[x].l); }
if(mp[mp[x].u].val != 0) { _newList.push_back(mp[x].u); }
if(mp[mp[x].d].val != 0) { _newList.push_back(mp[x].d); }
erase(x);
}
for(auto it : _newList) {
if(mp[it].val != 0) newList.push_back(it);
}
sort(newList.begin(), newList.end());
newList.erase(unique(newList.begin(), newList.end()), newList.end());
// for(int i = 0, len = newList.size(); i < len; ++i) printf("%d %d: ", newList[i] / (C + 2), newList[i] % (C + 2)); printf("\n");
return newList;
}
int main() {
int T;
scanf("%d", &T);
for(int cas = 1; cas <= T; ++cas) {
mp.clear();
scanf("%d %d", &R, &C);
mp.resize( (R + 5) * (C + 5), Node());
ll origin = 0;
for(int i = 1; i <= R; ++i) {
for(int j = 1; j <= C; ++j) {
scanf("%d", &mp[getId(i , j)].val);
origin += mp[getId(i , j)].val;
}
}
for(int i = 1; i <= R; ++i) {
mp[getId(i , 1)].l = getId(i, 0);
for(int j = 1; j <= C; ++j) {
mp[getId(i , j - 1)].r = getId(i, j);
mp[getId(i , j + 1)].l = getId(i, j);
}
mp[getId(i , C)].r = getId(i, C + 1);
}
for(int i = 1; i <= C; ++i) {
mp[getId(1 , i)].u = getId(0, i);
for(int j = 1; j <= R; ++j) {
mp[getId(j - 1, i)].d = getId(j, i);
mp[getId(j + 1, i)].u = getId(j, i);
}
mp[getId(R, i)].d = getId(R + 1, i);
}
vector<int> choosList;
for(int i = 1; i <= R; ++i) {
for(int j = 1; j <= C; ++j) {
choosList.push_back(getId(i, j));
}
}
ll ans = 0;
while(1) {
choosList = update(choosList, ans, origin);
if(choosList.size() == 0) break;
}
printf("Case #%d: %lld\n", cas, ans);
}
return 0;
}
/*
4
1 1
15
3 3
1 1 1
1 2 1
1 1 1
1 3
3 1 2
1 3
1 2 3
3 3
1 100 1
1 2 2
1000 1 1
1 3
1 1
*/
Round 1A 2020 - Code Jam 2020的更多相关文章
- Google Code Jam 2020 Round1B Expogo
题意 你初始位于\((0,0)\),然后你想要到\((x,y)\)去,第\(i\)步的步长是\(2^{i-1}\),要求用最少的步数走到\((x,y)\). 解题思路 首先可以推出,走\(i\)步可以 ...
- Google Code Jam 2020 Round1B Join the Ranks
题意 给你一个形如\(1,2,\cdots,R,1,2,\cdots,R,1\cdots\)的序列,共重复\(C\)次.你每次可以选择一个区间\([L,R]\)将其平移到序列首部,最终使得序列具有\( ...
- Google Code Jam 2020 Round1B Blindfolded Bullseye
总结 这一题是道交互题,平时写的不多,没啥调试经验,GYM上遇到了少说交个十几发.一开始很快的想出了恰烂分的方法,但是没有着急写,果然很快就又把Test Set3的方法想到了,但是想到归想到,调了快一 ...
- [C++]Store Credit——Google Code Jam Qualification Round Africa 2010
Google Code Jam Qualification Round Africa 2010 的第一题,很简单. Problem You receive a credit C at a local ...
- Google Code Jam Africa 2010 Qualification Round Problem B. Reverse Words
Google Code Jam Africa 2010 Qualification Round Problem B. Reverse Words https://code.google.com/cod ...
- Google Code Jam Africa 2010 Qualification Round Problem A. Store Credit
Google Code Jam Qualification Round Africa 2010 Problem A. Store Credit https://code.google.com/code ...
- Google Code Jam 2010 Round 1C Problem A. Rope Intranet
Google Code Jam 2010 Round 1C Problem A. Rope Intranet https://code.google.com/codejam/contest/61910 ...
- ural 2020 Traffic Jam in Flower Town（模拟）
2020. Traffic Jam in Flower Town Time limit: 1.0 secondMemory limit: 64 MB Having returned from Sun ...
- Google Code Jam 2010 Round 1C Problem B. Load Testing
https://code.google.com/codejam/contest/619102/dashboard#s=p1&a=1 Problem Now that you have won ...
随机推荐
- Community Cloud零基础学习（四）Builder创建自定义的布局
前几篇讲了Community Cloud权限配置等信息,但是没有太讲过 Community如何进行配置layout,本篇主要描述使用Builder去进行符合需求的Community Layout的构建 ...
- vue之冒泡阻止
用了Element ui写页面 <el-dropdown-menu slot="dropdown"> <el-dropdown-item> <el-s ...
- （转）协议森林09 爱的传声筒 (TCP连接)
协议森林09 爱的传声筒 (TCP连接) 作者:Vamei 出处:http://www.cnblogs.com/vamei 欢迎转载,也请保留这段声明.谢谢! 在TCP协议与"流" ...
- 三、create-react-app新旧版中使用less和antd并修改主题颜色
引入less 如果项目根目录中没有config文件夹,首先暴露出项目配置文件,项目下执行: npm run eject 如果项目是从git仓库中pull下来的的话,必须确保本地项目与仓库中没有冲突,才 ...
- CF57C Array
题目传送门 题目大意(摘自洛谷) 描述 对于长度为n的数组A,A中只包含从1到n的整数(可重复).如果A单调不上升或单调不下降,A就可称为美丽的. 找出在长度为n时,有几个美丽的A. 输入 一个整数n ...
- 程序员找工作必备 PHP 基础面试题
1.优化 MYSQL 数据库的方法 (1) 选取最适用的字段属性,尽可能减少定义字段长度,尽量把字段设置 NOT NULL, 例如’省份,性别’, 最好设置为 ENUM (2) 使用连接(JOIN)来 ...
- JDK14的新特性-Switch新功能
2020年3月17日,Oracle正式发布了JDK14版本,共新增了16项新特性 本文重点写一下关于switch的新功能: switch 表达式扩展了 switch 语句,使其不仅可以作为语句(sta ...
- LeetCode45——从搜索算法推导到贪心
本文始发于个人公众号:TechFlow,原创不易,求个关注 今天是LeetCode系列的第25篇文章,今天我们一起来看的是LeetCode的第45题,Jump Game II. 有同学后台留言问我说, ...
- command > /dev/null command > /dev/null 2>&1nohup command &> /dev/null的区别
1.对以下命令进行依次区分 command 执行一条普通的命令 command > /dev/null '>'表示将标准输出重定向 '>>'表示追加,/dev/null是一 ...
- Nuget多项目批量打包上传服务器的简明教程
本篇不会介绍Nuget是什么,如何打包上传Nuget包,怎么搭建私有Nuget服务器.这些问题园子里都有相应的文章分享,这里不做过多阐述.另外本文假设你已经下载了Nuget.exe,并且已经设置好了环 ...