oj.uz

답안 #252124

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

        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 (a%2 == 0)
        a/=2;
    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
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 64 ms 12280 KB Output is correct
3 Correct 90 ms 17912 KB Output is correct
4 Correct 2 ms 896 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 8 ms 1152 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 41 ms 7032 KB Output is correct
16 Correct 46 ms 6776 KB Output is correct
17 Correct 228 ms 6604 KB Output is correct
18 Correct 1 ms 384 KB Output is correct

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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 134 ms 32260 KB Output is correct
3 Correct 166 ms 31992 KB Output is correct
4 Correct 131 ms 30736 KB Output is correct
5 Execution timed out 5101 ms 62588 KB Time limit exceeded

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 2339 ms 62888 KB Output is correct
3 Correct 2462 ms 62936 KB Output is correct
4 Correct 2462 ms 62964 KB Output is correct

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 2339 ms 62888 KB Output is correct
3 Correct 2462 ms 62936 KB Output is correct
4 Correct 2462 ms 62964 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Runtime error 2475 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 2339 ms 62888 KB Output is correct
3 Correct 2462 ms 62936 KB Output is correct
4 Correct 2462 ms 62964 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 385 ms 62848 KB Output is correct
7 Runtime error 2097 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 1483 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 64 ms 12280 KB Output is correct
3 Correct 90 ms 17912 KB Output is correct
4 Correct 2 ms 896 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 8 ms 1152 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 41 ms 7032 KB Output is correct
16 Correct 46 ms 6776 KB Output is correct
17 Correct 228 ms 6604 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 0 ms 256 KB Output is correct
25 Correct 134 ms 32260 KB Output is correct
26 Correct 166 ms 31992 KB Output is correct
27 Correct 131 ms 30736 KB Output is correct
28 Execution timed out 5101 ms 62588 KB Time limit exceeded