oj.uz

Submission #252422

# Submission time Handle Problem Language Result Execution time Memory
252422 2020-07-25T14:29:47 Z Badrangiikh Strange Device (APIO19_strange_device) C++14
5 / 100
 506 ms 32504 KB 
#include<bits/stdc++.h>
#include <deque> 
#include <cmath>
using namespace std;
 
#define ll long long 
 
/*freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);*/
 
long long x , y , z , i , j , n , m , k , s1 , s2 , s3 , s4 , s5 , s6 , mod , l , r , t , maxx , minn , sx , so , sum , mid , ans , puk , par , chi , sz , choc1 , choc2 , len , depth ;
double u , v , w , x1 , x2 , x3 , x4 , z1 , z2 , z3 , h , huh ;
string s ;
string q ;
string p ;
string sq [ 1045 ] ;
char ch ;
char cha ;
vector < long long > vc ;
vector < long long > cv ;
vector < long long > vv ;
vector < long long > cc ;
long long dp [ 200045 ] [ 6 ] ;
long long tmp [ 300045 ] ;
pair < long long , long long > aa [ 300045 ] ;
long long a [ 300045 ] ;
long long b [ 200045 ] ;
long long c [ 200045 ] ;
map < long long , long long > mp ;

int main() {
    scanf ( "%lld%lld%lld" , & n , & x , & y ) ;
    z = __gcd ( x , y + 1 ) ;
    k = ( x / z ) * y ;
    x = 0 ;
    for ( i = 1 ; i <= n ; i ++ ) {
        scanf ( "%lld%lld" , & l , & r ) ;
        if ( r - l + 1 >= k ) {
            x ++ ;
            aa [ x ] . first = 0 ;
            aa [ x ] . second = k - 1 ;
        }
        l %= k ;
        r %= k ;
        if ( l <= r ) {
            x ++ ;
            aa [ x ] . first = l ;
            aa [ x ] . second = r ;
        }
        else {
            x ++ ;
            aa [ x ] . first = l ;
            aa [ x ] . second = k - 1 ;
            x ++ ;
            aa [ x ] . first = 0 ;
            aa [ x ] . second = r ;
        }
    }
    sort ( aa + 1 , aa + x + 1 ) ;
    r = 0 ;
    ans = k ;
    for ( i = 1 ; i <= x ; i ++ ) {
        if ( aa [ i ] . first - 1 > r ) {
            ans -= ( aa [ i ] . first - r - 1 ) ;
            r = aa [ i ] . second ;
        }
        else {
            r = aa [ i ] . second ;
        }
    }
    ans -= ( k - 1 - aa [ x ] . second ) ;
    printf ( "%lld" , ans ) ;
}

Compilation message

strange_device.cpp: In function 'int main()':
strange_device.cpp:32:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf ( "%lld%lld%lld" , & n , & x , & y ) ;
     ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
strange_device.cpp:37:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf ( "%lld%lld" , & l , & r ) ;
         ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

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

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
0 / 5.0

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

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 477 ms 16212 KB Output is correct
3 Correct 453 ms 32120 KB Output is correct
4 Correct 463 ms 32248 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 477 ms 16212 KB Output is correct
3 Correct 453 ms 32120 KB Output is correct
4 Correct 463 ms 32248 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 470 ms 32160 KB Output is correct
7 Correct 478 ms 32120 KB Output is correct
8 Correct 463 ms 32376 KB Output is correct
9 Incorrect 506 ms 32504 KB Output isn't correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 477 ms 16212 KB Output is correct
3 Correct 453 ms 32120 KB Output is correct
4 Correct 463 ms 32248 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 46 ms 5652 KB Output is correct
7 Correct 57 ms 5752 KB Output is correct
8 Correct 45 ms 5624 KB Output is correct
9 Correct 46 ms 5624 KB Output is correct
10 Correct 49 ms 5624 KB Output is correct
11 Correct 48 ms 5760 KB Output is correct
12 Correct 46 ms 5684 KB Output is correct
13 Incorrect 48 ms 5624 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Incorrect 51 ms 5624 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

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