oj.uz

Submission #252079

# Submission time Handle Problem Language Result Execution time Memory
252079 2020-07-24T06:02:14 Z jeqcho Strange Device (APIO19_strange_device) C++17
35 / 100
 585 ms 30040 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-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+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+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+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 1152 KB Output is correct
3 Correct 6 ms 1152 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 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 0 ms 384 KB Output is correct
9 Correct 1 ms 388 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 1152 KB Output is correct
17 Correct 57 ms 5756 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 0 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 0 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 377 ms 17464 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 528 ms 21680 KB Output is correct
3 Correct 518 ms 21972 KB Output is correct
4 Correct 509 ms 21844 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 528 ms 21680 KB Output is correct
3 Correct 518 ms 21972 KB Output is correct
4 Correct 509 ms 21844 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 517 ms 21716 KB Output is correct
7 Correct 528 ms 21624 KB Output is correct
8 Correct 531 ms 21972 KB Output is correct
9 Correct 561 ms 21716 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 528 ms 21680 KB Output is correct
3 Correct 518 ms 21972 KB Output is correct
4 Correct 509 ms 21844 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 51 ms 5740 KB Output is correct
7 Correct 55 ms 5800 KB Output is correct
8 Correct 53 ms 5736 KB Output is correct
9 Correct 53 ms 5788 KB Output is correct
10 Correct 51 ms 5740 KB Output is correct
11 Correct 52 ms 5752 KB Output is correct
12 Correct 52 ms 5740 KB Output is correct
13 Correct 54 ms 5740 KB Output is correct
14 Correct 53 ms 5736 KB Output is correct
15 Correct 55 ms 5868 KB Output is correct
16 Correct 54 ms 5744 KB Output is correct
17 Correct 55 ms 5740 KB Output is correct
18 Correct 528 ms 30036 KB Output is correct
19 Correct 500 ms 30036 KB Output is correct
20 Correct 557 ms 30036 KB Output is correct
21 Correct 57 ms 5740 KB Output is correct
22 Correct 49 ms 5740 KB Output is correct
23 Correct 173 ms 18528 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 5712 KB Output is correct
3 Correct 57 ms 5876 KB Output is correct
4 Correct 585 ms 21704 KB Output is correct
5 Correct 52 ms 5740 KB Output is correct
6 Correct 56 ms 5736 KB Output is correct
7 Correct 54 ms 5740 KB Output is correct
8 Correct 56 ms 5740 KB Output is correct
9 Correct 59 ms 5756 KB Output is correct
10 Correct 58 ms 5740 KB Output is correct
11 Correct 56 ms 5740 KB Output is correct
12 Correct 49 ms 5740 KB Output is correct
13 Correct 53 ms 5740 KB Output is correct
14 Correct 555 ms 21716 KB Output is correct
15 Correct 55 ms 5740 KB Output is correct
16 Correct 522 ms 30040 KB Output is correct
17 Correct 512 ms 29908 KB Output is correct
18 Incorrect 1 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 1152 KB Output is correct
3 Correct 6 ms 1152 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 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 0 ms 384 KB Output is correct
9 Correct 1 ms 388 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 1152 KB Output is correct
17 Correct 57 ms 5756 KB Output is correct
18 Incorrect 0 ms 384 KB Output isn't correct