oj.uz

답안 #422400

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
422400 2021-06-10T05:44:40 Z amunduzbaev Unique Cities (JOI19_ho_t5) C++14
4 / 100
 2000 ms 19124 KB 
/* made by amunduzbaev */
 
//~ #include <ext/pb_ds/assoc_container.hpp>
//~ #include <ext/pb_ds/tree_policy.hpp>
#include "bits/stdc++.h"
 
using namespace std;
//~ using namespace __gnu_pbds;

#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
 
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 }
//~ template<class T> using oset = tree<T, 
//~ null_type, less_equal<T>, rb_tree_tag, 
//~ tree_order_statistics_node_update> ordered_set;
 
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, s, t, q, ans, res, a[N];
vii edges[N];
int dd[N];
vpii tt;

void dfs(int u, int p = -1, int d = 0){
	if(d) tt.pb({d, u});
	for(auto x : edges[u]){
		if(x == p) continue;
		dfs(x, u, d+1);
	}
}

void solve(int t_case){
	cin>>n>>m;
	for(int i=1;i<n;i++){
		int a, b; cin>>a>>b;
		edges[a].pb(b), edges[b].pb(a);
	} for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=1;i<=n;i++){
		set<int> ss;
		tt.clear();  dfs(i);
		for(auto x : tt) dd[x.ff]++;
		for(auto x : tt) if(dd[x.ff] == 1) ss.insert(a[x.ss]);
		for(auto x : tt) dd[x.ff]--;
		cout<<sz(ss)<<"\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

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

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 91 ms 5304 KB Output is correct
3 Correct 76 ms 5152 KB Output is correct
4 Correct 112 ms 5244 KB Output is correct
5 Correct 105 ms 5196 KB Output is correct
6 Correct 204 ms 5348 KB Output is correct
7 Correct 144 ms 5380 KB Output is correct
8 Correct 103 ms 5304 KB Output is correct
9 Correct 107 ms 5160 KB Output is correct
10 Correct 106 ms 5196 KB Output is correct
11 Correct 106 ms 5188 KB Output is correct
12 Correct 86 ms 5196 KB Output is correct
13 Correct 150 ms 5448 KB Output is correct
14 Correct 108 ms 5280 KB Output is correct
15 Correct 112 ms 5196 KB Output is correct
16 Correct 86 ms 5196 KB Output is correct
17 Correct 121 ms 5196 KB Output is correct
18 Correct 110 ms 5252 KB Output is correct
19 Correct 107 ms 5196 KB Output is correct
20 Correct 335 ms 5448 KB Output is correct
21 Correct 132 ms 5316 KB Output is correct
22 Correct 103 ms 5068 KB Output is correct
23 Correct 107 ms 5204 KB Output is correct
24 Correct 106 ms 5196 KB Output is correct
25 Correct 105 ms 5196 KB Output is correct
26 Correct 87 ms 5196 KB Output is correct
27 Correct 246 ms 5324 KB Output is correct
28 Correct 181 ms 5292 KB Output is correct
29 Correct 119 ms 5196 KB Output is correct
30 Correct 86 ms 5196 KB Output is correct
31 Correct 162 ms 5196 KB Output is correct
32 Correct 132 ms 5260 KB Output is correct

Subtask #2
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2081 ms 13804 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2093 ms 19124 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 91 ms 5304 KB Output is correct
3 Correct 76 ms 5152 KB Output is correct
4 Correct 112 ms 5244 KB Output is correct
5 Correct 105 ms 5196 KB Output is correct
6 Correct 204 ms 5348 KB Output is correct
7 Correct 144 ms 5380 KB Output is correct
8 Correct 103 ms 5304 KB Output is correct
9 Correct 107 ms 5160 KB Output is correct
10 Correct 106 ms 5196 KB Output is correct
11 Correct 106 ms 5188 KB Output is correct
12 Correct 86 ms 5196 KB Output is correct
13 Correct 150 ms 5448 KB Output is correct
14 Correct 108 ms 5280 KB Output is correct
15 Correct 112 ms 5196 KB Output is correct
16 Correct 86 ms 5196 KB Output is correct
17 Correct 121 ms 5196 KB Output is correct
18 Correct 110 ms 5252 KB Output is correct
19 Correct 107 ms 5196 KB Output is correct
20 Correct 335 ms 5448 KB Output is correct
21 Correct 132 ms 5316 KB Output is correct
22 Correct 103 ms 5068 KB Output is correct
23 Correct 107 ms 5204 KB Output is correct
24 Correct 106 ms 5196 KB Output is correct
25 Correct 105 ms 5196 KB Output is correct
26 Correct 87 ms 5196 KB Output is correct
27 Correct 246 ms 5324 KB Output is correct
28 Correct 181 ms 5292 KB Output is correct
29 Correct 119 ms 5196 KB Output is correct
30 Correct 86 ms 5196 KB Output is correct
31 Correct 162 ms 5196 KB Output is correct
32 Correct 132 ms 5260 KB Output is correct
33 Execution timed out 2081 ms 13804 KB Time limit exceeded
34 Halted 0 ms 0 KB -