oj.uz

Submission #435051

# Submission time Handle Problem Language Result Execution time Memory
435051 2021-06-22T21:35:13 Z DanerZein Keys (IOI21_keys) C++17
20 / 100
 2500 ms 13568 KB 
#include <vector>
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
typedef vector<int> vi;
const int MAX=1e9;
const int MAX_N=1e5;
vector<vi> G;
bool vis[MAX_N];
vector<vi> ll;
int pa[MAX_N],tam[MAX_N],ran[MAX_N];
void init(int n){
  for(int i=0;i<n;i++){
    pa[i]=i; tam[i]=1;
  }
}
int findset(int i){
  if(pa[i]==i) return i;
  return pa[i]=findset(pa[i]);
}
bool issameset(int i,int j){
  return findset(i)==findset(j);
}
void unionset(int i,int j){
  if(!issameset(i,j)){
    int u=findset(i),v=findset(j);
    if(ran[u]<ran[v]){
      pa[u]=v; tam[v]+=tam[u];
    }
    else{
      if(ran[u]>ran[v]){
	pa[v]=u; tam[u]+=tam[v];
      }
      else{
	pa[v]=u; tam[u]+=tam[v];
	ran[u]++;
      }
    }
  }
}
std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c) {
  int n=r.size(); int m=u.size();
  ll.resize(n+1);
  for(int i=0;i<m;i++){
    ll[c[i]].push_back(i);
  }
  vector<int> ans(n,0);
  int mi=MAX;
  for(int i=0;i<n;i++){
    init(n);
    memset(vis,0,sizeof vis);
    memset(ran,0,sizeof ran);
    queue<int> q;
    q.push(r[i]);
    vis[r[i]]=1;
    while(!q.empty()){
      int x=q.front();
      q.pop();
      for(int j=0;j<ll[x].size();j++){
	int a=u[ll[x][j]],b=v[ll[x][j]];
	unionset(a,b);
      }
      for(int j=0;j<n;j++){
	if(!vis[r[j]] && issameset(i,j)){
	  vis[r[j]]=1;
	  q.push(r[j]);
	}
      }
    }
    if(mi>tam[findset(i)]){
      for(int j=0;j<n;j++) ans[j]=0;
      mi=tam[findset(i)];
    }
    if(mi==tam[findset(i)]){
      ans[i]=1;
    }
    //cout<<tam[findset(i)]<<endl;
  }
  return ans;
}

Compilation message

keys.cpp: In function 'std::vector<int> find_reachable(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
keys.cpp:59:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |       for(int j=0;j<ll[x].size();j++){
      |                   ~^~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 1 ms 716 KB Output is correct
4 Correct 4 ms 716 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 1 ms 716 KB Output is correct
7 Correct 1 ms 716 KB Output is correct
8 Correct 5 ms 716 KB Output is correct
9 Correct 5 ms 716 KB Output is correct
10 Correct 13 ms 812 KB Output is correct
11 Correct 14 ms 716 KB Output is correct
12 Correct 14 ms 812 KB Output is correct
13 Correct 1 ms 716 KB Output is correct
14 Correct 1 ms 716 KB Output is correct
15 Correct 11 ms 804 KB Output is correct
16 Correct 1 ms 716 KB Output is correct
17 Correct 1 ms 716 KB Output is correct
18 Correct 3 ms 716 KB Output is correct
19 Correct 1 ms 716 KB Output is correct
20 Correct 2 ms 716 KB Output is correct
21 Correct 15 ms 804 KB Output is correct
22 Correct 4 ms 716 KB Output is correct
23 Correct 18 ms 804 KB Output is correct
24 Correct 18 ms 800 KB Output is correct
25 Correct 33 ms 716 KB Output is correct
26 Correct 35 ms 836 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 1 ms 716 KB Output is correct
4 Correct 4 ms 716 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 1 ms 716 KB Output is correct
7 Correct 1 ms 716 KB Output is correct
8 Correct 5 ms 716 KB Output is correct
9 Correct 5 ms 716 KB Output is correct
10 Correct 13 ms 812 KB Output is correct
11 Correct 14 ms 716 KB Output is correct
12 Correct 14 ms 812 KB Output is correct
13 Correct 1 ms 716 KB Output is correct
14 Correct 1 ms 716 KB Output is correct
15 Correct 11 ms 804 KB Output is correct
16 Correct 1 ms 716 KB Output is correct
17 Correct 1 ms 716 KB Output is correct
18 Correct 3 ms 716 KB Output is correct
19 Correct 1 ms 716 KB Output is correct
20 Correct 2 ms 716 KB Output is correct
21 Correct 15 ms 804 KB Output is correct
22 Correct 4 ms 716 KB Output is correct
23 Correct 18 ms 804 KB Output is correct
24 Correct 18 ms 800 KB Output is correct
25 Correct 33 ms 716 KB Output is correct
26 Correct 35 ms 836 KB Output is correct
27 Execution timed out 2560 ms 972 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 1 ms 716 KB Output is correct
4 Correct 4 ms 716 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 1 ms 716 KB Output is correct
7 Correct 1 ms 716 KB Output is correct
8 Correct 5 ms 716 KB Output is correct
9 Correct 5 ms 716 KB Output is correct
10 Execution timed out 2575 ms 13568 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 1 ms 716 KB Output is correct
4 Correct 4 ms 716 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 1 ms 716 KB Output is correct
7 Correct 1 ms 716 KB Output is correct
8 Correct 5 ms 716 KB Output is correct
9 Correct 5 ms 716 KB Output is correct
10 Correct 13 ms 812 KB Output is correct
11 Correct 14 ms 716 KB Output is correct
12 Correct 14 ms 812 KB Output is correct
13 Correct 1 ms 716 KB Output is correct
14 Correct 1 ms 716 KB Output is correct
15 Correct 11 ms 804 KB Output is correct
16 Correct 1 ms 716 KB Output is correct
17 Correct 1 ms 716 KB Output is correct
18 Correct 3 ms 716 KB Output is correct
19 Correct 1 ms 716 KB Output is correct
20 Correct 2 ms 716 KB Output is correct
21 Correct 15 ms 804 KB Output is correct
22 Correct 4 ms 716 KB Output is correct
23 Correct 18 ms 804 KB Output is correct
24 Correct 18 ms 800 KB Output is correct
25 Correct 33 ms 716 KB Output is correct
26 Correct 35 ms 836 KB Output is correct
27 Execution timed out 2560 ms 972 KB Time limit exceeded
28 Halted 0 ms 0 KB -