oj.uz

Submission #611885

# Submission time Handle Problem Language Result Execution time Memory
611885 2022-07-29T08:19:11 Z 반딧불(#8497) Tenis (COI19_tenis) C++17
100 / 100
 435 ms 9996 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

struct segTree{
    pair<int, int> tree[400002];
    int lazy[400002];

    void init(int i, int l, int r){
        if(l==r){
            tree[i] = make_pair(0, l);
            return;
        }
        int m = (l+r)>>1;
        init(i*2, l, m);
        init(i*2+1, m+1, r);
        tree[i] = min(tree[i*2], tree[i*2+1]);
    }

    void propagate(int i, int l, int r){
        tree[i].first += lazy[i];
        if(l!=r) lazy[i*2] += lazy[i], lazy[i*2+1] += lazy[i];
        lazy[i] = 0;
    }

    void update(int i, int l, int r, int s, int e, int v){
        propagate(i, l, r);
        if(r<s || e<l) return;
        if(s<=l && r<=e){
            lazy[i] = v;
            propagate(i, l, r);
            return;
        }
        int m = (l+r)>>1;
        update(i*2, l, m, s, e, v);
        update(i*2+1, m+1, r, s, e, v);
        tree[i] = min(tree[i*2], tree[i*2+1]);
    }

    pair<int, int> query(int i, int l, int r, int s, int e){
        propagate(i, l, r);
        if(r<s || e<l) return make_pair(INT_MAX, 0);
        if(s<=l && r<=e) return tree[i];
        int m = (l+r)>>1;
        return min(query(i*2, l, m, s, e), query(i*2+1, m+1, r, s, e));
    }
} tree;

int n, q;
int ranking[100002][3]; /// court j���� i�� ����ΰ�
int place[100002][3]; /// court j���� i���� �����ΰ�
ll weight[100002];

void makeWeight(){
    random_device rd;
    mt19937_64 gen(rd());
    uniform_int_distribution<ll> dst(1, 1000000);
    for(int i=1; i<=n; i++) weight[i] = dst(gen);
}

void upd(int i, int v){
    int l = min({ranking[i][0], ranking[i][1], ranking[i][2]});
    int r = max({ranking[i][0], ranking[i][1], ranking[i][2]}) - 1;
    tree.update(1, 1, n, l, r, v);
}

int main(){
    scanf("%d %d", &n, &q);
    for(int i=0; i<3; i++) for(int j=1; j<=n; j++){
        int x;
        scanf("%d", &x);
        ranking[x][i] = j;
        place[j][i] = x;
    }
    makeWeight();
    tree.init(1, 1, n);
    for(int i=1; i<=n; i++){
        upd(i, 1);
    }

    while(q--){
        int qt;
        scanf("%d", &qt);
        if(qt==1){ /// ����
            int x;
            scanf("%d", &x);
            int lim = tree.query(1, 1, n, 1, n).second;
            if(min({ranking[x][0], ranking[x][1], ranking[x][2]}) <= lim) puts("DA");
            else puts("NE");
        }
        else{ /// ������Ʈ
            int x, a, b;
            scanf("%d %d %d", &x, &a, &b);
            upd(a, -1);
            upd(b, -1);
            swap(place[ranking[a][x-1]][x-1], place[ranking[b][x-1]][x-1]);
            swap(ranking[a][x-1], ranking[b][x-1]);
            upd(a, 1);
            upd(b, 1);
        }
    }
}

Compilation message

tenis.cpp: In function 'int main()':
tenis.cpp:70:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |     scanf("%d %d", &n, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~~
tenis.cpp:73:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |         scanf("%d", &x);
      |         ~~~~~^~~~~~~~~~
tenis.cpp:85:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   85 |         scanf("%d", &qt);
      |         ~~~~~^~~~~~~~~~~
tenis.cpp:88:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   88 |             scanf("%d", &x);
      |             ~~~~~^~~~~~~~~~
tenis.cpp:95:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   95 |             scanf("%d %d %d", &x, &a, &b);
      |             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3440 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 3 ms 3444 KB Output is correct
6 Correct 3 ms 3444 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3440 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 3 ms 3444 KB Output is correct
6 Correct 3 ms 3444 KB Output is correct
7 Correct 3 ms 3412 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 2 ms 3516 KB Output is correct
10 Correct 3 ms 3412 KB Output is correct
11 Correct 4 ms 3448 KB Output is correct
12 Correct 3 ms 3452 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3440 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 3 ms 3444 KB Output is correct
6 Correct 3 ms 3444 KB Output is correct
7 Correct 3 ms 3412 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 2 ms 3516 KB Output is correct
10 Correct 3 ms 3412 KB Output is correct
11 Correct 4 ms 3448 KB Output is correct
12 Correct 3 ms 3452 KB Output is correct
13 Correct 82 ms 9104 KB Output is correct
14 Correct 84 ms 9136 KB Output is correct
15 Correct 95 ms 9028 KB Output is correct
16 Correct 108 ms 9044 KB Output is correct
17 Correct 64 ms 9108 KB Output is correct
18 Correct 73 ms 9116 KB Output is correct
19 Correct 62 ms 9088 KB Output is correct
20 Correct 80 ms 9020 KB Output is correct
21 Correct 67 ms 9036 KB Output is correct
22 Correct 69 ms 9104 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 9996 KB Output is correct
2 Correct 91 ms 9476 KB Output is correct
3 Correct 138 ms 9492 KB Output is correct
4 Correct 88 ms 9552 KB Output is correct
5 Correct 89 ms 9488 KB Output is correct
6 Correct 85 ms 9560 KB Output is correct
7 Correct 132 ms 9456 KB Output is correct
8 Correct 85 ms 9676 KB Output is correct
9 Correct 100 ms 9520 KB Output is correct
10 Correct 129 ms 9508 KB Output is correct
11 Correct 109 ms 9472 KB Output is correct
12 Correct 116 ms 9624 KB Output is correct
13 Correct 103 ms 9504 KB Output is correct
14 Correct 99 ms 9512 KB Output is correct
15 Correct 114 ms 9516 KB Output is correct

Subtask #5
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3440 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 3 ms 3444 KB Output is correct
6 Correct 3 ms 3444 KB Output is correct
7 Correct 3 ms 3412 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 2 ms 3516 KB Output is correct
10 Correct 3 ms 3412 KB Output is correct
11 Correct 4 ms 3448 KB Output is correct
12 Correct 3 ms 3452 KB Output is correct
13 Correct 82 ms 9104 KB Output is correct
14 Correct 84 ms 9136 KB Output is correct
15 Correct 95 ms 9028 KB Output is correct
16 Correct 108 ms 9044 KB Output is correct
17 Correct 64 ms 9108 KB Output is correct
18 Correct 73 ms 9116 KB Output is correct
19 Correct 62 ms 9088 KB Output is correct
20 Correct 80 ms 9020 KB Output is correct
21 Correct 67 ms 9036 KB Output is correct
22 Correct 69 ms 9104 KB Output is correct
23 Correct 88 ms 9996 KB Output is correct
24 Correct 91 ms 9476 KB Output is correct
25 Correct 138 ms 9492 KB Output is correct
26 Correct 88 ms 9552 KB Output is correct
27 Correct 89 ms 9488 KB Output is correct
28 Correct 85 ms 9560 KB Output is correct
29 Correct 132 ms 9456 KB Output is correct
30 Correct 85 ms 9676 KB Output is correct
31 Correct 100 ms 9520 KB Output is correct
32 Correct 129 ms 9508 KB Output is correct
33 Correct 109 ms 9472 KB Output is correct
34 Correct 116 ms 9624 KB Output is correct
35 Correct 103 ms 9504 KB Output is correct
36 Correct 99 ms 9512 KB Output is correct
37 Correct 114 ms 9516 KB Output is correct
38 Correct 265 ms 9140 KB Output is correct
39 Correct 150 ms 9300 KB Output is correct
40 Correct 294 ms 9332 KB Output is correct
41 Correct 141 ms 9288 KB Output is correct
42 Correct 162 ms 9256 KB Output is correct
43 Correct 435 ms 9196 KB Output is correct
44 Correct 139 ms 9244 KB Output is correct
45 Correct 163 ms 9260 KB Output is correct
46 Correct 135 ms 9228 KB Output is correct
47 Correct 154 ms 9288 KB Output is correct
48 Correct 160 ms 9212 KB Output is correct
49 Correct 187 ms 9292 KB Output is correct
50 Correct 134 ms 9300 KB Output is correct
51 Correct 179 ms 9248 KB Output is correct
52 Correct 229 ms 9364 KB Output is correct
53 Correct 141 ms 9292 KB Output is correct
54 Correct 157 ms 9296 KB Output is correct
55 Correct 169 ms 9276 KB Output is correct
56 Correct 154 ms 9280 KB Output is correct
57 Correct 115 ms 9292 KB Output is correct
58 Correct 195 ms 9292 KB Output is correct