oj.uz

Submission #724514

# Submission time Handle Problem Language Result Execution time Memory
724514 2023-04-15T12:50:26 Z TheSahib Kutije (COCI21_kutije) C++17
20 / 70
 130 ms 9096 KB 
#include <bits/stdc++.h>
 
#pragma GCC optimize("O3")
 
#define ll long long
#define oo 1e9 + 9
#define pii pair<ll, ll>
 
using namespace std;

const int MAX = 1001; 

int n, m, q;
int adj[MAX][MAX];
vector<int> g[MAX];
int dist[MAX][MAX];

bool visited[MAX];
void dfs(int node, int p){
    visited[node] = 1;
    dist[p][node] = 1;
    for (int& to:g[node])
    {
        if(!visited[to]){
            dfs(to, p);
        }
    }
}


int main(){
    cin >> n >> m >> q;
    for (int i = 0; i < m; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            int a; scanf("%d", &a);
            if(j == a) continue;
            adj[j][a] = 1;
        }
    }
    for (int i = 1; i <= MAX; i++)
    {
        for (int j = 1; j <= MAX; j++)
        {
            if(adj[i][j]) g[i].push_back(j);
        }
    }
    
    for (int i = 1; i <= n; i++)
    {
        memset(visited, 0, sizeof(visited));
        dfs(i, i);
    }
    while(q--){
        int a, b; scanf("%d%d", &a, &b);
        if(dist[a][b]){
            cout << "DA\n";
        }
        else{
            cout << "NE\n";
        }
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:37:25: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |             int a; scanf("%d", &a);
      |                    ~~~~~^~~~~~~~~~
Main.cpp:56:24: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |         int a, b; scanf("%d%d", &a, &b);
      |                   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 130 ms 9096 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1108 KB Output is correct
2 Correct 3 ms 1108 KB Output is correct
3 Correct 4 ms 980 KB Output is correct
4 Correct 3 ms 1108 KB Output is correct
5 Correct 2 ms 980 KB Output is correct
6 Correct 3 ms 1108 KB Output is correct
7 Correct 4 ms 1140 KB Output is correct
8 Correct 3 ms 1108 KB Output is correct
9 Correct 3 ms 1108 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 130 ms 9096 KB Output isn't correct
2 Halted 0 ms 0 KB -