oj.uz

답안 #430917

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
430917 2021-06-17T07:58:32 Z amunduzbaev Regions (IOI09_regions) C++14
0 / 100
 90 ms 32788 KB 
/* made by amunduzbaev */
 
#include "bits/stdc++.h"
 
using namespace std;
 
//~ #include <ext/pb_ds/assoc_container.hpp>
//~ #include <ext/pb_ds/tree_policy.hpp>
//~ using namespace __gnu_pbds;
//~ template<class T> using oset = tree<T, 
//~ null_type, less_equal<T>, rb_tree_tag, 
//~ tree_order_statistics_node_update>;
 
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vv vector
#define mem(arr, v) memset(arr, v, sizeof arr)
#define int long long
#define degub(x) cout<<#x<<" : "<<x<<"\n"
#define GG cout<<"here"<<endl;
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii; 
typedef vector<int> vii;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) { return a > b ? a = b, true : false; }
template<class T> bool umax(T& a, const T& b) { return a < b ? a = b, true : false; }
template<int sz> using tut = array<int, sz>;
void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);  
	freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
 
const int N = 2e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
 
#define MULTI 0
int n, m, k, t, q, ans, res, a[N];
int cnt[N], col[505][505];
vii edges[N];
 
void dfs(int u, int p = -1){
	for(int i=1;i<=m;i++) col[i][a[u]] += cnt[i];
	cnt[a[u]]++;
	for(auto x : edges[u]){
		if(x == p) continue;
		dfs(x, u);
	} cnt[a[u]]--;
}
 
void solve(int t_case){
	cin>>n>>m>>q;
	cin>>a[1];
	for(int i=2;i<=n;i++){
		int x; cin>>x>>a[i], edges[x].pb(i); 
	}
	
	dfs(1);
	
	for(int i=0;i<q;i++){
		int a, b; cin>>a>>b;
		cout<<col[a][b]<<"\n";
	}
}
 
signed main(){
	NeedForSpeed
	if(MULTI){
		int t; cin>>t;
		for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
	} else solve(1);
	return 0;
}

Compilation message

regions.cpp: In function 'void usaco(std::string)':
regions.cpp:38:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 | void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
regions.cpp:39:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |  freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4 ms 4992 KB Time limit exceeded (wall clock)
2 Execution timed out 3 ms 4936 KB Time limit exceeded (wall clock)
3 Execution timed out 4 ms 5064 KB Time limit exceeded (wall clock)
4 Execution timed out 3 ms 5064 KB Time limit exceeded (wall clock)
5 Execution timed out 4 ms 5192 KB Time limit exceeded (wall clock)
6 Execution timed out 4 ms 6088 KB Time limit exceeded (wall clock)
7 Execution timed out 6 ms 5576 KB Time limit exceeded (wall clock)
8 Execution timed out 4 ms 5832 KB Time limit exceeded (wall clock)
9 Execution timed out 8 ms 6600 KB Time limit exceeded (wall clock)
10 Execution timed out 16 ms 6952 KB Time limit exceeded (wall clock)
11 Execution timed out 15 ms 6600 KB Time limit exceeded (wall clock)
12 Execution timed out 28 ms 7760 KB Time limit exceeded (wall clock)
13 Execution timed out 27 ms 6984 KB Time limit exceeded (wall clock)
14 Execution timed out 21 ms 6856 KB Time limit exceeded (wall clock)
15 Execution timed out 34 ms 9968 KB Time limit exceeded (wall clock)

Subtask #2
0 / 85.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 62 ms 9540 KB Time limit exceeded (wall clock)
2 Execution timed out 64 ms 8256 KB Time limit exceeded (wall clock)
3 Execution timed out 70 ms 11712 KB Time limit exceeded (wall clock)
4 Runtime error 28 ms 21868 KB Execution killed with signal 11
5 Runtime error 28 ms 22640 KB Execution killed with signal 11
6 Runtime error 38 ms 22988 KB Execution killed with signal 11
7 Runtime error 47 ms 23984 KB Execution killed with signal 11
8 Runtime error 43 ms 26432 KB Execution killed with signal 11
9 Runtime error 56 ms 29040 KB Execution killed with signal 11
10 Runtime error 63 ms 30768 KB Execution killed with signal 11
11 Runtime error 73 ms 28540 KB Execution killed with signal 11
12 Runtime error 78 ms 32088 KB Execution killed with signal 11
13 Runtime error 69 ms 31096 KB Execution killed with signal 11
14 Runtime error 73 ms 30592 KB Execution killed with signal 11
15 Runtime error 85 ms 32644 KB Execution killed with signal 11
16 Runtime error 90 ms 32736 KB Execution killed with signal 11
17 Runtime error 77 ms 32788 KB Execution killed with signal 11