oj.uz

Submission #788184

# Submission time Handle Problem Language Result Execution time Memory
788184 2023-07-19T21:55:14 Z APROHACK Werewolf (IOI18_werewolf) C++17
15 / 100
 4000 ms 21368 KB 
#include "werewolf.h"
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;
int n, m, q;
int rep[200001][2];
vector<pair<int, int> >edjes;

int findd(int u, short cual){
	if(rep[u][cual] == u)return u;
	return rep[u][cual] = findd(rep[u][cual], cual);
}
void joinn(int a, int b, short cual){
	a = findd(a, cual);
	b = findd(b, cual);
	
	if(a == b)return ;
	rep[a][cual] = b;
	
}



std::vector<int> check_validity(int N, std::vector<int> X, std::vector<int> Y,
                                std::vector<int> S, std::vector<int> E,
                                std::vector<int> L, std::vector<int> R) {
  n = N;
  m = X.size();
  q = S.size();
  for(int i = 0 ; i < m ; i ++){
	  edjes.pb({X[i], Y[i]});
  }
  vector<int>A;
  for(int query = 0 ; query < q ; query ++){
	  for(int i = 0 ; i < n ; i ++){
		  rep[i][0] = i;
		  rep[i][1] = i;
		}
	  for(int i = 0 ; i < m ; i ++){
		  if(X[i] <= R[query] and Y[i] <= R[query]){
			  joinn(X[i], Y[i], 0);
		  }
		  if(X[i] >= L[query] and Y[i] >= L[query]){
			  joinn(X[i], Y[i], 1);
		  }
	  }
	  bool posible = false;
	  S[query] = findd(S[query], 1);
	  E[query] = findd(E[query], 0);
	  for(int i = L[query] ; i <= R[query] ; i ++){
		  if(findd(i, 1) == S[query] and findd(i, 0) == E[query]){
			  posible = true;
			  break;
		  }
	  }
	  if(posible)A.pb(1);
	  else A.pb(0);
  }
  
  return A;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 308 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 291 ms 628 KB Output is correct
11 Correct 238 ms 632 KB Output is correct
12 Correct 187 ms 612 KB Output is correct
13 Correct 271 ms 628 KB Output is correct
14 Correct 219 ms 612 KB Output is correct
15 Correct 536 ms 752 KB Output is correct

Subtask #3
0 / 34.0

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

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 291 ms 628 KB Output is correct
11 Correct 238 ms 632 KB Output is correct
12 Correct 187 ms 612 KB Output is correct
13 Correct 271 ms 628 KB Output is correct
14 Correct 219 ms 612 KB Output is correct
15 Correct 536 ms 752 KB Output is correct
16 Execution timed out 4014 ms 21368 KB Time limit exceeded
17 Halted 0 ms 0 KB -