首页 > TAG信息列表 > 1139F
Codeforces 1139F. Dish Shopping
传送门 \(\texttt{Difficulty:2500}\) 题目大意 思路 代码 #include<bits/stdc++.h> #include<unordered_map> #include<unordered_set> using namespace std; using LL = long long; using LD = long double; using ULL = unsigned long long; using PII = pair<