oj.uz

답안 #430888

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
430888 2021-06-17T07:36:50 Z amunduzbaev Regions (IOI09_regions) C++14
30 / 100
 1216 ms 32688 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]<<endl;
	}
}

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
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4936 KB Output is correct
2 Correct 3 ms 4936 KB Output is correct
3 Correct 5 ms 5064 KB Output is correct
4 Correct 7 ms 5064 KB Output is correct
5 Correct 11 ms 5192 KB Output is correct
6 Correct 20 ms 5960 KB Output is correct
7 Correct 28 ms 5576 KB Output is correct
8 Correct 33 ms 5832 KB Output is correct
9 Correct 51 ms 6600 KB Output is correct
10 Correct 76 ms 6984 KB Output is correct
11 Correct 84 ms 6600 KB Output is correct
12 Correct 124 ms 7808 KB Output is correct
13 Correct 143 ms 6932 KB Output is correct
14 Correct 140 ms 6868 KB Output is correct
15 Correct 169 ms 9908 KB Output is correct

Subtask #2
15.0 / 85.0

# 결과 실행 시간 메모리 Grader output
1 Correct 747 ms 9548 KB Output is correct
2 Correct 876 ms 8224 KB Output is correct
3 Correct 1216 ms 11732 KB Output is correct
4 Runtime error 23 ms 21824 KB Execution killed with signal 11
5 Runtime error 25 ms 22608 KB Execution killed with signal 11
6 Runtime error 30 ms 23040 KB Execution killed with signal 11
7 Runtime error 35 ms 23996 KB Execution killed with signal 11
8 Runtime error 50 ms 26508 KB Execution killed with signal 11
9 Runtime error 67 ms 29056 KB Execution killed with signal 11
10 Runtime error 79 ms 30772 KB Execution killed with signal 11
11 Runtime error 71 ms 28496 KB Execution killed with signal 11
12 Runtime error 82 ms 32064 KB Execution killed with signal 11
13 Runtime error 73 ms 31124 KB Execution killed with signal 11
14 Runtime error 90 ms 30576 KB Execution killed with signal 11
15 Runtime error 69 ms 32556 KB Execution killed with signal 11
16 Runtime error 72 ms 32688 KB Execution killed with signal 11
17 Runtime error 73 ms 32656 KB Execution killed with signal 11