oj.uz

Submission #720685

# Submission time Handle Problem Language Result Execution time Memory
720685 2023-04-08T23:45:48 Z Yell0 Kutije (COCI21_kutije) C++17
35 / 70
 1000 ms 41944 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
 
using namespace std;
const int MN=1002;
int n,m,q;
vector<int> adj[MN];
bool vis[MN];
unordered_set<int> dest[MN];
 
void dfs(int u,int p) {
    vis[u]=1;
    dest[p].insert(u);
    for(int v:adj[u])
        if(!vis[v])
            dfs(v,p);
}
 
int main() {
    ios::sync_with_stdio(0);cin.tie(0);
    cin>>n>>m>>q;
    for(int i=1;i<=m;i++)
        for(int u=1,v;u<=n;u++) {
            cin>>v;
            adj[v].push_back(u);
        }
    for(int i=1;i<=n;i++) {
        memset(vis,0,sizeof(vis));
        dfs(i,i);
    }
    int a,b;
    while(q--) {
        cin>>a>>b;
        if(dest[a].count(b)) cout<<"DA\n";
        else cout<<"NE\n";
    }
    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 300 ms 34472 KB Output is correct
2 Correct 234 ms 30164 KB Output is correct
3 Correct 172 ms 11552 KB Output is correct
4 Correct 304 ms 41944 KB Output is correct
5 Correct 80 ms 2000 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 3 ms 724 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 3 ms 828 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 3 ms 724 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 3 ms 828 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 3 ms 724 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 4 ms 848 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 300 ms 34472 KB Output is correct
2 Correct 234 ms 30164 KB Output is correct
3 Correct 172 ms 11552 KB Output is correct
4 Correct 304 ms 41944 KB Output is correct
5 Correct 80 ms 2000 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 3 ms 828 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 3 ms 724 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 4 ms 848 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 392 ms 10068 KB Output is correct
27 Correct 170 ms 6348 KB Output is correct
28 Execution timed out 1102 ms 37788 KB Time limit exceeded
29 Halted 0 ms 0 KB -