oj.uz

답안 #891529

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
891529 2023-12-23T07:19:23 Z Mr_Ph Kutije (COCI21_kutije) C++17
70 / 70
 144 ms 1876 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
using namespace std;
using namespace __gnu_pbds;
template<class x>
using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>;
const int mod=(int)1e9+7;
///the defines :)
#define endl '\n'
#define vi vector<int>
#define vll vector<ll>
#define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
#define all(arr) arr.begin(),arr.end()
#define allr(arr) arr.rbegin(),arr.rend()
#define sz size()
//#define int long long
int parent[1001];
int siz[1001];
int get(int node)
{
    if(parent[node]==node)return node;
    return get(parent[node]);
}
void connect(int a,int b)
{
    a=get(a);
    b=get(b);
    if(a==b)return;
    if(siz[a]>siz[b])swap(a,b);
    parent[a]=b;
    siz[b]+=siz[a];
}
void preprocess() {}
void solve()
{
    int n,m,q;
    cin>>n>>m>>q;
    for(int i=1;i<=n;i++)parent[i]=i,siz[i]=1;
    for(int i=0;i<m;i++)
    {
        for(int j=1;j<=n;j++)
        {
            int x;
            cin>>x;
            connect(j,x);
        }
    }
    while(q--)
    {
        int a,b;
        cin>>a>>b;
        if(get(a)==get(b))cout<<"DA"<<endl;
        else cout<<"NE"<<endl;
    }
}
signed main()
{
    // freopen("div7.in","r",stdin);
    //freopen("div7.out","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    preprocess();
    //bla();
    int t=1;
  //  cin>>t;
    while(t--)
        solve();
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 1848 KB Output is correct
2 Correct 68 ms 1624 KB Output is correct
3 Correct 63 ms 1540 KB Output is correct
4 Correct 75 ms 1872 KB Output is correct
5 Correct 68 ms 1788 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 1848 KB Output is correct
2 Correct 68 ms 1624 KB Output is correct
3 Correct 63 ms 1540 KB Output is correct
4 Correct 75 ms 1872 KB Output is correct
5 Correct 68 ms 1788 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 142 ms 1876 KB Output is correct
27 Correct 143 ms 1816 KB Output is correct
28 Correct 119 ms 1648 KB Output is correct
29 Correct 144 ms 1728 KB Output is correct
30 Correct 112 ms 1616 KB Output is correct
31 Correct 117 ms 1616 KB Output is correct
32 Correct 108 ms 1876 KB Output is correct
33 Correct 123 ms 1872 KB Output is correct
34 Correct 128 ms 1836 KB Output is correct
35 Correct 121 ms 1872 KB Output is correct