Codeforces Round 944 (Div. 4) A - F 讲解

 视频链接：

​​​​​​​

Codeforces Round 944 (Div. 4) A题、B题、C题_哔哩哔哩_bilibili

Codeforces Round 944 (Div. 4) D题、E题_哔哩哔哩_bilibili

Codeforces Round 944 (Div. 4) F题_哔哩哔哩_bilibili
讲解都在视频里哦

A - My First Sorting Problem

#include<bits/stdc++.h>
using namespace std;

int main()
{
    int T;
    cin >> T;
    while (T--)
    {
        int x, y;
        cin >> x >> y;
        cout << min(x, y) << ' ' << max(x, y) << endl;
    }
    return 0;
}

B - Different String

#include<bits/stdc++.h>
using namespace std;

int main()
{
    int T;
    cin >> T;
    while (T--)
    {
        string s;
        cin >> s;
        char c = s[0];
        int index;
        bool ok = false;
        for (int i = 0; i < s.size(); i++)
            if (s[i] != c)
            {
                ok = true, index = i;
                break;
            }
        if (s.size() == 1 || !ok)
            cout << "NO\n";
        else
        {
            cout << "YES\n";
            cout << s[index];
            cout << s.substr(0, index);
            if (index != s.size() - 1)
                cout << s.substr(index + 1);
            cout << endl;
        }
    }
    return 0;
}

C - Clock and Strings

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int T;
    cin >> T;
    while (T--)
    {
        int a, b, c, d;
        cin >> a >> b >> c >> d;
        vector<int> vis(13, 0);
        bool ok1 = true, ok2 = true;
        int aa = min(a, b), bb = max(a, b), cc = min(c, d), dd = max(c, d);
        if (bb - aa <= 6)
            for (int i = aa; i <= bb; i++)
                vis[i] = 1;
        else
        {
            for (int i = bb; i <= 12; i++)
                vis[i] = 1;
            for (int i = 1; i <= aa; i++)
                vis[i] = 1;
        }
        for (int i = cc; i <= dd; i++)
            if (vis[i] == 1)
                ok1 = false;
        for (int i = dd; i <= 12; i++)
            if (vis[i] == 1)
                ok2 = false;
        for (int i = 1; i <= cc; i++)
            if (vis[i] == 1)
                ok2 = false;
        if (ok1 || ok2) 
            cout << "NO\n";
        else
            cout << "YES\n";
    }
    return 0;
}

D - Binary Cut

#include<bits/stdc++.h>
using namespace std;

int main()
{
    int T;
    cin >> T;
    while (T--)
    {
        string s;
        cin >> s;
        int cnt = 1;
        for (int i = 1; i < s.size(); i++)
            if (s[i - 1] > s[i])
                cnt++;
        int adding = cnt;
        if (cnt >= 2 && s[0] == '1')
            adding--;
        if (cnt >= 2 && s[s.size() - 1] == '0')
            adding--;
        if (adding <= 0)
            adding = 1;
        if (cnt == 1)
            cout << 1 << endl;
        else
            cout << cnt + adding - 1 << endl;
    }
    return 0;
}

E - Find the Car

#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main()
{
    int T;
    cin >> T;
    while (T--)
    {
		int n, k, q, d;
		cin >> n >> k >> q;
		vector<int> a(k + 1), b(k + 1);
		a[0] = 0, b[0] = 0;
		for (int i = 1; i <= k; i++)
			cin >> a[i];
		for (int i = 1; i <= k; i++)
			cin >> b[i];
		while (q--)
		{
			int l = -1, r = k + 1;
			cin >> d;
			while (r - l > 1)
			{
				int mid = (l + r) / 2;
				if (a[mid] < d)
					l = mid;
				else
					r = mid;
			}
			double ans;
			if (d == 0)
				ans = 0;
			else
			{
				int b1 = d - a[l], b2 = a[r] - a[l], till = b[r] - b[l];
				ans = b[l] + b1 * till / b2;
			}
			cout << (int)(ans) << endl;
		}
	}
    return 0;
}

F - Circle Perimeter

#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main()
{
	int T;
	cin >> T;
	while (T--)
	{
		int r, ans = 0;
		cin >> r;
		int height = r;
		for (int i = 0; i <= r; i++)
		{
			while (height * height + i * i >= (r + 1) * (r + 1))
				height--;
			int temp = height;
			while (i * i + temp * temp >= r * r && temp > 0)
				ans++, temp--;
		}
		cout << ans * 4 << endl;
	}
	return 0;
}