oj.uz

Submission #983010

# Submission time Handle Problem Language Result Execution time Memory
983010 2024-05-15T06:56:11 Z angella Strange Device (APIO19_strange_device) C++17
15 / 100
 84 ms 21320 KB 
/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>

// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;

#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define endl                                   '\n'

const int N = 3e5+23, lg = 18;
ll Mod = 1e9+7; //998244353;

inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
    ll ans = 1;
    a=MOD(a, mod);
    while (b) {
        if (b & 1) ans = MOD(ans*a, mod);
        b >>= 1;
        a = MOD(a*a, mod);
    }
    return ans;
}

ll n, a, b, ans, l[N], r[N];
int main () {
	ios_base::sync_with_stdio(false), cin.tie(0);

    cin>>n>>a>>b;
    for(int i=1; i<=n; i++) {
        cin>>l[i]>>r[i]; ans += (r[i]-l[i]+1);
    }
    ll s = a/__gcd(a,b+1);
    if(__lg(s) + __lg(b) >= 60) kill(ans);

    vector<pll> vec;
    for(int i=1; i<=n; i++) {
        if(r[i]-l[i]+1 >= s*b) kill(s*b);
        l[i] = MOD(l[i], s*b);
        r[i] = MOD(r[i], s*b);
        if(r[i] >= l[i]) vec.pb({l[i], r[i]});
        else {
            vec.pb({0, r[i]}); vec.pb({l[i], s*b-1});
        }
    }

    sort(all(vec));
    ans = 0; ll mx = -1;
    for(auto it : vec) {
        if(it.F > mx) {
            ans += (it.S-it.F+1); mx = it.S;
        } else {
            ans += max(0ll, it.S - mx);
            mx = max(mx, it.S);
        }
    }

    cout<<ans<<endl;
	
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 4 ms 1372 KB Output is correct
3 Correct 4 ms 1368 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 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 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 1372 KB Output is correct
17 Correct 37 ms 6096 KB Output is correct
18 Correct 1 ms 348 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 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 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 1 ms 348 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Runtime error 59 ms 12844 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Runtime error 78 ms 16424 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Runtime error 78 ms 16424 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Runtime error 78 ms 16424 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2592 KB Output is correct
2 Correct 35 ms 6092 KB Output is correct
3 Correct 34 ms 7884 KB Output is correct
4 Runtime error 84 ms 21320 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 4 ms 1372 KB Output is correct
3 Correct 4 ms 1368 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 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 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 1372 KB Output is correct
17 Correct 37 ms 6096 KB Output is correct
18 Correct 1 ms 348 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 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Runtime error 59 ms 12844 KB Execution killed with signal 11
29 Halted 0 ms 0 KB -