Codeforces Round #744 (Div. 3)

最新推荐文章于 2024-11-29 09:50:14 发布

原创最新推荐文章于 2024-11-29 09:50:14 发布 · 108 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法

codeforces 专栏收录该内容

49 篇文章

订阅专栏

本文介绍了四个不同的算法问题：Casimir’s String Solitaire涉及字符串中字符计数与比较；Shifting Sort探讨了数组元素的最短距离排序；Ticks问题处理了二维矩阵中星号的染色问题；Productive Meeting则关注如何安排会议以最大化参与者的产出。这些题目涵盖了字符串处理、排序算法、图遍历及优化策略等多个计算机科学核心概念。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A. Casimir’s String Solitaire

#include <bits/stdc++.h>
using namespace std;
int main(){
	int n;
	cin >> n;
	while (n -- ) {
		string str;
		int a = 0, b = 0, c = 0;
		cin >> str;
		int len = str.size();
		for (int i = 0; i < len; i ++ )
			if (str[i] == 'A') a ++;
			else if (str[i] == 'B') b ++;
			else c ++;
		if (a + c == b) cout << "YES" << endl;
		else cout << "NO" << endl;
	}
	return 0;
}

B. Shifting Sort

#include <bits/stdc++.h>
using namespace std;
#define FI first
#define SE second
#define MP make_pair
#define PB push_back
typedef pair<int, int> PII;
typedef vector<int> VI;
int a[60];
vector<PII> ans;
int main(){
	int t;
	cin >> t;
	while (t -- ) {
		ans.clear();
		int n;
		cin >> n;
		for (int i = 1; i <= n; i ++ ) cin >> a[i];
		for (int i = 1; i <= n; i ++ ) {
			int pos = i;
			int mi = a[i];
			for (int j = i + 1; j <= n; j ++ ) {
				if (a[j] < mi) {
					pos = j;
					mi = a[j];
				}
			}
			if (i != pos) {
			    ans.PB(MP(i, pos));
			    int t = a[pos];
			    int tmp = a[i];
			    for (int j = i + 1; j <= pos; j ++ ) {
			        int k = a[j];
			        a[j] = tmp;
			        tmp = k;
			    }
			    a[i] = t;
			}
		}
		cout << ans.size() << endl;
		if (ans.size() == 0) cout << endl;
		for (auto t : ans) 
			cout << t.FI << ' ' << t.SE << ' ' << t.SE - t.FI << endl;
	}
	return 0;
}

C. Ticks

#include <bits/stdc++.h>
using namespace std;
char ch[15][25];
int main(){
	int t;
	scanf("%d", &t);
	while (t -- ) {
	    int n, m, k;
	    scanf("%d%d%d", &n, &m, &k);
	    for (int i = 1; i <= n; i ++ ) 
	        scanf("%s", ch[i] + 1);
	    for (int i = 1; i <= n; i ++ ) {
	        for (int j = 1; j <= m; j ++ ) {
	            if (ch[i][j] == '*') {
	                int d = 0;
	                while (i - d >= 1 && j + d <= m && j - d >= 1 && 
	                (ch[i - d][j + d] == '*' || ch[i - d][j + d] == '!')
	                && (ch[i - d][j - d] == '*' || ch[i - d][j - d] == '!')) 
	                    d ++;
	                if (d > k) {
	                    d = 1;
	                    ch[i][j] = '!';
	                    while (i - d >= 1 && j + d <= m && j - d >= 1 && 
    	                (ch[i - d][j + d] == '*' || ch[i - d][j + d] == '!')
    	                && (ch[i - d][j - d] == '*' || ch[i - d][j - d] == '!')) 
	                        ch[i - d][j + d] = ch[i - d][j - d] = '!', d ++;
	                }
	            }
	        }
	    }
	    bool ok = 1;
	    for (int i = 1; i <= n; i ++ ) 
	        for (int j = 1; j <= m; j ++ ) 
	            if (ch[i][j] == '*') ok = 0;
	    if (ok) cout << "YES" << endl;
	    else cout << "NO" << endl;
	}
	return 0;
}

D. Productive Meeting

#include <bits/stdc++.h>
using namespace std;
#define FI first
#define SE second
#define MP make_pair
#define PB push_back
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int N = 2e5 + 10;
int a[N];
vector<PII> res;
LL num[N];
int main(){
	int t;
	scanf("%d", &t);
	while (t -- ) {
	    int n;
	    res.clear();
	    memset(num, 0, sizeof num);
	    scanf("%d", &n);
	    LL sum = 0;
	    int mx = 0;
	    for (int i = 1; i <= n; i ++ ) {
	        scanf("%d", a + i);
	        sum += a[i];
	        mx = max(mx, a[i]);
	        res.PB(MP(a[i], i));
	    }
	    sum = min(sum / 2, sum - mx);
	    if (sum == 0) {
	        printf("0\n");
	        continue;
	    }
	    res.PB(MP(0, 0));
	    sort(res.begin(), res.end());
	    for (int i = 1; i <= n; i ++ ) num[i] = num[i - 1] + res[i].FI;
	    int pos = lower_bound(num + 1, num + n + 1, sum) - num;
	    int tmp = sum - num[pos - 1];
	    printf("%lld\n", sum);
	    PII k = res.back(); res.pop_back();
	    res.PB(MP(k.FI - tmp, k.SE));
	    for (int i = 1; i <= tmp; i ++ ) 
	        printf("%d %d\n", res[pos].SE, res[n].SE);
	    int l = pos - 1, r = n;
	    while (l >= 1 && r >= pos) {
	        for (int i = 1; i <= min(res[l].FI, res[r].FI); i ++ )
	        printf("%d %d\n", res[l].SE, res[r].SE);
	        int mn = min(res[l].FI, res[r].FI);
	        res[l].FI -= mn;
	        res[r].FI -= mn;
	        if (res[l].FI == 0) l --;
	        if (res[r].FI == 0) r --;
	    }
	}
	return 0;
}

E1. Permutation Minimization by Deque

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
typedef vector<int> VI;
const int N = 2e5 + 10;
int a[N];
int main(){
	int t;
	scanf("%d", &t);
	while (t -- ) {
	    int n;
	    scanf("%d", &n);
	    for (int i = 1; i <= n; i ++ ) scanf("%d", a + i);
	    VI f, b;
	    if (n == 1) {
	        printf("%d\n", a[1]);
	        continue;
	    }
	    if (a[1] > a[2]) f.PB(a[2]), b.PB(a[1]);
	    else f.PB(a[1]), b.PB(a[2]);
	    for (int i = 3; i <= n; i ++ ) {
	        if (a[i] < f.back()) f.PB(a[i]);
	        else b.PB(a[i]);
	    }
	    while (f.size()) {
	        printf("%d ", f.back());
	        f.pop_back();
	    }
	    for (auto t : b) 
	        printf("%d ", t);
	    puts("");
	}
	return 0;
}