oj.uz

Submission #997036

# Submission time Handle Problem Language Result Execution time Memory
997036 2024-06-11T15:52:43 Z huutuan September (APIO24_september) C++17
0 / 100
 1 ms 4700 KB 
#include "september.h"

#include <vector>

#include <bits/stdc++.h>

using namespace std;

const int N=1e5+10;
bool is_equal[N], check[N], ss[N], vis[N];
int par[N], cnt[N];
int a[5][N], n, m;
vector<int> g[N];

int solve(int N_, int M, vector<int> F, vector<vector<int>> S) {
   n=N_, m=M;
   for (int i=0; i<m; ++i) for (int j=1; j<n; ++j) a[i][j]=S[i][j-1]+1;
   for (int i=1; i<=n; ++i) par[i]=F[i-1]+1, g[par[i]].push_back(i);
   int sum=0;
   for (int i=1; i<n; ++i){
      int u=a[0][i];
      if (vis[par[u]]) --sum, ss[u]=0;
      for (int v:g[u]){
         if (!vis[v]) ss[v]=1, ++sum;
      }
      vis[u]=1;
      check[i]=!sum;
      is_equal[i]=1;
   }
   for (int j=1; j<m; ++j){
      sum=0;
      for (int i=1; i<n; ++i){
         if (a[0][i]!=a[j][i]){
            sum-=!!cnt[a[0][i]];
            sum-=!!cnt[a[j][i]];
            ++cnt[a[0][i]]; --cnt[a[j][i]];
            sum+=!!cnt[a[0][i]];
            sum+=!!cnt[a[j][i]];
         }
         is_equal[i]&=!sum;
      }
   }
   int ans=0;
   for (int i=1; i<n; ++i) ans+=check[i] && is_equal[i];
   return ans;
}

Subtask #1
0.0 / 11.0

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

Subtask #2
0.0 / 14.0

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

Subtask #3
0.0 / 5.0

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

Subtask #4
0.0 / 9.0

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

Subtask #5
0.0 / 5.0

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

Subtask #6
0.0 / 11.0

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

Subtask #7
0.0 / 9.0

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

Subtask #8
0.0 / 11.0

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

Subtask #9
0.0 / 9.0

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

Subtask #10
0.0 / 16.0

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