oj.uz

Submission #117914

# Submission time Handle Problem Language Result Execution time Memory
117914 2019-06-17T12:18:29 Z songc Tenis (COI19_tenis) C++14
100 / 100
 226 ms 5784 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;

int N, Q;
int A[101010];
int B[101010];
int C[101010];
int cnt[404040];
bool T[404040];

void update(int id, int s, int e, int ts, int te, int v){
    if (e < ts || te < s) return;
    if (ts <= s && e <= te) {
        cnt[id] += v;
        T[id] = (cnt[id] > 0) || (T[id*2] && T[id*2+1]);
        return;
    }
    int mid = (s+e)/2;
    update(id*2, s, mid, ts, te, v);
    update(id*2+1, mid+1, e, ts, te, v);
    T[id] = (cnt[id] > 0) || (T[id*2] && T[id*2+1]);
}

bool query(int id, int s, int e, int ts, int te){
    if (e < ts || te < s || T[id]) return true;
    if (ts <= s && e <= te) return T[id];
    int mid = (s+e)/2;
    return query(id*2, s, mid, ts, te) && query(id*2+1, mid+1, e, ts, te);
}

int main(){
    int a, b, c;
    scanf("%d %d", &N, &Q);
    for (int i=1; i<=N; i++){scanf("%d", &a); A[a] = i;}
    for (int i=1; i<=N; i++){scanf("%d", &a); B[a] = i;}
    for (int i=1; i<=N; i++){scanf("%d", &a); C[a] = i;}
    for (int i=1; i<=N; i++) update(1, 1, N, min(A[i], min(B[i], C[i])),  max(A[i], max(B[i], C[i]))-1, 1);
    while (Q--){
        scanf("%d", &a);
        if (a == 1){
            scanf("%d", &a);
            if (query(1, 1, N, 1, min(A[a], min(B[a], C[a]))-1)) puts("DA");
            else puts("NE");
        }
        else{
            scanf("%d %d %d", &a, &b, &c);
            update(1, 1, N, min(A[b], min(B[b], C[b])),  max(A[b], max(B[b], C[b]))-1, -1);
            update(1, 1, N, min(A[c], min(B[c], C[c])),  max(A[c], max(B[c], C[c]))-1, -1);
            if (a == 1) swap(A[b], A[c]);
            if (a == 2) swap(B[b], B[c]);
            if (a == 3) swap(C[b], C[c]);
            update(1, 1, N, min(A[b], min(B[b], C[b])),  max(A[b], max(B[b], C[b]))-1, 1);
            update(1, 1, N, min(A[c], min(B[c], C[c])),  max(A[c], max(B[c], C[c]))-1, 1);
        }
    }
    return 0;
}

Compilation message

tenis.cpp: In function 'int main()':
tenis.cpp:35:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &N, &Q);
     ~~~~~^~~~~~~~~~~~~~~~~
tenis.cpp:36:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (int i=1; i<=N; i++){scanf("%d", &a); A[a] = i;}
                              ~~~~~^~~~~~~~~~
tenis.cpp:37:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (int i=1; i<=N; i++){scanf("%d", &a); B[a] = i;}
                              ~~~~~^~~~~~~~~~
tenis.cpp:38:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (int i=1; i<=N; i++){scanf("%d", &a); C[a] = i;}
                              ~~~~~^~~~~~~~~~
tenis.cpp:41:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a);
         ~~~~~^~~~~~~~~~
tenis.cpp:43:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &a);
             ~~~~~^~~~~~~~~~
tenis.cpp:48:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d %d %d", &a, &b, &c);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 72 ms 4448 KB Output is correct
14 Correct 73 ms 4496 KB Output is correct
15 Correct 69 ms 4500 KB Output is correct
16 Correct 69 ms 4600 KB Output is correct
17 Correct 65 ms 4472 KB Output is correct
18 Correct 64 ms 4456 KB Output is correct
19 Correct 67 ms 4472 KB Output is correct
20 Correct 78 ms 4472 KB Output is correct
21 Correct 64 ms 4592 KB Output is correct
22 Correct 70 ms 4472 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 3064 KB Output is correct
2 Correct 96 ms 5576 KB Output is correct
3 Correct 103 ms 5596 KB Output is correct
4 Correct 93 ms 5432 KB Output is correct
5 Correct 97 ms 5784 KB Output is correct
6 Correct 91 ms 5496 KB Output is correct
7 Correct 99 ms 5624 KB Output is correct
8 Correct 92 ms 5496 KB Output is correct
9 Correct 96 ms 5624 KB Output is correct
10 Correct 105 ms 5468 KB Output is correct
11 Correct 110 ms 5624 KB Output is correct
12 Correct 95 ms 5548 KB Output is correct
13 Correct 100 ms 5496 KB Output is correct
14 Correct 100 ms 5500 KB Output is correct
15 Correct 101 ms 5464 KB Output is correct

Subtask #5
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 72 ms 4448 KB Output is correct
14 Correct 73 ms 4496 KB Output is correct
15 Correct 69 ms 4500 KB Output is correct
16 Correct 69 ms 4600 KB Output is correct
17 Correct 65 ms 4472 KB Output is correct
18 Correct 64 ms 4456 KB Output is correct
19 Correct 67 ms 4472 KB Output is correct
20 Correct 78 ms 4472 KB Output is correct
21 Correct 64 ms 4592 KB Output is correct
22 Correct 70 ms 4472 KB Output is correct
23 Correct 93 ms 3064 KB Output is correct
24 Correct 96 ms 5576 KB Output is correct
25 Correct 103 ms 5596 KB Output is correct
26 Correct 93 ms 5432 KB Output is correct
27 Correct 97 ms 5784 KB Output is correct
28 Correct 91 ms 5496 KB Output is correct
29 Correct 99 ms 5624 KB Output is correct
30 Correct 92 ms 5496 KB Output is correct
31 Correct 96 ms 5624 KB Output is correct
32 Correct 105 ms 5468 KB Output is correct
33 Correct 110 ms 5624 KB Output is correct
34 Correct 95 ms 5548 KB Output is correct
35 Correct 100 ms 5496 KB Output is correct
36 Correct 100 ms 5500 KB Output is correct
37 Correct 101 ms 5464 KB Output is correct
38 Correct 208 ms 5252 KB Output is correct
39 Correct 124 ms 5368 KB Output is correct
40 Correct 226 ms 5368 KB Output is correct
41 Correct 141 ms 5340 KB Output is correct
42 Correct 135 ms 5260 KB Output is correct
43 Correct 207 ms 5376 KB Output is correct
44 Correct 125 ms 5496 KB Output is correct
45 Correct 150 ms 5372 KB Output is correct
46 Correct 125 ms 5496 KB Output is correct
47 Correct 141 ms 5372 KB Output is correct
48 Correct 129 ms 5500 KB Output is correct
49 Correct 144 ms 5368 KB Output is correct
50 Correct 125 ms 5372 KB Output is correct
51 Correct 141 ms 5368 KB Output is correct
52 Correct 204 ms 5240 KB Output is correct
53 Correct 128 ms 5368 KB Output is correct
54 Correct 145 ms 5368 KB Output is correct
55 Correct 153 ms 5252 KB Output is correct
56 Correct 132 ms 5368 KB Output is correct
57 Correct 133 ms 5368 KB Output is correct
58 Correct 176 ms 5400 KB Output is correct