oj.uz

Submission #528413

# Submission time Handle Problem Language Result Execution time Memory
528413 2022-02-20T08:57:16 Z Slavita Kutije (COCI21_kutije) C++14
35 / 70
 1000 ms 48984 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];
set<int> g[N];
map<int, bool> mem[N];

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

    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++){
        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.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 486 ms 43384 KB Output is correct
2 Correct 395 ms 37524 KB Output is correct
3 Correct 339 ms 24712 KB Output is correct
4 Correct 531 ms 48984 KB Output is correct
5 Correct 370 ms 22648 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 11 ms 972 KB Output is correct
4 Correct 5 ms 844 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 16 ms 1356 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 11 ms 972 KB Output is correct
4 Correct 5 ms 844 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 16 ms 1356 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 2 ms 460 KB Output is correct
13 Correct 12 ms 1100 KB Output is correct
14 Correct 4 ms 716 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 15 ms 1356 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 460 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 486 ms 43384 KB Output is correct
2 Correct 395 ms 37524 KB Output is correct
3 Correct 339 ms 24712 KB Output is correct
4 Correct 531 ms 48984 KB Output is correct
5 Correct 370 ms 22648 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 11 ms 972 KB Output is correct
9 Correct 5 ms 844 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 16 ms 1356 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 12 ms 1100 KB Output is correct
19 Correct 4 ms 716 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 15 ms 1356 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 789 ms 29924 KB Output is correct
27 Correct 434 ms 23188 KB Output is correct
28 Execution timed out 1090 ms 26088 KB Time limit exceeded
29 Halted 0 ms 0 KB -