제출 #683289

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
683289		Nursik	이상한 기계 (APIO19_strange_device)	C++14	10 / 100	5084 ms	504760 KiB

strange_device

#include <stdio.h>
 
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;
 
#define ll long long
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ld long double
#define bug cout << "bug\n";

const ll maxn = 1e6 + 1, maxm = 2e2 + 1;
const ll mod = 1e9 + 7, inf = 1e9, block = 550, hb = 126067, base = 1000050017,
         biginf = 5e18;
const ld eps = 1e-15;
using namespace std;

ll n, a, b;
ll l[maxn], r[maxn];
ll sum = 0;
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> n >> a >> b;
    for (int i = 1; i <= n; ++i){
        cin >> l[i] >> r[i];
        sum += (r[i] - l[i] + 1);
    }
    if (sum <= 1e6){
        set<pair<ll, ll>> setik;
        for (int i = 1; i <= n; ++i){
            for (ll j = l[i]; j <= r[i]; ++j){
                ll x = (j + j / b) % a;
                ll y = j % b;
                setik.insert(mp(x, y));
            }
        }
        int sz = (int)setik.size();
        cout << sz;
        exit(0);
    }
    if (n == 1){
        set<pair<ll, ll>> setik;
        for (int i = 1; i <= n; ++i){
            for (ll j = l[i]; j <= r[i]; ++j){
                ll x = (j + j / b) % a;
                ll y = j % b;
                if (setik.find(mp(x, y)) != setik.end())
                    break;
                setik.insert(mp(x, y));
            }
        }
        cout << setik.size();
    }
}
/*
 */

• Subtask 1: 10 / 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