oj.uz

Submission #252065

# Submission time Handle Problem Language Result Execution time Memory
252065 2020-07-24T05:39:58 Z jeqcho Strange Device (APIO19_strange_device) C++17
35 / 100
 592 ms 17132 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpi;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define rsz resize
#define sz(x) int(x.size())
#define all(x) begin(x), end(x)
#define f first
#define s second

// solved subtask 4 and 5

ll A,B;

ll gcd(ll a, ll b)
{
    // O((log n)^2)
    if (b == 0)
        return a;
    return gcd(b, a % b);
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n;
    cin>>n>>A>>B;
    ll l,r;
    ll q = A / gcd(A,B+1);
    ll maxlen = q*B;
    vector<pair<ll,ll>> segments;
    F0R(i,n)
    {
        cin>>l>>r;
        if(r-l+1 >= maxlen)
        {
            FOR(j,i+1,n)cin>>l>>r;
            cout<<maxlen<<endl;
            return 0;
        }
        l %= maxlen;
        r %= maxlen;
        if(r<l)
        {
            segments.pb({0,r});
            segments.pb({l,maxlen-(ll)1});
        }
        else segments.pb({l,r});
    }
    sort(all(segments));
    bool init=0;
    ll ldex,rdex;
    ll ans=0;
    pair<ll,ll> seg;
    F0R(i,sz(segments)+1)
    {
        if(i==sz(segments))
        {
            ans += rdex-ldex+(ll)1;
            break;
        }
        seg = segments[i];
        if(!init)
        {
            ldex=seg.f;
            rdex=seg.s;
            init=1;
        }
        else if(seg.f==ldex)
        {
            rdex = seg.s;
        }
        else
        {
            // seg.f > ldex
            if(seg.f <= rdex)
            {
                rdex = max(rdex,seg.s);
            }
            else
            {
                ans += rdex-ldex+(ll)1;
                ldex=seg.f;
                rdex=seg.s;
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}

Compilation message

strange_device.cpp: In function 'int main()':
strange_device.cpp:70:24: warning: 'rdex' may be used uninitialized in this function [-Wmaybe-uninitialized]
             ans += rdex-ldex+(ll)1;
                    ~~~~^~~~~
strange_device.cpp:70:24: warning: 'ldex' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 5 ms 768 KB Output is correct
3 Correct 6 ms 768 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 56 ms 2544 KB Output is correct
18 Incorrect 0 ms 384 KB Output isn't correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Incorrect 0 ms 384 KB Output isn't correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 382 ms 17004 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 525 ms 16944 KB Output is correct
3 Correct 512 ms 17076 KB Output is correct
4 Correct 485 ms 16852 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 525 ms 16944 KB Output is correct
3 Correct 512 ms 17076 KB Output is correct
4 Correct 485 ms 16852 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 513 ms 16852 KB Output is correct
7 Correct 513 ms 16916 KB Output is correct
8 Correct 513 ms 16856 KB Output is correct
9 Correct 531 ms 16852 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 525 ms 16944 KB Output is correct
3 Correct 512 ms 17076 KB Output is correct
4 Correct 485 ms 16852 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 53 ms 2544 KB Output is correct
7 Correct 55 ms 2532 KB Output is correct
8 Correct 48 ms 2544 KB Output is correct
9 Correct 50 ms 2668 KB Output is correct
10 Correct 49 ms 2552 KB Output is correct
11 Correct 52 ms 2544 KB Output is correct
12 Correct 48 ms 2552 KB Output is correct
13 Correct 52 ms 2544 KB Output is correct
14 Correct 48 ms 2552 KB Output is correct
15 Correct 59 ms 2544 KB Output is correct
16 Correct 53 ms 2544 KB Output is correct
17 Correct 49 ms 2544 KB Output is correct
18 Correct 528 ms 17132 KB Output is correct
19 Correct 505 ms 16852 KB Output is correct
20 Correct 545 ms 16980 KB Output is correct
21 Correct 54 ms 2540 KB Output is correct
22 Correct 48 ms 2544 KB Output is correct
23 Correct 169 ms 8672 KB Output is correct

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 57 ms 2544 KB Output is correct
3 Correct 56 ms 2544 KB Output is correct
4 Correct 592 ms 17024 KB Output is correct
5 Correct 54 ms 2544 KB Output is correct
6 Correct 51 ms 2552 KB Output is correct
7 Correct 52 ms 2544 KB Output is correct
8 Correct 53 ms 2540 KB Output is correct
9 Correct 60 ms 2540 KB Output is correct
10 Correct 51 ms 2560 KB Output is correct
11 Correct 54 ms 2540 KB Output is correct
12 Correct 46 ms 2544 KB Output is correct
13 Correct 60 ms 2540 KB Output is correct
14 Correct 532 ms 16852 KB Output is correct
15 Correct 60 ms 2544 KB Output is correct
16 Correct 505 ms 16932 KB Output is correct
17 Correct 507 ms 16852 KB Output is correct
18 Incorrect 0 ms 384 KB Output isn't correct

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 5 ms 768 KB Output is correct
3 Correct 6 ms 768 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 56 ms 2544 KB Output is correct
18 Incorrect 0 ms 384 KB Output isn't correct