Submission #528410

#	Time	Username	Problem	Language	Result	Execution time	Memory
528410		Slavita	Kutije (COCI21_kutije)	C++14	35 / 70	1093 ms	48948 KiB

Main

#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;
bool mrk[N];
set<int> g[N];
map<int, bool> mem[N];

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

    bool ok = 0;
    for (auto item : mem[v]) if (item.se == 1) {mem[st][item.fi] = 1; ok = 1;}
    if (ok) return;

    mem[st][v] = 1;
    for (auto u : g[v]){
        dfs(u, 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; g[j].insert(x);}

    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= n; j++) mrk[j] = 0;
        dfs(i, i);
    }

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

• Subtask 1: 15 / 15
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 0 / 35