oj.uz

Submission #402060

# Submission time Handle Problem Language Result Execution time Memory
402060 2021-05-11T09:10:31 Z Blobo2_Blobo2 Strange Device (APIO19_strange_device) C++14
5 / 100
 645 ms 29688 KB 
/*
Editor: Abdelrahman Hossam
Nickname: Blobo2_Blobo2
IOI next year isA :)
*/

//#pragma GCC optimize ("O3")
//#pragma GCC optimize ("unroll-loops")
#include<bits/stdc++.h>
#define int long long
#define endl "\n"
#define all(v)  v.begin(),v.end()
#define gen(arr,n,nxt)  generate(arr,arr+n,nxt)
#define base ios_base::sync_with_stdio(false);cin.tie(0);

using namespace std;
const int mo=1e9+7;
int nxt(){int x;cin>>x;return x;}

signed main(){
    base
    int n=nxt(),a=nxt(),b=nxt();
    int x=a*b;
    vector<pair<int,int> >v;
    if(a!=x/b)
        for(int i=0;i<n;i++)
            v.push_back({nxt(),nxt()});
    else{
        bool flag=0;
        for(int i=0;i<n;i++){
            int first=nxt(),sec=nxt();
            if(sec-first==x)flag=1;
            else if(sec%x<first%x){
                first%=x;
                sec%=x;
                v.push_back({first,x-1});
                v.push_back({0,sec});
            }
            else v.push_back({first%x,sec%x});
        }
        if(flag){
            cout<<x<<endl;
            return 0;
        }
    }
    sort(all(v));
    int cnt=0,now=-1;
    for(int i=0;i<v.size();i++){
        if(now==-1){
            now=v[i].second+1;
            cnt+=v[i].second-v[i].first+1;
        }
        else if(now>=v[i].second)
            continue;
        else if(now<v[i].first){
            cnt+=v[i].second-v[i].first+1;
            now=v[i].second+1;
        }
        else if(now>=v[i].first){
            cnt+=v[i].second-now+1;
            now=v[i].second+1;
        }
    }
    cout<<cnt<<endl;
    return 0;
}

Compilation message

strange_device.cpp: In function 'int main()':
strange_device.cpp:48: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]
   48 |     for(int i=0;i<v.size();i++){
      |                 ~^~~~~~~~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 308 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 1 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 353 ms 17828 KB Output is correct

Subtask #4
0 / 5.0

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

Subtask #5
0 / 5.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 58 ms 5692 KB Output is correct
3 Correct 63 ms 5652 KB Output is correct
4 Correct 645 ms 25424 KB Output is correct
5 Correct 52 ms 5820 KB Output is correct
6 Correct 52 ms 5624 KB Output is correct
7 Correct 52 ms 5628 KB Output is correct
8 Correct 56 ms 5688 KB Output is correct
9 Correct 51 ms 5692 KB Output is correct
10 Correct 51 ms 5680 KB Output is correct
11 Correct 53 ms 5652 KB Output is correct
12 Correct 48 ms 5668 KB Output is correct
13 Correct 51 ms 5692 KB Output is correct
14 Correct 527 ms 29688 KB Output is correct
15 Incorrect 54 ms 5608 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

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