oj.uz

Submission #782506

# Submission time Handle Problem Language Result Execution time Memory
782506 2023-07-14T03:26:19 Z kebine Strange Device (APIO19_strange_device) C++17
35 / 100
 363 ms 17556 KB 
//         }
//     }
//     return 0;
// }

#include <bits/stdc++.h>
using namespace std;
 
#define v          vector
#define int        long long
#define all(a)     (a).begin(), (a).end()
#define pb         push_back
#define mk         make_pair
#define pii        pair<int, int>
#define ff         first
#define ss         second
#define inp_v(vec) for (auto &i : vec) cin >> i;
#define prt_v(vec) for (auto i : vec) cout << i << endl;
#define MS(x)     memset(x, 0, sizeof(x))
#define gcd(a,b)   __gcd(a, b);
#define lcm(a,b)   (a*(b/gcd(a,b)))
#define lb         lower_bound
#define ub         upper_bound
bool chmin(int &a, int b){return b<a?a=b, true:false;}
bool chmax(int &a, int b){return b>a?a=b, true:false;}
// bool comp(const pair<int, int>&a, const pair<int int>&b){
//     return a.second<b.second;
// }
signed main(){
    ios_base::sync_with_stdio(false); cin.tie(0);
    int N, a, b;cin>>N>>a>>b;
    int cycle=a*b/(__gcd(a, b+1));
    vector<pair<int, int>>segment;
    vector<pair<int, int>>seg;
    bool flag=false;
    for(int i=0;i<N;i++){
        int x, y;cin>>x>>y;
        if(y-x+1>=cycle){
            flag=true;
        }
        if(y>=cycle){
            // cout<<i<<" "<<x<<" "<<cycle<<" "<<y%cycle<<endl;
            if(x>=cycle){
                if(y/cycle>x/cycle){
                    segment.push_back({x%cycle, cycle-1});
                    segment.push_back({0, y%cycle});
                }
                else segment.push_back({x%cycle, y%cycle});
                // segment.push_back({0, y%cycle});
            }
            else{
                segment.push_back({x, cycle-1});
                segment.push_back({0, y%cycle});
            }
        }
        else{
            segment.push_back({x, y});
        }
    }
    sort(segment.begin(), segment.end());
    int curl=-1, curr=-1;
    int ans=0;
    // cout<<cycle<<endl;
    for(int i=0;i<segment.size();i++){
        // cout<<segment[i].first<<" "<<segment[i].second<<endl;
        if(curr>segment[i].second){
            continue;
        }
        else{
            curl=max(curr+1, segment[i].first);
            curr=segment[i].second;
            ans+=curr-curl+1;
        }
    }
    if(flag)cout<<cycle<<endl;
    else cout<<ans<<endl;

    return 0;
}

Compilation message

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

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 4 ms 980 KB Output is correct
3 Correct 4 ms 868 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 288 KB Output is correct
16 Correct 4 ms 856 KB Output is correct
17 Correct 35 ms 2800 KB Output is correct
18 Incorrect 0 ms 212 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 298 ms 16940 KB Output is correct
3 Correct 303 ms 17472 KB Output is correct
4 Correct 315 ms 17412 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 298 ms 16940 KB Output is correct
3 Correct 303 ms 17472 KB Output is correct
4 Correct 315 ms 17412 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 307 ms 17352 KB Output is correct
7 Correct 308 ms 17476 KB Output is correct
8 Correct 328 ms 17364 KB Output is correct
9 Correct 327 ms 17408 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 298 ms 16940 KB Output is correct
3 Correct 303 ms 17472 KB Output is correct
4 Correct 315 ms 17412 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 32 ms 2836 KB Output is correct
7 Correct 33 ms 2888 KB Output is correct
8 Correct 30 ms 3088 KB Output is correct
9 Correct 34 ms 3104 KB Output is correct
10 Correct 34 ms 2908 KB Output is correct
11 Correct 36 ms 3036 KB Output is correct
12 Correct 30 ms 3036 KB Output is correct
13 Correct 32 ms 2904 KB Output is correct
14 Correct 31 ms 2828 KB Output is correct
15 Correct 35 ms 2880 KB Output is correct
16 Correct 33 ms 3004 KB Output is correct
17 Correct 35 ms 2868 KB Output is correct
18 Correct 305 ms 17396 KB Output is correct
19 Correct 303 ms 17348 KB Output is correct
20 Correct 320 ms 17420 KB Output is correct
21 Correct 34 ms 2884 KB Output is correct
22 Correct 29 ms 2780 KB Output is correct
23 Correct 95 ms 9260 KB Output is correct

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 32 ms 2884 KB Output is correct
3 Correct 33 ms 2912 KB Output is correct
4 Correct 363 ms 17448 KB Output is correct
5 Correct 34 ms 2968 KB Output is correct
6 Correct 33 ms 2920 KB Output is correct
7 Correct 37 ms 2980 KB Output is correct
8 Correct 33 ms 2980 KB Output is correct
9 Correct 34 ms 3104 KB Output is correct
10 Correct 33 ms 2848 KB Output is correct
11 Correct 33 ms 2940 KB Output is correct
12 Correct 28 ms 2888 KB Output is correct
13 Correct 33 ms 2960 KB Output is correct
14 Correct 360 ms 17484 KB Output is correct
15 Correct 34 ms 2948 KB Output is correct
16 Correct 306 ms 17400 KB Output is correct
17 Correct 322 ms 17556 KB Output is correct
18 Incorrect 1 ms 212 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 4 ms 980 KB Output is correct
3 Correct 4 ms 868 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 288 KB Output is correct
16 Correct 4 ms 856 KB Output is correct
17 Correct 35 ms 2800 KB Output is correct
18 Incorrect 0 ms 212 KB Output isn't correct
19 Halted 0 ms 0 KB -