oj.uz

답안 #131656

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
131656 2019-07-17T11:45:52 Z Swan 이상한 기계 (APIO19_strange_device) C++14
5 / 100
 733 ms 18140 KB 
#include <bits/stdc++.h>
#define stop system("pause")
#define INP freopen("promote.in","r",stdin)
#define OUTP freopen("promote.out","w",stdout)
#define double long double
#define int long long

using namespace std;

bool check(int x){
    return x != -1;
}

map<int,int> qwe;

main()
{
    ios_base::sync_with_stdio(0);
    int n,a,b; cin >> n >> a >> b;
    int lcm;
    double kek = 1.0L*a*b;
    if(kek >= 1e18+228)lcm = 1e18+228;
    else lcm = a*b;
    vector<pair<int,int> > v;
    int res = 0;
    for(int i(0); i < n;i++){
        int l,r; cin >> l >> r;
        /*for(int j(l); j <=r;j++){
            if(qwe.count(j%lcm) == 0)res++;
            qwe[i%lcm]++;
        }*/
        l%=lcm;
        r%=lcm;
        if(l <= r)v.push_back({l,r});
        else{
            if(check(lcm-1))v.push_back({l,lcm-1});
            v.push_back({0,r});
        }
    }
    sort(v.begin(),v.end());
    int ans = 0;
    int lastx,lasty; lastx = lasty = -1;
    for(int i(0); i < v.size();i++){
        int nx,ny;
        nx = max(lasty+1,v[i].first);
        ny = max(lasty,v[i].second);
        if(nx >= lcm || nx >ny)continue;
        ans+=ny-nx+1;
        lastx = nx;
        lasty = ny;
    }
    cout << ans;
    return 0;
}
/*
3 1000000000000000000 1000000000000000000
2 15
55 123
324 2512
*/

Compilation message

strange_device.cpp:16:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
strange_device.cpp: In function 'int main()':
strange_device.cpp:43:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i(0); i < v.size();i++){
                   ~~^~~~~~~~~~
strange_device.cpp:25:9: warning: unused variable 'res' [-Wunused-variable]
     int res = 0;
         ^~~
strange_device.cpp:42:9: warning: variable 'lastx' set but not used [-Wunused-but-set-variable]
     int lastx,lasty; lastx = lasty = -1;
         ^~~~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 432 KB Output is correct
5 Correct 466 ms 18140 KB Output is correct

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 733 ms 17732 KB Output is correct
3 Incorrect 628 ms 17472 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 733 ms 17732 KB Output is correct
3 Incorrect 628 ms 17472 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 733 ms 17732 KB Output is correct
3 Incorrect 628 ms 17472 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 68 ms 3096 KB Output is correct
3 Correct 68 ms 3056 KB Output is correct
4 Correct 687 ms 17544 KB Output is correct
5 Correct 81 ms 3312 KB Output is correct
6 Correct 69 ms 3308 KB Output is correct
7 Correct 68 ms 3312 KB Output is correct
8 Correct 69 ms 3312 KB Output is correct
9 Correct 68 ms 3312 KB Output is correct
10 Correct 70 ms 3284 KB Output is correct
11 Correct 158 ms 3564 KB Output is correct
12 Correct 65 ms 3440 KB Output is correct
13 Correct 72 ms 3572 KB Output is correct
14 Correct 691 ms 17236 KB Output is correct
15 Incorrect 71 ms 3184 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

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