oj.uz

Submission #1018272

# Submission time Handle Problem Language Result Execution time Memory
1018272 2024-07-09T17:56:26 Z vjudge1 Werewolf (IOI18_werewolf) C++17
0 / 100
 4000 ms 38504 KB 
#include "werewolf.h"
#include<bits/stdc++.h>
#define pb push_back
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 Q=S.size();
  int M=X.size();
  vector<int> ans;
  for(int ind=0; ind <Q; ++ind){
    vector<bool> vis(2*N, 0);
    int l=L[ind];
    int r=R[ind];
    vector<vector<int>> adj (2*N);
    for(int i=0; i<M; ++i){
      if(X[i]>=l && Y[i]>=l){
        adj[X[i]].pb(Y[i]);
        adj[Y[i]].pb(X[i]);
      }
      if(X[i]<=r && Y[i]<=r){
        adj[X[i]+N].pb(Y[i]+N);
        adj[X[i]+N].pb(Y[i]+N);
      }
    }
    for(int i=l; i<=r; ++i){
      adj[i].pb({i+N});
    }
    queue<int> q;
    q.push(S[ind]);
    vis[S[ind]]=true;
    while(!q.empty()){
      int x=q.front();
      q.pop();
      for(int y: adj[x]){
        if(!vis[y]){
          vis[y]=true;
          q.push(y);
        }
      }
    }
    ans.pb(vis[E[ind]+N]);
  }
  return ans;
}

Subtask #1
0 / 7.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 34.0

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

Subtask #4
0 / 51.0

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