oj.uz

답안 #528437

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
528437 2022-02-20T09:52:02 Z Slavita Kutije (COCI21_kutije) C++14
15 / 70
 564 ms 1964 KB 
#include <bits/stdc++.h>
#pragma optimize("O3")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define ve vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pi pair<int,int>
#define all(v) v.begin(),v.end()
#define si(v) (int)v.size()
#define en '\n'
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_muiltiset tree<int, null_type,less_equal<>, rb_tree_tag,tree_order_statistics_node_update>
//#define int long long
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;

const int N = 1e3 + 228;
const int big = 1e9;
//ordered_set os; // os.order_of_key(4), (*os.find_by_order(5))
int n, m, q, ans;
int mrk[N];
bitset<N> bt[N];

void dfs(int v, int st){
    if (mrk[v] == st) {return;}
    if (mrk[v]){
        mrk[v] = st;

        bt[st] |= bt[v];
        if (bt[v].count() > 1) return;
    }
    mrk[v] = st;

    bt[st][v] = 1;
    for (int i = 1; i <= n; i++){
        if (!bt[v][i]) continue;
        if (i == v) continue;
        dfs(i, st);
    }
}

//#undef int
int main(){
    //#define int long long
    iostream::sync_with_stdio(false); cin.tie(0); ios_base::sync_with_stdio(false); cout.tie(0);
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    cin >> n >> m >> q;
    for (int i = 1; i <= m; i++)
        for (int j = 1; j <= n; j++) {int x; cin >> x; bt[j][x] = 1;}

    for (int i = 1; i <= n; i++){
        dfs(i, i);
    }

    for (int i = 1; i <= q; i++){
        int x, y; cin >> x >> y;
        if (bt[x][y]) cout << "DA\n"; else cout << "NE\n";
    }
    return 0;
}
/*
*/

Compilation message

Main.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize("O3")
      |

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 454 ms 1964 KB Output is correct
2 Correct 360 ms 1784 KB Output is correct
3 Correct 166 ms 1620 KB Output is correct
4 Correct 564 ms 1944 KB Output is correct
5 Correct 74 ms 1936 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 454 ms 1964 KB Output is correct
2 Correct 360 ms 1784 KB Output is correct
3 Correct 166 ms 1620 KB Output is correct
4 Correct 564 ms 1944 KB Output is correct
5 Correct 74 ms 1936 KB Output is correct
6 Incorrect 1 ms 332 KB Output isn't correct
7 Halted 0 ms 0 KB -