oj.uz

Submission #362213

# Submission time Handle Problem Language Result Execution time Memory
362213 2021-02-02T07:26:58 Z alirezasamimi100 Strange Device (APIO19_strange_device) C++17
65 / 100
 594 ms 41308 KB 
#include <bits/stdc++.h>
/*#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")*/
#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,fma")
using namespace std;
using ll = long long int;
#define F first
#define S second
#define pb push_back
#define lc v<<1
#define rc v<<1|1
#define fast_io ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
const int N=5e5+10,LN=20,M=5e4+10,SQ=250,inf=1e9;
const ll INF=1e18;
const int MOD=1000000007 /*998244353*/;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using pll=pair<ll,ll>;
using pii=pair<int,int>;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
ll pow(ll x, ll y, ll mod){
    ll ans=1;
    while (y != 0) {
        if (y & 1) ans = ans * x % mod;
        y >>= 1;
        x = x * x % mod;
    }
    return ans;
}
ll n,a,b,c,ans,mr=-1;
vector<pll> v;
int main(){
    fast_io;
    cin >> n >> a >> b;
    c=a/__gcd(a,b+1);
    if(c>1e18/b) c=1e18+1;
    else c*=b;
    for(ll i=1; i<=n; i++){
        ll l,r;
        cin >> l >> r;
        l%=c;
        r%=c;
        if(r>=l) v.pb({l,r});
        else{
            v.pb({l,c-1});
            v.pb({0,r});
        }
    }
    sort(v.begin(),v.end());
    for(auto [l,r] : v){
        l=max(l,mr+1);
        if(l>r) continue;
        ans+=r-l+1;
        mr=r;
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 5 ms 1132 KB Output is correct
3 Correct 5 ms 1132 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 1132 KB Output is correct
17 Correct 52 ms 5732 KB Output is correct
18 Correct 1 ms 364 KB Output is correct

Subtask #2
0 / 5.0

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

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 358 ms 41308 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 364 KB Output is correct
2 Correct 460 ms 19792 KB Output is correct
3 Correct 461 ms 30300 KB Output is correct
4 Correct 490 ms 23632 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 364 KB Output is correct
2 Correct 460 ms 19792 KB Output is correct
3 Correct 461 ms 30300 KB Output is correct
4 Correct 490 ms 23632 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 455 ms 23632 KB Output is correct
7 Correct 464 ms 23632 KB Output is correct
8 Correct 491 ms 23944 KB Output is correct
9 Correct 510 ms 23632 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 364 KB Output is correct
2 Correct 460 ms 19792 KB Output is correct
3 Correct 461 ms 30300 KB Output is correct
4 Correct 490 ms 23632 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 75 ms 5732 KB Output is correct
7 Correct 52 ms 5732 KB Output is correct
8 Correct 46 ms 5732 KB Output is correct
9 Correct 55 ms 5688 KB Output is correct
10 Correct 136 ms 5736 KB Output is correct
11 Correct 121 ms 5732 KB Output is correct
12 Correct 46 ms 5732 KB Output is correct
13 Correct 71 ms 5732 KB Output is correct
14 Correct 49 ms 5732 KB Output is correct
15 Correct 51 ms 5732 KB Output is correct
16 Correct 61 ms 5732 KB Output is correct
17 Correct 54 ms 5732 KB Output is correct
18 Correct 456 ms 23964 KB Output is correct
19 Correct 456 ms 32316 KB Output is correct
20 Correct 532 ms 24272 KB Output is correct
21 Correct 50 ms 5732 KB Output is correct
22 Correct 44 ms 5732 KB Output is correct
23 Correct 146 ms 18524 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 57 ms 5732 KB Output is correct
3 Correct 50 ms 5732 KB Output is correct
4 Correct 594 ms 30288 KB Output is correct
5 Correct 49 ms 5732 KB Output is correct
6 Correct 50 ms 5732 KB Output is correct
7 Correct 48 ms 5732 KB Output is correct
8 Correct 50 ms 5732 KB Output is correct
9 Correct 51 ms 5732 KB Output is correct
10 Correct 50 ms 5732 KB Output is correct
11 Correct 61 ms 5732 KB Output is correct
12 Correct 44 ms 5696 KB Output is correct
13 Correct 56 ms 5732 KB Output is correct
14 Correct 507 ms 30288 KB Output is correct
15 Correct 61 ms 5732 KB Output is correct
16 Correct 466 ms 24272 KB Output is correct
17 Correct 459 ms 24428 KB Output is correct
18 Correct 1 ms 364 KB Output is correct

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 5 ms 1132 KB Output is correct
3 Correct 5 ms 1132 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 1132 KB Output is correct
17 Correct 52 ms 5732 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Incorrect 1 ms 364 KB Output isn't correct
21 Halted 0 ms 0 KB -