oj.uz

답안 #983046

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
983046 2024-05-15T07:20:13 Z vjudge1 이상한 기계 (APIO19_strange_device) C++17
15 / 100
 726 ms 190864 KB 
#include <time.h>
#include <cstdlib>
#include <stack>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <map>
#include <set>
#include <iterator>
#include <deque>
#include <queue>
#include <sstream>
#include <array>
#include <string>
#include <tuple>
#include <chrono>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <list>
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <bitset>
#define ll long long
using namespace std;

ll n, A, B;
ll l[1000005], r[1000005], sum = 0;
set<pair<ll, ll>> st1, st2, st;
int main(){
    ios::sync_with_stdio(0);
    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){
      for(int i = 1; i <= n; i++){
          for(ll j = l[i]; j <= r[i]; j++){
              ll x = (j + j / B) % A, y = (j % B);
              st.insert({x, y});
          }
      }
      cout << int(st.size()) << "\n";
      return 0;
    }
    if(n == 1){
        ll x = (l[1] + l[1] / B) % A; 
        if(l[1] + B <= r[1]){
            ll num = l[1] + B;
            ll y = (num + num / B) % A;
            if(x == y){
                cout << B << "\n";
                return 0;
            }
            ll d = abs(x - y);
            ll ans = gcd(d, A);
            ll rg = l[1] + ans * B - 1;
            cout << min(r[1], rg) - l[1] + 1 << "\n";
        }
        else{
            cout << r[1] - l[1] + 1 << "\n";
            return 0;
        }
    }
    ll lf[n + 2], rg[n + 2];
    for(int i = 1; i <= n; i++){
        lf[i] = l[i];
        rg[i] = min(r[i], l[i] + A - 1);
        st1.insert({lf[i], i});
        st2.insert({rg[i], i});
    }
    ll ans = 0, mx = 0, mn = 0;
    bool f = 0;
    while(!st1.empty()){
        if(!f){
            auto it = st1.begin();
            mn = it->first;
            mx = rg[it->second];
            f = 1;
            st1.erase(st1.begin());
            continue;
        }
        else{
            if(st1.begin()->first <= mx){
                auto it = st1.begin();
                mx = max(rg[it->second], mx);
                st1.erase(st1.begin());
                continue;
            }
            else{
                ans += (mx - mn + 1);
                auto it = st1.begin();
                mn = it->first;
                mx = rg[it->second];
                f = 1;
                st1.erase(st1.begin());
            }
        }
    }
    ans += (mx - mn + 1);
    cout << ans;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 35 ms 12812 KB Output is correct
3 Correct 54 ms 18512 KB Output is correct
4 Correct 2 ms 856 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 6 ms 1244 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 600 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 31 ms 6960 KB Output is correct
16 Correct 24 ms 7412 KB Output is correct
17 Correct 42 ms 11860 KB Output is correct
18 Correct 0 ms 500 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 113 ms 32428 KB Output is correct
3 Correct 156 ms 32108 KB Output is correct
4 Correct 105 ms 30796 KB Output is correct
5 Incorrect 651 ms 180292 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 726 ms 190864 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 726 ms 190864 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 726 ms 190864 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 62 ms 19916 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 35 ms 12812 KB Output is correct
3 Correct 54 ms 18512 KB Output is correct
4 Correct 2 ms 856 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 6 ms 1244 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 600 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 31 ms 6960 KB Output is correct
16 Correct 24 ms 7412 KB Output is correct
17 Correct 42 ms 11860 KB Output is correct
18 Correct 0 ms 500 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 113 ms 32428 KB Output is correct
26 Correct 156 ms 32108 KB Output is correct
27 Correct 105 ms 30796 KB Output is correct
28 Incorrect 651 ms 180292 KB Output isn't correct
29 Halted 0 ms 0 KB -