oj.uz

답안 #252131

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252131 2020-07-24T09:42:05 Z Sugardorj 이상한 기계 (APIO19_strange_device) C++14
15 / 100
 2490 ms 524292 KB 
#include <bits/stdc++.h>
using namespace std;
long long i,j,a,b,tt;
long long x,r,m,n,s,t,k,l,y,z,v=234560;
set <pair<long long,long long>> p,c,d,e;
int main(){
    cin >> n>>a>>b;
    if (n == 1){
        cin >>x>>y;
        l = y-x+1;
        if (l/a < b){
            cout << l;
        }
        else cout << a*b;
        return 0;
    }
    if (b ==1||a*b<=1000000){
        if (b == 1&&a%2 == 0)
            a/=2;
        a=b*a;
        for (i = 0; i<n; i ++){
            cin >>x>>y;
            if (y-x+1>=a){
                cout << a;
                return 0;
            }
            x%=a;
            y%=a;
            if (x <=y){
                p.insert({x,y});
            }
            else {
                p.insert({0,y});
                p.insert({x,a-1});
            }
        }
        t = -1;
        while (p.size()){
            auto u=*p.begin();
            p.erase(*p.begin());
            x=u.first;
            y=u.second;
            t=max(t,x-1);
            s+=max(y-t,0ll);
            t=max(y,t);
        }
        cout << s;
        return 0;
    }
    for (i = 0; i<n; i ++){
        cin >>x>>y;
        for (j = x; j<=y; j ++){
            l = (j+j/b)%a;
            m=j%b;
            p.insert({l,m});
        }
    }
    cout << p.size();
    return 0;
}

Subtask #1
0 / 10.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 1464 ms 356 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 2383 ms 62900 KB Output is correct
3 Correct 2427 ms 63076 KB Output is correct
4 Correct 2447 ms 63024 KB Output is correct

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 2383 ms 62900 KB Output is correct
3 Correct 2427 ms 63076 KB Output is correct
4 Correct 2447 ms 63024 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Runtime error 2490 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
7 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 2383 ms 62900 KB Output is correct
3 Correct 2427 ms 63076 KB Output is correct
4 Correct 2447 ms 63024 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 410 ms 62880 KB Output is correct
7 Runtime error 2138 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
8 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Runtime error 1480 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

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