oj.uz

Submission #496184

# Submission time Handle Problem Language Result Execution time Memory
496184 2021-12-21T01:00:50 Z model_code Kutije (COCI21_kutije) C++17
70 / 70
 190 ms 13436 KB 
#include <bits/stdc++.h>
using namespace std;

#define TRACE(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define _ << " _ " <<

template<class> struct is_container : false_type {};
template<class... Ts> struct is_container<vector<Ts...>> : true_type {};
template<class... Ts> struct is_container<map<Ts...>> : true_type {};
template<class... Ts> struct is_container<unordered_map<Ts...>> : true_type {};
template<class... Ts> struct is_container<set<Ts...>> : true_type {};
template<class... Ts> struct is_container<unordered_set<Ts...>> : true_type {};
template<class... Ts> struct is_container<multiset<Ts...>> : true_type {};
template<class... Ts> struct is_container<unordered_multiset<Ts...>> : true_type {};
template<class T, class = typename enable_if<is_container<T>::value>::type>
ostream& operator<<(ostream &o, T x) {
  int f = 1;
  o << "{";
  for (auto y : x) {
    o << (f ? "" : ", ") << y;
    f = 0;
  }
  return o << "}";
}
template<class T, class U>
ostream& operator<<(ostream &o, pair<T, U> x) {
  return o << "(" << x.first << ", " << x.second << ")";
}

#define fi first
#define se second

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, m, q;
    cin >> n >> m >> q;
    vector<vi> e(n, vi(m));
    for (int j = 0; j < m; j++)
        for (int i = 0; i < n; i++) {
            cin >> e[i][j];
            e[i][j]--;
        }

    vi comp(n, -1);
    for (int i = 0; i < n; i++) {
        if (comp[i] != -1) continue;
        queue<int> Q({i});
        while (!Q.empty()) {
            int x = Q.front();
            Q.pop();
            if (comp[x] == i) continue;
            comp[x] = i;
            for (int y : e[x]) Q.push(y);
        }
    }

    while (q--) {
        int x, y;
        cin >> x >> y;
        x--; y--;
        if (comp[x] == comp[y]) cout << "DA\n";
        else cout << "NE\n";
    }

    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 5648 KB Output is correct
2 Correct 69 ms 4848 KB Output is correct
3 Correct 71 ms 4620 KB Output is correct
4 Correct 91 ms 5624 KB Output is correct
5 Correct 89 ms 5616 KB Output is correct

Subtask #2
10.0 / 10.0

# 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 2 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 368 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 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

Subtask #3
10.0 / 10.0

# 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 2 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 368 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 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 1 ms 348 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 368 KB Output is correct
18 Correct 1 ms 352 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 1 ms 380 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 5648 KB Output is correct
2 Correct 69 ms 4848 KB Output is correct
3 Correct 71 ms 4620 KB Output is correct
4 Correct 91 ms 5624 KB Output is correct
5 Correct 89 ms 5616 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 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 368 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 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 1 ms 348 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 368 KB Output is correct
23 Correct 1 ms 352 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 1 ms 380 KB Output is correct
26 Correct 140 ms 13420 KB Output is correct
27 Correct 170 ms 13352 KB Output is correct
28 Correct 129 ms 11216 KB Output is correct
29 Correct 145 ms 13052 KB Output is correct
30 Correct 148 ms 11624 KB Output is correct
31 Correct 187 ms 11584 KB Output is correct
32 Correct 190 ms 13436 KB Output is correct
33 Correct 171 ms 13264 KB Output is correct
34 Correct 166 ms 13284 KB Output is correct
35 Correct 161 ms 13352 KB Output is correct