oj.uz

답안 #722458

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
722458 2023-04-12T02:59:44 Z ono_de206 Regions (IOI09_regions) C++14
0 / 100
 101 ms 32584 KB 
#include<bits/stdc++.h>
using namespace std;

#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

// #define int long long
 
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

template<typename T, typename U>
ostream & operator << (ostream &out, const pair<T, U> &c) {
	out << c.first << ' ' << c.second;
    return out;
}

template<typename T>
ostream & operator << (ostream &out, vector<T> &v) {
	const int sz = v.size();
	for (int i = 0; i < sz; i++) {
		if (i) out << ' ';
		out << v[i];
	}
    return out;
}

template<typename T>
istream & operator >> (istream &in, vector<T> &v) {
	for (T &x : v) in >> x;
    return in;
}


template<typename T>
void mxx(T &a, T b){if(b > a) a = b;}
template<typename T>
void mnn(T &a, T b){if(b < a) a = b;}

const int mxn = 2e5 + 10, B = 400;
int cnt[500][mxn], in[mxn], out[mxn], tt, kk[mxn], s[mxn], h[mxn];
vector<int> g[mxn], p[mxn], d[mxn];

void dfs(int to) {
	in[to] = ++tt;
	d[h[to]].pb(in[to]);
	for(int x : g[to]) {
		dfs(x);
	}
	out[to] = tt;
}

void solve(int to, int cn, int id) {
	cnt[kk[id]][h[to]] += cn;
	cn += (h[to] == id);
	for(int x : g[to]) {
		solve(x, cn, id);
	}
	cn -= (h[to] == id);
}

void go() {
	int n, r, q;
	cin >> n >> r >> q;
	for(int i = 1; i<= n; i++) {
		if(i == 1)
			cin >> h[i];
		else
			cin >> s[i] >> h[i];
		p[h[i]].pb(i);
		if(i > 1) g[s[i]].pb(i);
	}
	dfs(1);
	tt = 0;
	// for(int i = 1; i <= r; i++) {
	// 	if(p[h[i]].size() >= B) {
	// 		kk[i] = ++tt;
	// 		solve(1, 0, i);
	// 	}
	// 	sort(all(d[i]));
	// }
	while(q--) {
		// int r1, r2;
		// cin >> r1 >> r2;
		// if(p[r1].size() >= B) {
		// 	cout << cnt[kk[r1]][r2] << '\n';
		// }
		// else {
		// 	int ans = 0;
		// 	for(int x : p[r1]) {
		// 		int ll = lower_bound(all(d[r2]), in[x]) - d[r2].begin() - 1;
		// 		int rr = upper_bound(all(d[r2]), out[x]) - d[r2].begin() - 1;
		// 		ans += rr - ll;
		// 	}
		// 	cout << ans << '\n';
		// }
		// cout.flush();
		cout << 0 << '\n';
	}
}
 
signed main() {
	// #ifndef
	// freopen("file.in", "r", stdin);
	// freopen("file.out", "w", stdout);
	// #endif
	fast;
	int t = 1;
	// cin >> t;
	while(t--) {
		go();
	}
	return 0;
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 14416 KB Output isn't correct
2 Incorrect 7 ms 14396 KB Output isn't correct
3 Incorrect 8 ms 14416 KB Output isn't correct
4 Incorrect 8 ms 14368 KB Output isn't correct
5 Incorrect 8 ms 14416 KB Output isn't correct
6 Incorrect 8 ms 14416 KB Output isn't correct
7 Incorrect 10 ms 14416 KB Output isn't correct
8 Incorrect 10 ms 14544 KB Output isn't correct
9 Incorrect 11 ms 14824 KB Output isn't correct
10 Incorrect 13 ms 14928 KB Output isn't correct
11 Incorrect 12 ms 15244 KB Output isn't correct
12 Incorrect 13 ms 15696 KB Output isn't correct
13 Incorrect 16 ms 15508 KB Output isn't correct
14 Incorrect 16 ms 16116 KB Output isn't correct
15 Incorrect 20 ms 18128 KB Output isn't correct

Subtask #2
0 / 85.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 33 ms 19156 KB Time limit exceeded (wall clock)
2 Execution timed out 29 ms 18256 KB Time limit exceeded (wall clock)
3 Execution timed out 43 ms 20688 KB Time limit exceeded (wall clock)
4 Incorrect 23 ms 16264 KB Output isn't correct
5 Incorrect 21 ms 17488 KB Output isn't correct
6 Execution timed out 26 ms 17476 KB Time limit exceeded (wall clock)
7 Execution timed out 33 ms 18632 KB Time limit exceeded (wall clock)
8 Execution timed out 42 ms 22644 KB Time limit exceeded (wall clock)
9 Execution timed out 60 ms 24136 KB Time limit exceeded (wall clock)
10 Execution timed out 58 ms 28060 KB Time limit exceeded (wall clock)
11 Execution timed out 76 ms 24520 KB Time limit exceeded (wall clock)
12 Execution timed out 96 ms 25844 KB Time limit exceeded (wall clock)
13 Execution timed out 73 ms 25672 KB Time limit exceeded (wall clock)
14 Execution timed out 101 ms 25800 KB Time limit exceeded (wall clock)
15 Execution timed out 79 ms 29384 KB Time limit exceeded (wall clock)
16 Execution timed out 69 ms 32584 KB Time limit exceeded (wall clock)
17 Execution timed out 69 ms 31788 KB Time limit exceeded (wall clock)