oj.uz

Submission #982999

# Submission time Handle Problem Language Result Execution time Memory
982999 2024-05-15T06:47:16 Z vjudge1 Strange Device (APIO19_strange_device) C++17
15 / 100
 245 ms 53068 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>> 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;
        }
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 36 ms 12880 KB Output is correct
3 Correct 50 ms 18512 KB Output is correct
4 Correct 2 ms 2908 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 628 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 6 ms 1372 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 32 ms 9044 KB Output is correct
16 Correct 21 ms 9308 KB Output is correct
17 Correct 42 ms 13308 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 117 ms 32396 KB Output is correct
3 Correct 160 ms 34132 KB Output is correct
4 Correct 98 ms 32764 KB Output is correct
5 Incorrect 182 ms 41028 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 245 ms 53068 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 245 ms 53068 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 245 ms 53068 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Incorrect 24 ms 5720 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 36 ms 12880 KB Output is correct
3 Correct 50 ms 18512 KB Output is correct
4 Correct 2 ms 2908 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 628 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 6 ms 1372 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 32 ms 9044 KB Output is correct
16 Correct 21 ms 9308 KB Output is correct
17 Correct 42 ms 13308 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 117 ms 32396 KB Output is correct
26 Correct 160 ms 34132 KB Output is correct
27 Correct 98 ms 32764 KB Output is correct
28 Incorrect 182 ms 41028 KB Output isn't correct
29 Halted 0 ms 0 KB -