oj.uz

Submission #721632

# Submission time Handle Problem Language Result Execution time Memory
721632 2023-04-11T05:55:08 Z victor_gao Strange Device (APIO19_strange_device) C++17
15 / 100
 467 ms 460 KB 
//#pragma GCC optimize("Ofast,unroll-loops,O3")
//#pragma GCC optimize("avx,avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,fma,tune=native")
#include<bits/stdc++.h>
//#include<bits/extc++.h>
//#pragma pack(1)
#define fast ios::sync_with_stdio(0); cin.tie(0);
#define int long long
#define pii pair<int,int>
#define x first
#define y second
using namespace std;
//using namespace __gnu_pbds;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//typedef tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> order_multiset;
//typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> order_set;
int n,a,b,t;
int findt(){
    int go=b+1,g=__gcd(go,a);
   // cout<<go<<" "<<a<<' '<<b<<" "<<g<<'\n';
    // lcm(go,a)/go*b
    if ((double)(log10(a/g)+log10(b))>=18.0001) return -1;
    else return a/g*b;
}
set<pii>st;
void add(int l,int r){
    if (st.empty()){
        st.insert(pii(l,r-l+1));
        return;
    }
    auto it=st.insert(pii(l,r-l+1)).x;
    pii now={l,r-l+1};
    while (it!=st.begin()){
        auto it1=prev(it);
        pii last=*it1;
        if (last.x+last.y>=l){
            st.erase(it1);
            it=st.erase(it);
            now.y=(now.x+now.y-1)-last.x+1;
            now.x=last.x;
            it=st.insert(now).x;
        }
        else break;
    }
    while (it!=st.end()){
        auto it1=next(it);
        if (it1==st.end()) break;
        pii nxt=*it1;
        if (now.x+now.y>=nxt.x){
            st.erase(it1);
            it=st.erase(it);
            now.y=(nxt.x+nxt.y-1)-now.x+1;
            it=st.insert(now).x;
        }
        else break;
    }
}
signed main(){
    fast
    cin>>n>>a>>b;
    t=findt();
    if (n==1){
        int l,r; cin>>l>>r;
        if (t<0) cout<<r-l+1<<'\n';
        else if (r-l+1>=t) cout<<t<<'\n';
        else cout<<r-l+1<<'\n';
    }
    else if (t<0){
        int ans=0;
        for (int i=1;i<=n;i++){
            int l,r; cin>>l>>r;
            ans+=(r-l+1);
        }
        cout<<ans<<'\n';
    }
    else {
        for (int i=1;i<=n;i++){
            int l,r; cin>>l>>r;
            l%=t; r%=t;
            if (l>r){
                add(l,t-1);
                add(0,r);
            }
            else add(l,r);
        }
        int ans=0;
        for (auto i:st){
            ans+=i.y;
           // cout<<i.x<<" ~ "<<i.x+i.y-1<<'\n';
        }
        cout<<ans<<'\n';
    }
}

Subtask #1
0 / 10.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
0 / 5.0

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

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 436 ms 340 KB Output is correct
3 Correct 420 ms 340 KB Output is correct
4 Correct 429 ms 316 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 436 ms 340 KB Output is correct
3 Correct 420 ms 340 KB Output is correct
4 Correct 429 ms 316 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 424 ms 340 KB Output is correct
7 Correct 467 ms 340 KB Output is correct
8 Correct 423 ms 320 KB Output is correct
9 Correct 426 ms 320 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 436 ms 340 KB Output is correct
3 Correct 420 ms 340 KB Output is correct
4 Correct 429 ms 316 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 48 ms 460 KB Output is correct
7 Correct 48 ms 340 KB Output is correct
8 Correct 46 ms 340 KB Output is correct
9 Correct 45 ms 212 KB Output is correct
10 Correct 42 ms 340 KB Output is correct
11 Correct 43 ms 340 KB Output is correct
12 Correct 44 ms 316 KB Output is correct
13 Correct 45 ms 212 KB Output is correct
14 Correct 44 ms 340 KB Output is correct
15 Incorrect 45 ms 340 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 42 ms 340 KB Output is correct
3 Correct 45 ms 212 KB Output is correct
4 Correct 432 ms 212 KB Output is correct
5 Correct 44 ms 212 KB Output is correct
6 Correct 43 ms 340 KB Output is correct
7 Correct 46 ms 320 KB Output is correct
8 Correct 44 ms 340 KB Output is correct
9 Correct 53 ms 320 KB Output is correct
10 Correct 42 ms 212 KB Output is correct
11 Correct 43 ms 340 KB Output is correct
12 Correct 43 ms 212 KB Output is correct
13 Correct 44 ms 340 KB Output is correct
14 Incorrect 453 ms 340 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

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