제출 #933225

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
933225		sleepntsheep	Strange Device (APIO19_strange_device)	C++17	0 / 100	2 ms	2396 KiB

strange_device

#include <iostream>
#include <fstream>
#include <iomanip>
#include <cmath>
#include <cassert>
#include <cstring>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>
#include <complex>
#include <map>

using u32 = unsigned;
using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f64 = double;
using f80 = long double;

using namespace std;
using pt = complex<f80>;
#define ALL(x) begin(x), end(x)
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false);
#define N 400005

i64 n, a, b, l[N], r[N];

int main()
{
    ShinLena;
    cin >> n >> a >> b;
    for (int i = 0; i < n; ++i) cin >> l[i] >> r[i];

    if (b == 1)
    {
        std::map<int, int> mp;
        for (int i = 0; i < n; ++i)
        {
            l[i] *= 2, r[i] *= 2;
            int lg = ::l[i] / a, rg = ::r[i] / a;
            int ll = ::l[i] % a, rr = ::r[i] % a;
            if (lg == rg)
            {
                ++mp[ll]; --mp[rr+1];
            }
            else if (lg + 1 == rg)
            {
                if (rr >= ll)
                    ++mp[0], --mp[a];
                else
                {
                    ++mp[0], --mp[rr+1];
                    ++mp[ll], --mp[a];
                }
            }
            else
            {
                ++mp[0], --mp[a];
            }
        }
        i64 z{}, run = 0, lx = 0;
        for (auto [x, y] : mp)
        {
            z += x - lx;
            run += y;
            lx = x;
        }
        cout << z << '\n';
    }

    {
        vector<pair<i64, i64>> v;
        for (int i = 0; i < n; ++i) for (i64 j = l[i]; j <= r[i]; ++j)
            v.push_back({(j+j/b)%a, j%b});
        sort(ALL(v)); return cout << unique(ALL(v)) - begin(v), 0;
    }

    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 5
• Subtask 3: 0 / 5
• Subtask 4: 0 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20
• Subtask 8: 0 / 30