oj.uz

Submission #934560

# Submission time Handle Problem Language Result Execution time Memory
934560 2024-02-27T15:03:10 Z Rifal Strange Device (APIO19_strange_device) C++14
65 / 100
 565 ms 77228 KB 
#include <bits/stdc++.h>
#include <fstream>
#define endl '\n'
#define mod 1000000007
#define INF 1000000000000000000
#define INF2 1000000000000000000
//#define ll long long
///#define cin fin
///#define cout fout
using namespace std;
double const EPS = 1e-14;
///ofstream fout("herding.out");
///ifstream fin("herding.in");

int main()
{
    ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
    long long n, a, b; cin >> n >> a >> b;
    pair<long long, long long> p[n];
    vector<pair<long long,long long>> v;
    long long md;
    if(a > INF/b) md = (INF + 1);
    else md = (a*b)/__gcd(a,b+1);
   // cout << n << ' ' << a << ' ' << b <<  endl;
   // cout << md << endl;
    bool ok = false;
    for(long long i = 0; i < n; i++) {
        cin >> p[i].first >> p[i].second;
        //cout << i << endl;
        pair<long long, long long> pp;
        pp = p[i];
        p[i].first %= md;
        p[i].second %= md;
        if(p[i].second < p[i].first) {
            if(pp.second-pp.first+1ll >= md) {
                cout << md << endl;
                ok = true;
            }
            v.push_back({p[i].first,0});
            v.push_back({md-1ll,1});
            v.push_back({0,0});
            v.push_back({p[i].second,1});
        }
        else {
            v.push_back({p[i].first,0});
            v.push_back({p[i].second,1});
        }
    }
    if(ok) return 0;
    sort(v.begin(),v.end()); long long cnt = 0;
    long long l = -1, r = 0; 
    long long ans = 0;
    for(int i = 0; i < v.size(); i++) {
        if(v[i].second == 0) {
            cnt++;
            if(l == -1) l = v[i].first;
        }
        else {
            cnt--;
            r = max(v[i].first,r);
        }
        if(cnt == 0) {
            ans += r-l+1ll;
            l = -1, r = 0;
        }
    }
    cout << ans << endl;
    return 0;
}

Compilation message

strange_device.cpp: In function 'int main()':
strange_device.cpp:53:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |     for(int i = 0; i < v.size(); i++) {
      |                    ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 4 ms 1504 KB Output is correct
3 Correct 4 ms 1504 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 500 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 1504 KB Output is correct
17 Correct 44 ms 8908 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 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 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 272 ms 68344 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 388 ms 75912 KB Output is correct
3 Correct 404 ms 75772 KB Output is correct
4 Correct 365 ms 75944 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 388 ms 75912 KB Output is correct
3 Correct 404 ms 75772 KB Output is correct
4 Correct 365 ms 75944 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 392 ms 76192 KB Output is correct
7 Correct 395 ms 77016 KB Output is correct
8 Correct 383 ms 76200 KB Output is correct
9 Correct 437 ms 75724 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 388 ms 75912 KB Output is correct
3 Correct 404 ms 75772 KB Output is correct
4 Correct 365 ms 75944 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 43 ms 9420 KB Output is correct
7 Correct 41 ms 10452 KB Output is correct
8 Correct 37 ms 9684 KB Output is correct
9 Correct 41 ms 10564 KB Output is correct
10 Correct 38 ms 8900 KB Output is correct
11 Correct 40 ms 10196 KB Output is correct
12 Correct 36 ms 9168 KB Output is correct
13 Correct 44 ms 8856 KB Output is correct
14 Correct 39 ms 10708 KB Output is correct
15 Correct 42 ms 9940 KB Output is correct
16 Correct 41 ms 9280 KB Output is correct
17 Correct 44 ms 8916 KB Output is correct
18 Correct 398 ms 76448 KB Output is correct
19 Correct 380 ms 75992 KB Output is correct
20 Correct 478 ms 67588 KB Output is correct
21 Correct 43 ms 8732 KB Output is correct
22 Correct 33 ms 8392 KB Output is correct
23 Correct 104 ms 30644 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 41 ms 10196 KB Output is correct
3 Correct 40 ms 9160 KB Output is correct
4 Correct 565 ms 75572 KB Output is correct
5 Correct 42 ms 9364 KB Output is correct
6 Correct 43 ms 9020 KB Output is correct
7 Correct 41 ms 9760 KB Output is correct
8 Correct 43 ms 9956 KB Output is correct
9 Correct 41 ms 9632 KB Output is correct
10 Correct 43 ms 9656 KB Output is correct
11 Correct 41 ms 10448 KB Output is correct
12 Correct 37 ms 10444 KB Output is correct
13 Correct 43 ms 9724 KB Output is correct
14 Correct 437 ms 77228 KB Output is correct
15 Correct 44 ms 8896 KB Output is correct
16 Correct 380 ms 75936 KB Output is correct
17 Correct 389 ms 77044 KB Output is correct
18 Correct 0 ms 344 KB Output is correct

Subtask #8
0 / 30.0

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