oj.uz

답안 #252126

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252126 2020-07-24T09:25:12 Z Sugardorj 이상한 기계 (APIO19_strange_device) C++14
15 / 100
 2528 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){

        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;
    }
    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;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 63 ms 12280 KB Output is correct
3 Correct 88 ms 17912 KB Output is correct
4 Incorrect 0 ms 384 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 0 ms 256 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 2 ms 384 KB Output is correct
5 Correct 1457 ms 376 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 2343 ms 63100 KB Output is correct
3 Correct 2406 ms 63288 KB Output is correct
4 Correct 2449 ms 63352 KB Output is correct

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 2343 ms 63100 KB Output is correct
3 Correct 2406 ms 63288 KB Output is correct
4 Correct 2449 ms 63352 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Runtime error 2528 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 1 ms 256 KB Output is correct
2 Correct 2343 ms 63100 KB Output is correct
3 Correct 2406 ms 63288 KB Output is correct
4 Correct 2449 ms 63352 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 414 ms 62824 KB Output is correct
7 Runtime error 2055 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 0 ms 256 KB Output is correct
2 Runtime error 1517 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 63 ms 12280 KB Output is correct
3 Correct 88 ms 17912 KB Output is correct
4 Incorrect 0 ms 384 KB Output isn't correct
5 Halted 0 ms 0 KB -