A
题意:有n条鱼,每条鱼要烤两面,每次可以烤k条鱼,问你最小烤鱼的次数
思路:我这里是有优先队列模拟的过程,因为数据小。
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>
using namespace std;
#define LL long long
#define pb push_back
#define mk make_pair
#define fi first
#define se second
#define pill pair<int, int>
#define mst(a, b) memset(a, b, sizeof a)
#define REP(i, x, n) for(int i = x; i <= n; ++i)
const int MOD = 1e9 + 7;
const int qq = 5e5 + 10;
const LL INF = 1e9 + 10;
priority_queue<int> Q;
int main(){
freopen("Input.txt","r",stdin);
freopen("Output.txt","w",stdout);
int n, k; scanf("%d%d", &n, &k);
for(int i = 1; i <= n; ++i) {
Q.push(2);
}
int ans = 0;
while(1) {
int cnt = 0, cas = 0;
for(int i = 1; i <= k; ++i) {
if(Q.size() == 0) break;
int u = Q.top();
Q.pop();
if(u == 2) cas++;
cnt++;
}
for(int i = 0; i < cas; i++) Q.push(1);
if(cnt == 0) break;
ans++;
}
printf("%d\n", ans);
return 0;
}
B
这题我最初是以为最要让三个rob disk数量相同最少的操作次数进行 这个我退出来是 f(n) = d(n / 3 * 2 - 1) + d(n / 3 - 1) + 1
但题目不是这个题意,是问你在进行原始的汉诺塔的时候三个rob相等时的操作数次数
D
很简单dp
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>
using namespace std;
#define LL long long
#define pb push_back
#define mk make_pair
#define fi first
#define se second
#define pill pair<int, int>
#define mst(a, b) memset(a, b, sizeof a)
#define REP(i, x, n) for(int i = x; i <= n; ++i)
const int MOD = 1e9 + 7;
const int qq = 5e5 + 10;
const LL INF = 1e9 + 10;
LL dp[qq];
char st[qq];
int main(){
freopen("Input.txt","r",stdin);
freopen("Output.txt","w",stdout);
scanf("%s", st + 1);
int len = strlen(st + 1);
dp[0] = 1;
for(int i = 1; i <= len; ++i) {
dp[i] = dp[i - 1];
if(st[i] == 'W') {
if(st[i - 1] == 'N' || st[i - 1] == 'S') {
dp[i] += dp[i - 2];
}
} else if(st[i] == 'E') {
if(st[i - 1] == 'N' || st[i - 1] == 'S') {
dp[i] += dp[i - 2];
}
}
dp[i] %= MOD;
}
printf("%lld\n", dp[len]);
return 0;
}
E
队友写的
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1e5 + 10;
const int MOD = 1e9 + 7;
LL a[N],k,Max=-1,sum=0,ans,bns,cnt;
bool Bin() {
LL l=1,r=1e9;
while(l<=r) {
LL m=(l+r)>>1;
if(ans+m*cnt<=k&&k<=bns+m*sum) return true;
else if(ans+m*cnt>k) {
if(bns+(m-1)*sum<k) return false;
else r=m-1;
}
else if(bns+m*sum<k) {
if(ans+(m+1)*cnt>k) return false;
else l=m+1;
}
}
return false;
}
int main() {
freopen("Input.txt","r",stdin);
freopen("Output.txt","w",stdout);
int n,p;
scanf("%d%lld",&n,&k);
for(int i=1;i<=n;i++) {
scanf("%lld",&a[i]);
Max=max(Max,a[i]);
sum+=a[i];
}
for(int i=1;i<=n;i++)
if(a[i]==Max) p=i;
ans=bns=0;
for(int i=1;i<p;i++) {
ans++;
bns+=a[i];
}
if((k==0&&p==1)||(ans<=k&&k<=bns)) {
puts("YES");
return 0;
}
if(k<ans) {
puts("KEK");
return 0;
}
cnt=n-1+a[p];
bool f=Bin();
puts(f?"YES":"KEK");
return 0;
}
F
题意:有三种重量不一样的球,w,r,b,w最重,b最轻,现在一共有n个球,m个关系,每个关系给出两个球的重量关系 大于 小于或等于,现在问你n个球到底是哪种球,只能确定的输出?
思路:我们很显然可以知道,只有当存在某个这个的关系时 x < y < z此时才能完全确认x y z的种类,所以我们用并查集维护等号,然后重新建图,只有当某个点存在入度和出度的时候我们就可以知道它一定是R,然后乱搞一下就行
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>
using namespace std;
#define LL long long
#define pb push_back
#define mk make_pair
#define fi first
#define se second
#define pill pair<int, int>
#define mst(a, b) memset(a, b, sizeof a)
#define REP(i, x, n) for(int i = x; i <= n; ++i)
const int MOD = 1e9 + 7;
const int qq = 2005 + 10;
const LL INF = 1e9 + 10;
char ans[qq];
int fa[qq];
int n, m;
vector<int> in[qq], out[qq];
vector<int> pr[qq];
struct Edge {
int a, b;
char op;
}edge[qq * qq];
int Find(int x) {
return fa[x] == -1 ? x : fa[x] = Find(fa[x]);
}
int main(){
freopen("Input.txt","r",stdin);
freopen("Output.txt","w",stdout);
scanf("%d%d", &n, &m);
char op;
mst(ans, 0);
mst(fa, -1);
for(int a, b, i = 0; i < m; ++i) {
scanf("%d%c%d", &a, &op, &b);
if(op == '=') {
int x = Find(a), y = Find(b);
if(x != y)
fa[y] = x;
}
edge[i].a = a, edge[i].b = b, edge[i].op = op;
}
for(int a, b, i = 0; i < m; ++i) {
a = Find(edge[i].a), b = Find(edge[i].b), op = edge[i].op;
if(op == '=') continue;
if(op == '>') out[a].pb(b), in[b].pb(a);
else out[b].pb(a), in[a].pb(b);
}
for(int i = 1; i <= n; ++i) {
if(ans[i] != 0) continue;
if(in[i].size() > 0 && out[i].size() > 0) {
ans[i] = 'R';
for(int j = 0; j < (int)in[i].size(); ++j) {
ans[in[i][j]] = 'W';
}
for(int j = 0; j < (int)out[i].size(); ++j) {
ans[out[i][j]] = 'B';
}
}
}
for(int a, b, i = 1; i <= n; ++i) {
pr[Find(i)].pb(i);
}
for(int i = 1; i <= n; ++i) {
if(pr[i].size() == 1 || pr[i].size() == 0) continue;
char ch = 0;
int len = pr[i].size();
for(int j = 0; j < len; ++j) {
if(ans[pr[i][j]] != 0) ch = ans[pr[i][j]];
}
for(int j = 0; j < len; ++j) {
ans[pr[i][j]] = ch;
}
}
/*for(int i = 1; i <= n; ++i) {
printf("%c", ans[i]);
}
puts("");*/
for(int a, b, i = 0; i < m; ++i) {
a = edge[i].a, b = edge[i].b, op = edge[i].op;
if(ans[a] != 0 && ans[b] != 0) continue;
if(op == '<') {
if(ans[a] == 'R') {
ans[b] = 'W';
} else if(ans[b] == 'R') {
ans[a] = 'B';
}
} else if(op == '>') {
if(ans[a] == 'R') {
ans[b] = 'B';
} else if(ans[b] == 'R') {
ans[a] = 'W';
}
}
}
for(int i = 1; i <= n; ++i) {
printf("%c", ans[i] != 0 ? ans[i] : '?');
}
puts("");
return 0;
}
H
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>
using namespace std;
#define LL long long
#define pb push_back
#define mk make_pair
#define fi first
#define se second
#define pill pair<int, int>
#define mst(a, b) memset(a, b, sizeof a)
#define REP(i, x, n) for(int i = x; i <= n; ++i)
const int MOD = 1e9 + 7;
const int qq = 5e5 + 10;
const LL INF = 1e9 + 10;
LL a[15];
void init() {
a[1]=8;
for(int i=2;i<10;i++) {
a[i]=a[i-1]*9;
}
}
int main(){
init();
int n;
freopen("Input.txt","r",stdin);
freopen("Output.txt","w",stdout);
scanf("%d",&n);
if(n<10) printf("%lld",a[n]);
else {
printf("%lld",a[9]);
for(int i=10;i<=n;i++) printf("0");
}
puts("");
return 0;
}
J
一个很裸的二分图匹配
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>
using namespace std;
#define LL long long
#define pb push_back
#define mk make_pair
#define fi first
#define se second
#define pill pair<int, int>
#define mst(a, b) memset(a, b, sizeof a)
#define REP(i, x, n) for(int i = x; i <= n; ++i)
const int MOD = 1e9 + 7;
const int qq = 105 + 10;
const LL INF = 1e9 + 10;
int n, m;
int numn[qq], numm[qq];
vector<int> G[qq];
int match[qq], remt[qq];
bool vis[qq];
int GetSum(int x, int f) {
int tmp, sum = 0;
if(f == 0) {
tmp = x / 1000;
} else {
tmp = x % 1000;
}
while(tmp > 0) {
sum += tmp % 10;
tmp /= 10;
}
return sum;
}
bool Dfs(int u) {
int sz = G[u].size();
for(int i = 0; i < sz; ++i) {
int v = G[u][i];
if(!vis[v]) {
vis[v] = true;
if(match[v] == -1 || Dfs(match[v])) {
match[v] = u;
remt[u] = v;
return true;
}
}
}
return false;
}
int main(){
freopen("Input.txt","r",stdin);
freopen("Output.txt","w",stdout);
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; ++i) {
scanf("%d", numn + i);
}
for(int i = 1; i <= m; ++i) {
scanf("%d", numm + i);
}
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= m; ++j) {
if(GetSum(numn[i], 0) == GetSum(numm[j], 1) || GetSum(numn[i], 1) == GetSum(numm[j], 0)) {
G[i].pb(j);
// printf("%d %d\n", i, j);
}
}
}
mst(match, -1);
mst(remt, -1);
int ans = 0;
for(int i = 1; i <= n; ++i) {
mst(vis, false);
if(Dfs(i)) ans++;
}
printf("%d\n", ans);
for(int i = 1; i <= n; ++i) {
if(remt[i] != -1) {
int f;
if(GetSum(numn[i], 0) == GetSum(numm[remt[i]], 1)) {
f = 0;
} else {
f = 1;
}
if(f) printf("TA ");
else printf("AT ");
if(f == 0) printf("%d %d\n", numn[i], numm[remt[i]]);
else printf("%d %d\n", numm[remt[i]], numn[i]);
}
}
return 0;
}