oj.uz

답안 #589028

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
589028 2022-07-04T08:54:36 Z ParsaEs Event Hopping (BOI22_events) C++17
50 / 100
 1500 ms 4044 KB 
//InTheNameOfGOD
//PRS;)
#pragma GCC optimize("unroll-loops", "Ofast", "O3")
#include<iostream>
#include<algorithm>
#define rep(i, l, r) for(ll i = l; i < r; i++)
#define min(x, y) (x < y ? x : y)
#define max(x, y) (x > y ? x : y)
#define X first
#define Y second
typedef int ll;
using namespace std;
typedef pair<ll, ll> pl;
typedef pair<ll, pl> pi;
constexpr ll inf = 2e9, xn = 1e5 + 5, s = 317;
ll d[xn], p[xn], sx[xn], x[xn], m[s];
pi e[xn];
int main()
{
    ll n, q;
    scanf("%d %d", &n, &q);
    rep(i, 0, n) scanf("%d %d", &e[i].Y.X, &e[i].X), e[i] = {-e[i].X, {-e[i].Y.X, i}};
    sort(e, e + n);
    rep(i, 0, s) m[i] = -inf;
    rep(i, 0, n)
    {
        sx[i] = x[i] = -1;
        rep(j, 0, i / s + 1) if(e[i].X <= m[j])
        {
            rep(k, j * s, min((j + 1) * s, i)) if(e[i].X <= e[k].Y.X)
            {
                if(k / s < i / s) sx[i] = k, d[i] = 1;
                else if(sx[k] >= 0) sx[i] = sx[k], d[i] = d[k] + 1;
                x[i] = k;
                break;
            }
            break;
        }
        m[i / s] = max(e[i].Y.X, m[i / s]), p[e[i].Y.Y] = i;
    }
    while(q--)
    {
        ll l, r, ans = 0;
        scanf("%d %d", &l, &r);
        if(l == r)
        {
            printf("0\n");
            continue;
        }
        l = p[l - 1], r = p[r - 1];
        if(e[l].X < e[r].X)
        {
            printf("impossible\n");
            continue;
        }
        if(e[l].X == e[r].X)
        {
            printf("1\n");
            continue;
        }
        while(sx[l] >= r) ans += d[l], l = sx[l];
        while(x[l] >= r) l = x[l], ans++;
        if(r == l)
        {
            printf("%d\n", ans);
            continue;
        }
        if(x[l] < 0)
        {
            printf("impossible\n");
            continue;
        }
        ll z = e[r].Y.X, mx = e[r].Y.X;
        bool f = 1;
        rep(i, r + 1, l + 1)
        {
            if(z < e[i].X && mx < e[i].X)
            {
                f = 0;
                break;
            }
            if(z < e[i].X) z = mx, ans++;
            mx = max(mx, e[i].Y.X);
        }
        if(f) printf("%d\n", ans + 1);
        else printf("impossible\n");
    }
}

Compilation message

events.cpp: In function 'int main()':
events.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |     scanf("%d %d", &n, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~~
events.cpp:22:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     rep(i, 0, n) scanf("%d %d", &e[i].Y.X, &e[i].X), e[i] = {-e[i].X, {-e[i].Y.X, i}};
      |                  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
events.cpp:44:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |         scanf("%d %d", &l, &r);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 258 ms 3532 KB Output is correct
3 Correct 230 ms 3508 KB Output is correct
4 Correct 168 ms 3540 KB Output is correct
5 Correct 242 ms 3640 KB Output is correct
6 Correct 279 ms 3576 KB Output is correct
7 Correct 260 ms 3784 KB Output is correct
8 Correct 57 ms 4044 KB Output is correct
9 Correct 64 ms 3636 KB Output is correct
10 Correct 106 ms 3944 KB Output is correct
11 Correct 97 ms 3988 KB Output is correct
12 Correct 114 ms 4036 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 403 ms 904 KB Output is correct
20 Correct 82 ms 844 KB Output is correct
21 Correct 112 ms 1136 KB Output is correct
22 Correct 86 ms 1188 KB Output is correct
23 Correct 130 ms 1004 KB Output is correct
24 Correct 119 ms 1048 KB Output is correct
25 Correct 37 ms 648 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 42 ms 3020 KB Output is correct
20 Correct 33 ms 3028 KB Output is correct
21 Correct 43 ms 3020 KB Output is correct
22 Correct 42 ms 2992 KB Output is correct
23 Correct 35 ms 3020 KB Output is correct
24 Correct 40 ms 3028 KB Output is correct
25 Correct 20 ms 2960 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 233 ms 3620 KB Output is correct
2 Correct 223 ms 3576 KB Output is correct
3 Correct 156 ms 3592 KB Output is correct
4 Correct 72 ms 3696 KB Output is correct
5 Correct 95 ms 3976 KB Output is correct
6 Correct 110 ms 3728 KB Output is correct
7 Correct 151 ms 3752 KB Output is correct
8 Correct 90 ms 3868 KB Output is correct
9 Correct 32 ms 3004 KB Output is correct
10 Correct 178 ms 3416 KB Output is correct
11 Execution timed out 1584 ms 3284 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 258 ms 3532 KB Output is correct
3 Correct 230 ms 3508 KB Output is correct
4 Correct 168 ms 3540 KB Output is correct
5 Correct 242 ms 3640 KB Output is correct
6 Correct 279 ms 3576 KB Output is correct
7 Correct 260 ms 3784 KB Output is correct
8 Correct 57 ms 4044 KB Output is correct
9 Correct 64 ms 3636 KB Output is correct
10 Correct 106 ms 3944 KB Output is correct
11 Correct 97 ms 3988 KB Output is correct
12 Correct 114 ms 4036 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 403 ms 904 KB Output is correct
32 Correct 82 ms 844 KB Output is correct
33 Correct 112 ms 1136 KB Output is correct
34 Correct 86 ms 1188 KB Output is correct
35 Correct 130 ms 1004 KB Output is correct
36 Correct 119 ms 1048 KB Output is correct
37 Correct 37 ms 648 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 304 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 42 ms 3020 KB Output is correct
48 Correct 33 ms 3028 KB Output is correct
49 Correct 43 ms 3020 KB Output is correct
50 Correct 42 ms 2992 KB Output is correct
51 Correct 35 ms 3020 KB Output is correct
52 Correct 40 ms 3028 KB Output is correct
53 Correct 20 ms 2960 KB Output is correct
54 Correct 233 ms 3620 KB Output is correct
55 Correct 223 ms 3576 KB Output is correct
56 Correct 156 ms 3592 KB Output is correct
57 Correct 72 ms 3696 KB Output is correct
58 Correct 95 ms 3976 KB Output is correct
59 Correct 110 ms 3728 KB Output is correct
60 Correct 151 ms 3752 KB Output is correct
61 Correct 90 ms 3868 KB Output is correct
62 Correct 32 ms 3004 KB Output is correct
63 Correct 178 ms 3416 KB Output is correct
64 Execution timed out 1584 ms 3284 KB Time limit exceeded
65 Halted 0 ms 0 KB -