oj.uz

Submission #578441

# Submission time Handle Problem Language Result Execution time Memory
578441 2022-06-16T23:04:54 Z SSRS Werewolf (IOI18_werewolf) C++14
7 / 100
 4000 ms 21388 KB 
#include <bits/stdc++.h>
using namespace std;
vector<int> check_validity(int N, vector<int> X, vector<int> Y, vector<int> S, vector<int> E, vector<int> L, vector<int> R){
  int M = X.size();
  int Q = S.size();
  vector<vector<int>> G(N);
  for (int i = 0; i < M; i++){
    G[X[i]].push_back(Y[i]);
    G[Y[i]].push_back(X[i]);
  }
  vector<int> ans(Q, 0);
  for (int i = 0; i < Q; i++){
    for (int j = L[i]; j <= R[i]; j++){
      vector<bool> used1(N, false);
      used1[S[i]] = true;
      queue<int> q1;
      q1.push(S[i]);
      while (!q1.empty()){
        int v = q1.front();
        q1.pop();
        for (int w : G[v]){
          if (w >= L[i] && !used1[w]){
            used1[w] = true;
            q1.push(w);
          }
        }
      }
      vector<bool> used2(N, false);
      used2[j] = true;
      queue<int> q2;
      q2.push(j);
      while (!q2.empty()){
        int v = q2.front();
        q2.pop();
        for (int w : G[v]){
          if (w <= R[i] && !used2[w]){
            used2[w] = true;
            q2.push(w);
          }
        }
      }
      if (used1[j] && used2[E[i]]){
        ans[i] = 1;
      }
    }
  }
  return ans;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 212 KB Output is correct
2 Correct 7 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 10 ms 308 KB Output is correct
6 Correct 12 ms 308 KB Output is correct
7 Correct 13 ms 212 KB Output is correct
8 Correct 4 ms 212 KB Output is correct
9 Correct 10 ms 304 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 212 KB Output is correct
2 Correct 7 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 10 ms 308 KB Output is correct
6 Correct 12 ms 308 KB Output is correct
7 Correct 13 ms 212 KB Output is correct
8 Correct 4 ms 212 KB Output is correct
9 Correct 10 ms 304 KB Output is correct
10 Execution timed out 4093 ms 608 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4080 ms 21388 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 212 KB Output is correct
2 Correct 7 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 10 ms 308 KB Output is correct
6 Correct 12 ms 308 KB Output is correct
7 Correct 13 ms 212 KB Output is correct
8 Correct 4 ms 212 KB Output is correct
9 Correct 10 ms 304 KB Output is correct
10 Execution timed out 4093 ms 608 KB Time limit exceeded
11 Halted 0 ms 0 KB -