oj.uz

Submission #528398

# Submission time Handle Problem Language Result Execution time Memory
528398 2022-02-20T08:43:39 Z Slavita Kutije (COCI21_kutije) C++14
35 / 70
 1000 ms 69984 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 = 1e5 + 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<pi, bool> mem;

void dfs(int v, int st){
    if (mrk[v]) return;
    mrk[v] = 1;
    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;
}
/*
*/

Compilation message

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

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 734 ms 62468 KB Output is correct
2 Correct 646 ms 54824 KB Output is correct
3 Correct 419 ms 37732 KB Output is correct
4 Correct 806 ms 69984 KB Output is correct
5 Correct 454 ms 34680 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5104 KB Output is correct
2 Correct 4 ms 5032 KB Output is correct
3 Correct 12 ms 5796 KB Output is correct
4 Correct 7 ms 5452 KB Output is correct
5 Correct 4 ms 5040 KB Output is correct
6 Correct 4 ms 5084 KB Output is correct
7 Correct 15 ms 6092 KB Output is correct
8 Correct 4 ms 5068 KB Output is correct
9 Correct 4 ms 5196 KB Output is correct
10 Correct 3 ms 5068 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5104 KB Output is correct
2 Correct 4 ms 5032 KB Output is correct
3 Correct 12 ms 5796 KB Output is correct
4 Correct 7 ms 5452 KB Output is correct
5 Correct 4 ms 5040 KB Output is correct
6 Correct 4 ms 5084 KB Output is correct
7 Correct 15 ms 6092 KB Output is correct
8 Correct 4 ms 5068 KB Output is correct
9 Correct 4 ms 5196 KB Output is correct
10 Correct 3 ms 5068 KB Output is correct
11 Correct 5 ms 5196 KB Output is correct
12 Correct 3 ms 5068 KB Output is correct
13 Correct 11 ms 5828 KB Output is correct
14 Correct 6 ms 5420 KB Output is correct
15 Correct 3 ms 5060 KB Output is correct
16 Correct 5 ms 5084 KB Output is correct
17 Correct 17 ms 6092 KB Output is correct
18 Correct 3 ms 5068 KB Output is correct
19 Correct 4 ms 5160 KB Output is correct
20 Correct 3 ms 5068 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 734 ms 62468 KB Output is correct
2 Correct 646 ms 54824 KB Output is correct
3 Correct 419 ms 37732 KB Output is correct
4 Correct 806 ms 69984 KB Output is correct
5 Correct 454 ms 34680 KB Output is correct
6 Correct 4 ms 5104 KB Output is correct
7 Correct 4 ms 5032 KB Output is correct
8 Correct 12 ms 5796 KB Output is correct
9 Correct 7 ms 5452 KB Output is correct
10 Correct 4 ms 5040 KB Output is correct
11 Correct 4 ms 5084 KB Output is correct
12 Correct 15 ms 6092 KB Output is correct
13 Correct 4 ms 5068 KB Output is correct
14 Correct 4 ms 5196 KB Output is correct
15 Correct 3 ms 5068 KB Output is correct
16 Correct 5 ms 5196 KB Output is correct
17 Correct 3 ms 5068 KB Output is correct
18 Correct 11 ms 5828 KB Output is correct
19 Correct 6 ms 5420 KB Output is correct
20 Correct 3 ms 5060 KB Output is correct
21 Correct 5 ms 5084 KB Output is correct
22 Correct 17 ms 6092 KB Output is correct
23 Correct 3 ms 5068 KB Output is correct
24 Correct 4 ms 5160 KB Output is correct
25 Correct 3 ms 5068 KB Output is correct
26 Correct 950 ms 42992 KB Output is correct
27 Correct 581 ms 35636 KB Output is correct
28 Execution timed out 1035 ms 31832 KB Time limit exceeded
29 Halted 0 ms 0 KB -