A Blog

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>using namespace std;#define maxp 140000struct Stone{ int x, y;}stone[maxp];int n, m, p;int ans;bool vis[maxp];bool operator < (const Stone &a, const Stone &am 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;string st;string g[100] ={ "ffi", "ffl", "ff", "fl", "fi", "''", "``", "'", &qu 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 15int n, m;char map[maxn][maxn];int vis[5];int dir[4][2] ={{ 0, 1 },{ 1, 0 },{ 1, 1 },{ 1, -1 } };void input(){ scanf("%d%d", &n, &m); for ( 阅读全文

摘要： 简单题注意电梯间在每层的first place。而且电梯和传送带不会同时工作以节约时间。二者只能一个动完另一个动View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 55struct Car{ int x, y;}car[maxn * maxn];int n, m, tot;int pos[maxn];void input(){ scanf("%d%d" 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 200char st[maxn], up[maxn], down[maxn];int main(){ //freopen("t.txt", "r", stdin); int t; scanf("%d", &t); while (t--) { sca 阅读全文