답안 #528350

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
528350	2022-02-20T06:49:48 Z	N1NT3NDO	Kutije (COCI21_kutije)	C++14	25 / 70	108 ms	2420 KB

Main

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define sz(x) (int)x.size()
#define fi first
#define sd second
#define all(x) x.begin(), x.end()
//#pragma GCC target ("avx2")
//#pragma GCC optimization ("O3")
//#pragma GCC optimization ("unroll-loops")

using namespace std;
//using namespace __gnu_pbds;

//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

const int N = 1010;
bitset<N> bt[N];
int n, q, m, p[N];

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m >> q;
    for(int i = 1; i <= n; i++) bt[i][i] = 1;
    for(int i = 1; i <= m; i++)
    {
        for(int j = 1; j <= n; j++) cin >> p[j];
        while(true)
        {
            bool f = 0;
            for(int j = 1; j <= n; j++)
              {
                  if (bt[j] != (bt[j] | bt[p[j]])) f = 1;
                  if (bt[p[j]] != (bt[j] | bt[p[j]])) f = 1;
                  bt[j] |= bt[p[j]];
                  bt[p[j]] |= bt[j];
              }

            if (!f) break;
        }
    }

    while(q--)
    {
        int a, b;
        cin >> a >> b;
        if (bt[a][b]) cout << "DA" << '\n';
        else cout << "NE" << '\n';
    }
}

Subtask #1

15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	98 ms	2372 KB	Output is correct
2	Correct	97 ms	2212 KB	Output is correct
3	Correct	94 ms	2136 KB	Output is correct
4	Correct	108 ms	2400 KB	Output is correct
5	Correct	88 ms	2420 KB	Output is correct

Subtask #2

10.0 / 10.0

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

Subtask #3

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	336 KB	Output is correct
2	Correct	2 ms	340 KB	Output is correct
3	Correct	2 ms	336 KB	Output is correct
4	Correct	2 ms	332 KB	Output is correct
5	Correct	2 ms	332 KB	Output is correct
6	Correct	2 ms	332 KB	Output is correct
7	Correct	2 ms	332 KB	Output is correct
8	Correct	2 ms	332 KB	Output is correct
9	Correct	3 ms	332 KB	Output is correct
10	Correct	3 ms	332 KB	Output is correct
11	Correct	2 ms	328 KB	Output is correct
12	Correct	2 ms	332 KB	Output is correct
13	Correct	2 ms	332 KB	Output is correct
14	Correct	2 ms	360 KB	Output is correct
15	Correct	2 ms	360 KB	Output is correct
16	Correct	2 ms	332 KB	Output is correct
17	Correct	2 ms	332 KB	Output is correct
18	Correct	2 ms	332 KB	Output is correct
19	Incorrect	2 ms	332 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #4

0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	98 ms	2372 KB	Output is correct
2	Correct	97 ms	2212 KB	Output is correct
3	Correct	94 ms	2136 KB	Output is correct
4	Correct	108 ms	2400 KB	Output is correct
5	Correct	88 ms	2420 KB	Output is correct
6	Correct	2 ms	336 KB	Output is correct
7	Correct	2 ms	340 KB	Output is correct
8	Correct	2 ms	336 KB	Output is correct
9	Correct	2 ms	332 KB	Output is correct
10	Correct	2 ms	332 KB	Output is correct
11	Correct	2 ms	332 KB	Output is correct
12	Correct	2 ms	332 KB	Output is correct
13	Correct	2 ms	332 KB	Output is correct
14	Correct	3 ms	332 KB	Output is correct
15	Correct	3 ms	332 KB	Output is correct
16	Correct	2 ms	328 KB	Output is correct
17	Correct	2 ms	332 KB	Output is correct
18	Correct	2 ms	332 KB	Output is correct
19	Correct	2 ms	360 KB	Output is correct
20	Correct	2 ms	360 KB	Output is correct
21	Correct	2 ms	332 KB	Output is correct
22	Correct	2 ms	332 KB	Output is correct
23	Correct	2 ms	332 KB	Output is correct
24	Incorrect	2 ms	332 KB	Output isn't correct
25	Halted	0 ms	0 KB	-