oj.uz

Submission #720683

# Submission time Handle Problem Language Result Execution time Memory
720683 2023-04-08T23:42:13 Z Yell0 Kutije (COCI21_kutije) C++17
35 / 70
 1000 ms 53572 KB 
#include <bits/stdc++.h>

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 278 ms 38252 KB Output is correct
2 Correct 241 ms 33572 KB Output is correct
3 Correct 152 ms 14552 KB Output is correct
4 Correct 301 ms 45868 KB Output is correct
5 Correct 75 ms 5836 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 540 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 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 3 ms 852 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 416 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 540 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 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 3 ms 852 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 416 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 ms 852 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 456 KB Output is correct
17 Correct 3 ms 852 KB Output is correct
18 Correct 1 ms 516 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 408 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 278 ms 38252 KB Output is correct
2 Correct 241 ms 33572 KB Output is correct
3 Correct 152 ms 14552 KB Output is correct
4 Correct 301 ms 45868 KB Output is correct
5 Correct 75 ms 5836 KB Output is correct
6 Correct 1 ms 540 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 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 3 ms 852 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 1 ms 416 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 2 ms 852 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 456 KB Output is correct
22 Correct 3 ms 852 KB Output is correct
23 Correct 1 ms 516 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 408 KB Output is correct
26 Correct 279 ms 17656 KB Output is correct
27 Correct 165 ms 13960 KB Output is correct
28 Correct 875 ms 45648 KB Output is correct
29 Correct 628 ms 32512 KB Output is correct
30 Correct 123 ms 11868 KB Output is correct
31 Correct 144 ms 12428 KB Output is correct
32 Execution timed out 1044 ms 53572 KB Time limit exceeded
33 Halted 0 ms 0 KB -