oj.uz

답안 #252118

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252118 2020-07-24T09:11:45 Z khangal 이상한 기계 (APIO19_strange_device) C++14
5 / 100
 2471 ms 167024 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<long long> vl;
typedef pair<long long , long long > pl;
const int N=1e6+1;
#define po pop_back
#define pb push_back
#define mk make_pair
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define boost ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18 
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,x,y,r,z,h,a[1234567],w,c1[1234][1234];
bool used[1234567],used1[1234567];
pl p[1234567];
string s,s1[1234567];
map<ll,ll> mp;
map<pl,ll> mpl;
vector<pl> vec,vec1,ansvec;
vector<ll> v[1234567],v1[1234567];
vector<ll> vp[1234567];
set<pl> st;
set<ll> stl,str;
stack <ll> sta;
int main(){
    ll A,B;
    cin>>n>>A>>B;
    // if(B==1){
    // }
    // while(n--){
    //     cin>>l>>r;
    //     for(ll i=l;i<=r;i++){
    //         x = (i+(i/B))%A;
    //         y = i%B;
    //         st.insert({x,y});
    //     }
    // }
    // cout<<st.size();
    ll t = A*B;
    while(n--) {
        cin>>l>>r;
        if(r - l + 1 >= t)
            return cout << t , 0;
        l %= t, r %= t;
        if(l > r){
            vec.pb({l , -1});
            vec.pb({t , 1});
            vec.pb({0 , -1});
            vec.pb({r + 1 , 1});
        }
        else{
            vec.pb({l, -1});
            vec.pb({r + 1, 1});
        }
    }
    sort(vec.begin() , vec.end());
    for(auto i : vec){
        if(i.ss == 1) {
            if(sta.size() == 1)
                ans += i.ff - sta.top();
            sta.pop();
        }
        else
            sta.push(i.ff);
    }
    cout<<ans;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 125944 KB Output is correct
2 Correct 101 ms 126580 KB Output is correct
3 Correct 91 ms 126580 KB Output is correct
4 Incorrect 68 ms 125944 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 125944 KB Output is correct
2 Correct 70 ms 125944 KB Output is correct
3 Correct 69 ms 125944 KB Output is correct
4 Correct 69 ms 125936 KB Output is correct
5 Incorrect 71 ms 125944 KB Output isn't correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 125944 KB Output is correct
2 Correct 72 ms 126076 KB Output is correct
3 Correct 72 ms 126072 KB Output is correct
4 Correct 72 ms 126072 KB Output is correct
5 Correct 1660 ms 166560 KB Output is correct

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 125944 KB Output is correct
2 Correct 2305 ms 159112 KB Output is correct
3 Incorrect 2285 ms 167024 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 125944 KB Output is correct
2 Correct 2305 ms 159112 KB Output is correct
3 Incorrect 2285 ms 167024 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 125944 KB Output is correct
2 Correct 2305 ms 159112 KB Output is correct
3 Incorrect 2285 ms 167024 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 125852 KB Output is correct
2 Correct 302 ms 133024 KB Output is correct
3 Correct 301 ms 132872 KB Output is correct
4 Correct 2471 ms 166464 KB Output is correct
5 Correct 297 ms 132964 KB Output is correct
6 Correct 299 ms 132964 KB Output is correct
7 Correct 302 ms 133160 KB Output is correct
8 Correct 301 ms 132836 KB Output is correct
9 Correct 303 ms 133012 KB Output is correct
10 Correct 299 ms 132964 KB Output is correct
11 Correct 312 ms 132992 KB Output is correct
12 Correct 292 ms 132836 KB Output is correct
13 Correct 303 ms 133012 KB Output is correct
14 Correct 2411 ms 166720 KB Output is correct
15 Incorrect 300 ms 132992 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 125944 KB Output is correct
2 Correct 101 ms 126580 KB Output is correct
3 Correct 91 ms 126580 KB Output is correct
4 Incorrect 68 ms 125944 KB Output isn't correct
5 Halted 0 ms 0 KB -