oj.uz

답안 #362214

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
362214 2021-02-02T07:29:40 Z alirezasamimi100 이상한 기계 (APIO19_strange_device) C++17
65 / 100
 523 ms 18832 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+1) 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

# 결과 실행 시간 메모리 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 492 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 7 ms 1132 KB Output is correct
17 Correct 52 ms 3944 KB Output is correct
18 Correct 1 ms 364 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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 347 ms 17220 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 472 ms 18760 KB Output is correct
3 Correct 461 ms 18128 KB Output is correct
4 Correct 458 ms 18792 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 472 ms 18760 KB Output is correct
3 Correct 461 ms 18128 KB Output is correct
4 Correct 458 ms 18792 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 443 ms 18660 KB Output is correct
7 Correct 456 ms 18672 KB Output is correct
8 Correct 453 ms 18832 KB Output is correct
9 Correct 487 ms 18640 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 472 ms 18760 KB Output is correct
3 Correct 461 ms 18128 KB Output is correct
4 Correct 458 ms 18792 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 45 ms 4072 KB Output is correct
7 Correct 54 ms 3912 KB Output is correct
8 Correct 44 ms 3944 KB Output is correct
9 Correct 45 ms 3944 KB Output is correct
10 Correct 45 ms 3948 KB Output is correct
11 Correct 48 ms 3944 KB Output is correct
12 Correct 47 ms 3944 KB Output is correct
13 Correct 48 ms 3944 KB Output is correct
14 Correct 45 ms 3688 KB Output is correct
15 Correct 48 ms 3688 KB Output is correct
16 Correct 48 ms 3688 KB Output is correct
17 Correct 46 ms 3688 KB Output is correct
18 Correct 446 ms 17848 KB Output is correct
19 Correct 461 ms 17392 KB Output is correct
20 Correct 523 ms 17488 KB Output is correct
21 Correct 50 ms 3432 KB Output is correct
22 Correct 42 ms 3432 KB Output is correct
23 Correct 136 ms 9180 KB Output is correct

Subtask #7
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 48 ms 3176 KB Output is correct
3 Correct 48 ms 3176 KB Output is correct
4 Correct 522 ms 17360 KB Output is correct
5 Correct 47 ms 3304 KB Output is correct
6 Correct 52 ms 3048 KB Output is correct
7 Correct 55 ms 3304 KB Output is correct
8 Correct 57 ms 3432 KB Output is correct
9 Correct 47 ms 3304 KB Output is correct
10 Correct 47 ms 3304 KB Output is correct
11 Correct 52 ms 3440 KB Output is correct
12 Correct 48 ms 3304 KB Output is correct
13 Correct 60 ms 3304 KB Output is correct
14 Correct 500 ms 17768 KB Output is correct
15 Correct 50 ms 3304 KB Output is correct
16 Correct 447 ms 17488 KB Output is correct
17 Correct 458 ms 17532 KB Output is correct
18 Correct 1 ms 364 KB Output is correct

Subtask #8
0 / 30.0

# 결과 실행 시간 메모리 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 492 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 7 ms 1132 KB Output is correct
17 Correct 52 ms 3944 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 -