oj.uz

답안 #252656

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252656 2020-07-26T04:26:25 Z Badrangiikh 이상한 기계 (APIO19_strange_device) C++14
0 / 100
 2144 ms 32148 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 ;
pair < long long , long long > aa [ 2000045 ] ;

int main() {
    cin >> n >> x >> y ;
    z = x / ( __gcd ( x , y + 1 ) ) ;
    if ( z > 1000000000000000000 / y ) {
        k = 1000000000000000001 ;
    }
    else {
        k = z * y ;
    }
    x = 0 ;
    for ( i = 1 ; i <= n ; i ++ ) {
        cin >> l >> y ;
        if ( r - l + 1 >= k ) {
            cout << k ;
            exit (0) ;
        }
        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 = -1 ;
    ans = 0 ;
    for ( i = 1 ; i <= x ; i ++ ) {
        r = max ( r , aa [ i ] . first - 1 ) ;
        ans += max ( aa [ i ] . second - r , so ) ;
        r = max ( aa [ i ] . second , r ) ;
    }
    cout << ans ;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Incorrect 21 ms 640 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Incorrect 0 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Incorrect 3 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 2144 ms 32148 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 2144 ms 32148 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 2144 ms 32148 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Incorrect 225 ms 3384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Incorrect 21 ms 640 KB Output isn't correct
3 Halted 0 ms 0 KB -