oj.uz

Submission #1094363

# Submission time Handle Problem Language Result Execution time Memory
1094363 2024-09-29T12:40:23 Z Sunbae September (APIO24_september) C++17
0 / 100
 2 ms 5468 KB 
#include <cstdio>
#include <algorithm>
#include <vector>
#include "september.h"
using namespace std;
const int N = 1e5 + 5, M = 2e5 + 20;
vector<int> g[N];
int bit[M], tin[N], tout[N], T[N], mn[N], mx[N], ti;
void upd(int i, int v){ for(; i<M; i+=i&-i) bit[i] += v;}
int qry(int i){ int r = 0; for(; i; i-=i&-i) r += bit[i]; return r;}
void dfs(int u){
	tin[u] = ti++;
	for(int v: g[u]) dfs(v);
	tout[u] = ti-1;
}
int solve(int n, int m, vector<int> up, vector<vector<int>> S){
	for(int i = 0; i<n; ++i) g[i].clear();
	for(int i = ti = 1; i<n; ++i) g[up[i]].push_back(i);
	dfs(0);
	fill(mn, mn+n, n+1); fill(mx, mx+n, 0);
	for(int i = 0; i<n; ++i) T[tin[i]] = i;
	for(int i = 0, cnt; i<m; ++i){
		fill(bit, bit+n+1, cnt = 0);
		for(int u: S[i]){
			if(!qry(tin[u])){
				++cnt;
				upd(tin[u], +1); upd(tout[u]+1, -1);
				for(int j = tin[u]; j<=tout[u]; ++j){
					mn[T[j]] = min(mn[T[j]], cnt);
					mx[T[j]] = max(mx[T[j]], cnt);
				} 
			}
		}
	}
	fill(bit, bit+(n<<1)+20, 0);
	int MN = (n<<1) + 20, MX = 0;
	for(int i = 1; i<n; ++i){
		int l = (mn[i]<<1), r = (mx[i]<<1);
		upd(l, +1); upd(r+1, -1);
		MN = min(MN, l); MX = max(MX, r);
	}
	int cnt = 0;
	for(int i = MN; i<=MX; ++i) if(qry(i) && !qry(i-1)) ++cnt;
	return cnt;
}

Subtask #1
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 5212 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 5212 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 2 ms 5468 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 5212 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 2 ms 5468 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 5212 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 2 ms 5468 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 5212 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 2 ms 5468 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 5212 KB Output isn't correct
2 Halted 0 ms 0 KB -