# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
528441 |
2022-02-20T09:58:08 Z |
Slavita |
Kutije (COCI21_kutije) |
C++14 |
|
544 ms |
3652 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], nbt[N];
void dfs(int v, int st){
if (mrk[v]) {return;}
mrk[v] = 1;
bt[st][v] = 1;
for (int i = 1; i <= n; i++){
if (!bt[v][i]) continue;
if (i == v) continue;
if (bt[i].count() > 1) bt[st] |= bt[i];
else 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; nbt[j][x] = 1;}
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 (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")
|
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
477 ms |
2112 KB |
Output is correct |
2 |
Correct |
369 ms |
1856 KB |
Output is correct |
3 |
Correct |
161 ms |
1772 KB |
Output is correct |
4 |
Correct |
544 ms |
2120 KB |
Output is correct |
5 |
Correct |
71 ms |
2072 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
3 ms |
332 KB |
Output is correct |
8 |
Correct |
2 ms |
332 KB |
Output is correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
3 ms |
332 KB |
Output is correct |
8 |
Correct |
2 ms |
332 KB |
Output is correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
2 ms |
332 KB |
Output is correct |
12 |
Correct |
1 ms |
332 KB |
Output is correct |
13 |
Correct |
1 ms |
332 KB |
Output is correct |
14 |
Correct |
1 ms |
332 KB |
Output is correct |
15 |
Correct |
1 ms |
332 KB |
Output is correct |
16 |
Correct |
1 ms |
332 KB |
Output is correct |
17 |
Correct |
1 ms |
332 KB |
Output is correct |
18 |
Correct |
1 ms |
332 KB |
Output is correct |
19 |
Correct |
1 ms |
332 KB |
Output is correct |
20 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
477 ms |
2112 KB |
Output is correct |
2 |
Correct |
369 ms |
1856 KB |
Output is correct |
3 |
Correct |
161 ms |
1772 KB |
Output is correct |
4 |
Correct |
544 ms |
2120 KB |
Output is correct |
5 |
Correct |
71 ms |
2072 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
8 |
Correct |
1 ms |
332 KB |
Output is correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
1 ms |
332 KB |
Output is correct |
12 |
Correct |
3 ms |
332 KB |
Output is correct |
13 |
Correct |
2 ms |
332 KB |
Output is correct |
14 |
Correct |
1 ms |
332 KB |
Output is correct |
15 |
Correct |
1 ms |
332 KB |
Output is correct |
16 |
Correct |
2 ms |
332 KB |
Output is correct |
17 |
Correct |
1 ms |
332 KB |
Output is correct |
18 |
Correct |
1 ms |
332 KB |
Output is correct |
19 |
Correct |
1 ms |
332 KB |
Output is correct |
20 |
Correct |
1 ms |
332 KB |
Output is correct |
21 |
Correct |
1 ms |
332 KB |
Output is correct |
22 |
Correct |
1 ms |
332 KB |
Output is correct |
23 |
Correct |
1 ms |
332 KB |
Output is correct |
24 |
Correct |
1 ms |
332 KB |
Output is correct |
25 |
Correct |
1 ms |
332 KB |
Output is correct |
26 |
Correct |
169 ms |
2028 KB |
Output is correct |
27 |
Correct |
152 ms |
2024 KB |
Output is correct |
28 |
Correct |
167 ms |
1760 KB |
Output is correct |
29 |
Correct |
155 ms |
3504 KB |
Output is correct |
30 |
Correct |
108 ms |
3276 KB |
Output is correct |
31 |
Correct |
118 ms |
3264 KB |
Output is correct |
32 |
Correct |
171 ms |
3564 KB |
Output is correct |
33 |
Correct |
137 ms |
3544 KB |
Output is correct |
34 |
Correct |
130 ms |
3564 KB |
Output is correct |
35 |
Correct |
137 ms |
3652 KB |
Output is correct |