oj.uz

Submission #144265

# Submission time Handle Problem Language Result Execution time Memory
144265 2019-08-16T12:10:17 Z SamAnd Tenis (COI19_tenis) C++17
18 / 100
 500 ms 7136 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
struct ban
{
    int x, y, z;
};

int n, q;
ban a[N], b[N];

bool c[N];

void bil()
{
    memset(c, false, sizeof c);
    set<int> sx, sy, sz;
    set<int> s;
    for (int i = n; i > 1; --i)
    {
        sx.insert(a[i].x);
        sy.insert(a[i].y);
        sz.insert(a[i].z);
        if (sx == sy && sy == sz)
        {
            s = sx;
        }
    }
    for (set<int>::iterator it = s.begin(); it != s.end(); ++it)
        c[*it] = true;
}

int main()
{
    scanf("%d%d", &n, &q);
    for (int i = 1; i <= n; ++i)
    {
        scanf("%d", &a[i].x);
        b[a[i].x].x = i;
    }
    for (int i = 1; i <= n; ++i)
    {
        scanf("%d", &a[i].y);
        b[a[i].y].y = i;
    }
    for (int i = 1; i <= n; ++i)
    {
        scanf("%d", &a[i].z);
        b[a[i].z].z = i;
    }
    bil();
    while (q--)
    {
        int ty;
        scanf("%d", &ty);
        if (ty == 1)
        {
            int x;
            scanf("%d", &x);
            if (c[x] == false)
                printf("DA\n");
            else
                printf("NE\n");
        }
        else
        {
            int p, x, y;
            scanf("%d%d%d", &p, &x, &y);
            if (p == 1)
            {
                swap(a[b[x].x].x, a[b[y].x].x);
                swap(b[x].x, b[y].x);
            }
            else if (p == 2)
            {
                swap(a[b[x].y].y, a[b[y].y].y);
                swap(b[x].y, b[y].y);
            }
            else
            {
                swap(a[b[x].z].z, a[b[y].z].z);
                swap(b[x].z, b[y].z);
            }
            bil();
        }
    }
    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:38:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i].x);
         ~~~~~^~~~~~~~~~~~~~~
tenis.cpp:43:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i].y);
         ~~~~~^~~~~~~~~~~~~~~
tenis.cpp:48:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i].z);
         ~~~~~^~~~~~~~~~~~~~~
tenis.cpp:55:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &ty);
         ~~~~~^~~~~~~~~~~
tenis.cpp:59:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &x);
             ~~~~~^~~~~~~~~~
tenis.cpp:68:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d%d%d", &p, &x, &y);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 23 ms 680 KB Output is correct
8 Correct 5 ms 632 KB Output is correct
9 Correct 38 ms 632 KB Output is correct
10 Correct 73 ms 632 KB Output is correct
11 Correct 19 ms 636 KB Output is correct
12 Correct 15 ms 632 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 23 ms 680 KB Output is correct
8 Correct 5 ms 632 KB Output is correct
9 Correct 38 ms 632 KB Output is correct
10 Correct 73 ms 632 KB Output is correct
11 Correct 19 ms 636 KB Output is correct
12 Correct 15 ms 632 KB Output is correct
13 Execution timed out 1073 ms 7080 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1076 ms 7136 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 23 ms 680 KB Output is correct
8 Correct 5 ms 632 KB Output is correct
9 Correct 38 ms 632 KB Output is correct
10 Correct 73 ms 632 KB Output is correct
11 Correct 19 ms 636 KB Output is correct
12 Correct 15 ms 632 KB Output is correct
13 Execution timed out 1073 ms 7080 KB Time limit exceeded
14 Halted 0 ms 0 KB -