oj.uz

답안 #252642

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252642 2020-07-26T02:52:52 Z Badrangiikh 이상한 기계 (APIO19_strange_device) C++14
10 / 100
 2216 ms 20964 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 [ 2000045 ] ;
long long a [ 300045 ] ;
long long b [ 200045 ] ;
long long c [ 200045 ] ;
map < long long , long long > mp ;

int main() {
    cin >> n >> x >> y ;
    z = __gcd ( x , y + 1 ) ;
    k = ( x / z ) * y ;
    x = 0 ;
    y = 0 ;
    for ( i = 1 ; i <= n ; i ++ ) {
        cin >> l >> r ;
        if ( r - l + 1 >= k ) {
            x ++ ;
            y ++ ;
            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 ;
        }
    }
    if ( y > 0 ) {
        printf ( "%lld" , k ) ;
        exit (0) ;
    }
    sort ( aa + 1 , aa + x + 1 ) ;
    r = aa [ 1 ] . second ;
    ans = k - aa [ 1 ] . first ; 
    for ( i = 2 ; i <= x ; i ++ ) {
        if ( aa [ i ] . first > r + 1 ) {
            ans -= ( aa [ i ] . first - r - 1 ) ;
        }
        r = aa [ i ] . second ;
    }
    ans -= ( k - 1 - aa [ x ] . second ) ;
    printf ( "%lld" , ans ) ;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 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

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

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 512 KB Output is correct
2 Correct 2089 ms 20964 KB Output is correct
3 Correct 2093 ms 20756 KB Output is correct
4 Correct 2078 ms 20732 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 512 KB Output is correct
2 Correct 2089 ms 20964 KB Output is correct
3 Correct 2093 ms 20756 KB Output is correct
4 Correct 2078 ms 20732 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 2119 ms 20912 KB Output is correct
7 Correct 2076 ms 20728 KB Output is correct
8 Correct 2077 ms 20728 KB Output is correct
9 Correct 2135 ms 18808 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 512 KB Output is correct
2 Correct 2089 ms 20964 KB Output is correct
3 Correct 2093 ms 20756 KB Output is correct
4 Correct 2078 ms 20732 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 208 ms 5676 KB Output is correct
7 Correct 212 ms 5624 KB Output is correct
8 Correct 208 ms 5624 KB Output is correct
9 Correct 210 ms 5624 KB Output is correct
10 Correct 206 ms 5624 KB Output is correct
11 Correct 219 ms 5624 KB Output is correct
12 Correct 213 ms 5624 KB Output is correct
13 Correct 212 ms 5628 KB Output is correct
14 Correct 209 ms 5624 KB Output is correct
15 Incorrect 227 ms 5624 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 212 ms 5624 KB Output is correct
3 Correct 224 ms 5624 KB Output is correct
4 Correct 2216 ms 20472 KB Output is correct
5 Correct 212 ms 5624 KB Output is correct
6 Correct 228 ms 5728 KB Output is correct
7 Correct 220 ms 5624 KB Output is correct
8 Correct 213 ms 5624 KB Output is correct
9 Correct 212 ms 5752 KB Output is correct
10 Correct 215 ms 5624 KB Output is correct
11 Correct 219 ms 5624 KB Output is correct
12 Correct 208 ms 5608 KB Output is correct
13 Correct 211 ms 5624 KB Output is correct
14 Incorrect 2146 ms 20728 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

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