总结
最后排名35名,可惜还是慢了点。第二题忘取模了,第三题忘判-1了,我是傻逼。感觉难度比较简单的一次。
4419. 上车
第一题直接判断+2会不会超就可以了
// shiran
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, n, a) for (int i = n - 1; i >= a; i--)
#define sz(x) (int)size(x)
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define pb push_back
#define mk make_mair
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 1e9+7;
const int N = 200010, M = 300010;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int ans = 0, n;
cin >> n;
rep(i, 0, n)
{
int x, y;
cin >> x >> y;
if (x + 2 <= y)
ans ++ ;
}
cout << ans << endl;
return 0;
}
4420. 连通分量
看上去有点吓人,其实意思也很简单,只需要维护每一个连通分量的区块个数,加上中心方格就是答案。这里我们要判断不同连通分量之间差异,那么我们可以搞一个数组存一下,判断一下即可
// shiran
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, n, a) for (int i = n - 1; i >= a; i--)
#define sz(x) (int)size(x)
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define pb push_back
#define mk make_mair
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 1e9+7;
const int N = 1010, M = 1e6+10;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
int n, m, k = 0;
char g[N][N];
int d[N][N], f[N][N];
int sum[M];
void dfs(int x, int y, int k)
{
d[x][y] = k;
g[x][y] = ',';
rep(i, 0, 4)
{
int tx = x + dx[i], ty = y + dy[i];
if (tx < 0 || tx >= n || ty < 0 || ty >= m) continue;
if (g[tx][ty] != '.') continue;
dfs(tx, ty, k);
}
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
rep(i, 0, n) cin >> g[i];
rep(i, 0, n)
{
rep(j, 0, m)
{
if (g[i][j] == '.')
{
++ k;
dfs(i, j, k);
}
}
}
rep(i, 0, n)
{
rep(j, 0, m)
{
sum[d[i][j]] ++ ;
}
}
rep(i, 0, n)
{
rep(j, 0, m)
{
if (d[i][j])
f[i][j] = sum[d[i][j]];
}
}
rep(i, 0, n)
{
rep(j, 0, m)
{
if (g[i][j] == ',') cout << '.';
else
{
int cnt = 0;
set<int> S;
rep(c, 0, 4)
{
int x = i + dx[c], y = j + dy[c];
if (x >= 0 && x < n && y >= 0 && y < m)
{
if (!S.count(d[x][y]))
{
S.insert(d[x][y]);
cnt += f[x][y];
}
}
}
cout << (cnt + 1) % 10;
}
}
cout << endl;
}
return 0;
}
4421. 信号
第三题个人认为是一个比较暴力的题目,考察点可能是贪心,也许可以DP?直接选受益最大的点,受益最大意思就是能远最好远的点,这样可以覆盖的点会更多从前往后递推。
// shiran
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, n, a) for (int i = n - 1; i >= a; i--)
#define sz(x) (int)size(x)
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define pb push_back
#define mk make_mair
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 1e9+7;
const int N = 1010, M = 300010;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
int n, m;
int a[N];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int cnt = 0;
cin >> n >> m;
rep(i, 1, n + 1) cin >> a[i];
int last = 1;
while (last <= n)
{
bool flag = false;
per(j, min(last + m, n + 1), max(1, last - m + 1))
{
if (a[j])
{
flag = true;
last = j + m;
cnt ++ ;
break;
}
}
if (!flag)
{
puts("-1");
return 0;
}
}
cout << cnt << endl;
return 0;
}