比赛地址
A. AcWing 4719. 商品种类
题意:
每行输入两个字符串,表示一件商品的名称和产地,只有名称和产地都相同,才视为同一件商品,求有多少件不同的商品(输入的字符串只包含小写字母)
思路:
将 s1 s2 中间用一个数字进行拼接,用 unordered_set 存入即可
AC代码:
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define int long long
#define div() cout << "-----------------------------" << endl
#define deb(n) cout<< #n << " = " << n <<endl
typedef pair<int, int> PII;
typedef pair<string, int> PSI;
typedef pair<string, string> PSS;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
const int N = 2e5 + 5, INF = 0x3f3f3f3f;
int n, k;
int a[N];
signed main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
unordered_set<string> se;
int n;
cin >> n;
for (int i = 0; i < n; i ++)
{
string s1, s2;
cin >> s1 >> s2;
string s = s1 + "0" + s2;
se.insert(s);
}
cout << se.size() << endl;
return 0;
}
B. AcWing 4720. 字符串
题意:
将一个字符串中两个连续的相同字母删除,删除后若出现新的连续相同字母则继续删除
思路:
维护一个栈每次判断下一个字符是否与栈顶相同,字符串的 pop_back() 函数可以当做栈使用
AC代码:
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
// #define int long long
#define div() cout << "-----------------------------" << endl
#define deb(n) cout<< #n << " = " << n <<endl
typedef pair<int, int> PII;
typedef pair<string, int> PSI;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
const int N = 2e5 + 5, INF = 0x3f3f3f3f;
int n, k;
int main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
string s;
cin >> s;
string ans = "";
for (auto item : s)
if (ans.size() && item == ans.back()) ans.pop_back();
else ans += item;
cout << ans << endl;
return 0;
}
C. AcWing 4721. 排队
题意:
给定 n 个小朋友的升高,对于某个小朋友,求右边离他最远的比他矮的人的下标,若没有则是 -1
思路:
从后往前遍历,维护一个单调栈,每次只放入比栈顶小的元素,对于每个小朋友利用二分进行查找
AC代码:
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define int long long
#define div() cout << "-----------------------------" << endl
#define deb(n) cout<< #n << " = " << n <<endl
typedef pair<int, int> PII;
typedef pair<string, int> PSI;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
const int N = 2e5 + 5, INF = 0x3f3f3f3f;
int n, k;
int a[N];
int stk[N];
int ans[N];
signed main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i ++) cin >> a[i];
int top = 0;
for (int i = n - 1; i >= 0; i --)
{
if (!top || a[i] <= a[stk[top]]) ans[i] = -1;
else
{
int l = 1, r = top;
while (l < r)
{
int mid = l + r >> 1;
if (a[stk[mid]] < a[i]) r = mid;
else l = mid + 1;
}
ans[i] = stk[r] - i - 1;
}
if (!top || a[i] < a[stk[top]]) stk[++ top] = i;
}
for (int i = 0; i < n; i ++) cout << ans[i] << ' ';
return 0;
}