201809-1(卖菜),201809-2(买菜)

//201809-1
#include <bits/stdc++.h>

using namespace std;

int main() {
    int n;
    scanf("%d", &n);
    int arr[n];
    for (int i = 0; i < n; i++)
        scanf("%d", &arr[i]);

    int result[n];
    for (int i = 0; i < n; i++) {
        if (i == 0)
            result[i] = (arr[i] + arr[i + 1]) / 2;
        else if (i == n - 1)
            result[i] = (arr[i] + arr[i - 1]) / 2;
        else
            result[i] = (arr[i] + arr[i - 1] + arr[i + 1]) / 3;
    }

    for (auto it:result)
        printf("%d ", it);
    return 0;
}

//201809-2
#include <bits/stdc++.h>

using namespace std;

int main() {
    int n;
    scanf("%d", &n);
    vector<pair<int, int>> v1(n), v2(n);
    for (int i = 0; i < n; i++)
        scanf("%d%d", &v1[i].first, &v1[i].second);
    for (int i = 0; i < n; i++)
        scanf("%d%d", &v2[i].first, &v2[i].second);
    int totalTime = 0;
    for (auto it1:v1)
        for (auto it2:v2)
            if (it1.first < it2.second && it1.second > it2.first)
                totalTime += min(it1.second, it2.second) - max(it1.first, it2.first);
    printf("%d\n", totalTime);

    return 0;
}

//201809-2
#include <bits/stdc++.h>

using namespace std;
int temp[1000010];

int main() {
    int n;
    scanf("%d", &n);
    memset(temp, 0, sizeof(temp));
    int a, b;
    for (int i = 0; i < 2 * n; i++) {
        scanf("%d%d", &a, &b);
        for (int j = a; j < b; j++)
            temp[j]++;
    }

    int totalTime = 0;
    for (int i = 0; i < 1000000; i++)
        if (temp[i] == 2)
            totalTime++;
    printf("%d\n", totalTime);
    return 0;
}