oj.uz

답안 #440415

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
440415 2021-07-02T08:57:40 Z DJeniUp 이상한 기계 (APIO19_strange_device) C++17
0 / 100
 197 ms 13072 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll,ll>pairll;
typedef pair<ll,pairll>pairlll;
typedef pair<pairll,pairll>pairllll;
typedef long double ld;
typedef pair<ll,string>pairls;

#define INF 1000000000000007
#define pb push_back
#define fr first
#define sc second

ll n,a,b,m,g;

struct D{
    ll x,y;
}d[100007],t[400007];

bool mcp(D d1, D d2){
    return d1.x<d2.x;
}

int main()
{
    cin>>n>>a>>b;
    ll k=__gcd(a,b+1);
    k=a/k;
    k*=b;
    for(int i=1;i<=n;i++){
        cin>>d[i].x>>d[i].y;
        d[i].y++;
        if(d[i].y-d[i].x>=k){
            m++;
            t[m]={0,1};
            m++;
            t[m]={k,-1};
        }else{
            d[i].x%=k;
            d[i].y%=k;
            m++;
            if(d[i].x<=d[i].y){
                m++;
                t[m]={d[i].x,1};
                m++;
                t[m]={d[i].y,-1};
            }else{
                m++;
                t[m]={d[i].x,1};
                m++;
                t[m]={d[i].y,-1};
                m++;
                t[m]={0,1};
                m++;
                t[m]={k,-1};
            }
        }
    }

    m++;
    t[m].x=k;
    sort(t+1,t+1+m,mcp);
    ll r=0;
    ll h=0;
    t[0].x=0;
    for(int i=1;i<=m;i++){
        if(h!=0){
            r+=(t[i].x-t[i-1].x);
        }
        h+=(t[i].y);
    }
    cout<<r<<endl;

    return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 21 ms 844 KB Output is correct
3 Correct 22 ms 860 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 20 ms 860 KB Output is correct
17 Correct 197 ms 6468 KB Output is correct
18 Incorrect 0 ms 204 KB Output isn't correct

Subtask #2
0 / 5.0

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

Subtask #3
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Runtime error 111 ms 13032 KB Execution killed with signal 11

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Runtime error 159 ms 13056 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Runtime error 159 ms 13056 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Runtime error 159 ms 13056 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 168 ms 6456 KB Output is correct
3 Correct 191 ms 6440 KB Output is correct
4 Runtime error 152 ms 13072 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 21 ms 844 KB Output is correct
3 Correct 22 ms 860 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 20 ms 860 KB Output is correct
17 Correct 197 ms 6468 KB Output is correct
18 Incorrect 0 ms 204 KB Output isn't correct