oj.uz

답안 #144263

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
144263 2019-08-16T12:08:47 Z SamAnd Tenis (COI19_tenis) C++17
18 / 100
 77 ms 688 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 1003;
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

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

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 9 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 29 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 41 ms 688 KB Output is correct
10 Correct 77 ms 504 KB Output is correct
11 Correct 19 ms 504 KB Output is correct
12 Correct 12 ms 504 KB Output is correct

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 9 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 29 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 41 ms 688 KB Output is correct
10 Correct 77 ms 504 KB Output is correct
11 Correct 19 ms 504 KB Output is correct
12 Correct 12 ms 504 KB Output is correct
13 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 9 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 29 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 41 ms 688 KB Output is correct
10 Correct 77 ms 504 KB Output is correct
11 Correct 19 ms 504 KB Output is correct
12 Correct 12 ms 504 KB Output is correct
13 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -