提出 #3957799
ソースコード 拡げる
#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cassert>
#include<ctime>
using namespace std;
#define mind(a,b) (a>b?b:a)
#define maxd(a,b) (a>b?a:b)
#define absd(x) (x<0?-(x):x)
#define pow2(x) ((x)*(x))
#define rep(i,n) for(int i=0; i<n; ++i)
#define repr(i,n) for(int i=n-1; i>=0; --i)
#define repl(i,s,n) for(int i=s; i<=n; ++i)
#define replr(i,s,n) for(int i=n; i>=s; --i)
#define repf(i,s,n,j) for(int i=s; i<=n; i+=j)
#define repe(e,obj) for(auto e : obj)
#define SP << " " <<
#define COL << " : " <<
#define COM << ", " <<
#define ARR << " -> " <<
#define PNT(STR) cout << STR << endl
#define POS(X,Y) "(" << X << ", " << Y << ")"
#define DEB(A) " (" << #A << ") " << A
#define DEBREP(i,n,val) for(int i=0; i<n; ++i) cout << val << " "; cout << endl
#define ALL(V) (V).begin(), (V).end()
#define INF 1000000007
#define INFLL 1000000000000000007LL
#define EPS 1e-9
typedef unsigned int uint;
typedef unsigned long ulong;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define P_TYPE int
typedef pair<P_TYPE, P_TYPE> P;
typedef pair<P, P_TYPE> PI;
typedef pair<P_TYPE, P> IP;
typedef pair<P, P> PP;
typedef priority_queue<P, vector<P>, greater<P> > pvqueue;
#define N 100007
int n;
ll m;
vector<P> g[N];
ll memo[2*N];
ll dfs0(int v, int p, int e) {
ll r = 1;
repe(&pr, g[v]) {
int w = pr.first, d = pr.second;
if(w == p) continue;
r *= 1 + dfs0(w, v, d);
r %= m;
}
return memo[e] = r;
}
ll lv[2*N], rv[2*N];
void dfs1(int v, int p, ll par) {
ll s = 1 + par;
repe(&pr, g[v]) {
int w = pr.first, d = pr.second;
if(w == p) continue;
lv[d] = s;
s *= 1 + memo[d];
s %= m;
}
s = 1;
repr(i, g[v].size()) {
P &pr = g[v][i];
int w = pr.first, d = pr.second;
if(w == p) continue;
rv[d] = s;
s *= 1 + memo[d];
s %= m;
}
repe(&pr, g[v]) {
int w = pr.first, d = pr.second;
if(w == p) continue;
dfs1(w, v, memo[d^1] = lv[d] * rv[d] % m);
}
}
int main() {
scanf("%d %lld", &n, &m);
rep(i, n-1) {
int x, y; scanf("%d %d", &x, &y); --x; --y;
g[x].push_back(P(y, 2*i));
g[y].push_back(P(x, 2*i+1));
}
rep(i, 2*n) memo[i] = -1;
dfs0(0, -1, 2*n);
dfs1(0, -1, 0);
rep(v, n) {
ll r = 1;
repe(&p, g[v]) {
int w = p.first, d = p.second;
r *= 1 + memo[d];
r %= m;
}
printf("%lld\n", r);
}
return 0;
}
提出情報
| 提出日時 |
|
| 問題 |
V - Subtree |
| ユーザ |
yaketake08 |
| 言語 |
C++14 (GCC 5.4.1) |
| 得点 |
100 |
| コード長 |
2662 Byte |
| 結果 |
AC |
| 実行時間 |
91 ms |
| メモリ |
16000 KiB |
コンパイルエラー
./Main.cpp: In function ‘int main()’:
./Main.cpp:98:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %lld", &n, &m);
^
./Main.cpp:100:37: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
int x, y; scanf("%d %d", &x, &y); --x; --y;
^
ジャッジ結果
| セット名 |
All |
| 得点 / 配点 |
100 / 100 |
| 結果 |
|
| セット名 |
テストケース |
| All |
0_00, 0_01, 0_02, 0_03, 1_00, 1_01, 1_02, 1_03, 1_04, 1_05, 1_06, 1_07, 1_08, 1_09, 1_10, 1_11, 1_12, 1_13, 1_14, 1_15, 1_16, 1_17, 1_18, 1_19, 1_20, 1_21, 1_22, 1_23, 1_24, 1_25, 1_26, 1_27, 1_28, 1_29, 1_30, 1_31 |
| ケース名 |
結果 |
実行時間 |
メモリ |
| 0_00 |
AC |
3 ms |
5248 KiB |
| 0_01 |
AC |
3 ms |
5248 KiB |
| 0_02 |
AC |
3 ms |
5248 KiB |
| 0_03 |
AC |
3 ms |
5248 KiB |
| 1_00 |
AC |
3 ms |
5248 KiB |
| 1_01 |
AC |
3 ms |
5248 KiB |
| 1_02 |
AC |
67 ms |
14464 KiB |
| 1_03 |
AC |
91 ms |
14720 KiB |
| 1_04 |
AC |
50 ms |
11380 KiB |
| 1_05 |
AC |
50 ms |
12148 KiB |
| 1_06 |
AC |
50 ms |
11380 KiB |
| 1_07 |
AC |
56 ms |
12148 KiB |
| 1_08 |
AC |
54 ms |
11388 KiB |
| 1_09 |
AC |
56 ms |
12156 KiB |
| 1_10 |
AC |
56 ms |
11520 KiB |
| 1_11 |
AC |
59 ms |
12416 KiB |
| 1_12 |
AC |
58 ms |
11648 KiB |
| 1_13 |
AC |
60 ms |
12416 KiB |
| 1_14 |
AC |
59 ms |
11520 KiB |
| 1_15 |
AC |
63 ms |
12288 KiB |
| 1_16 |
AC |
60 ms |
11136 KiB |
| 1_17 |
AC |
66 ms |
12032 KiB |
| 1_18 |
AC |
66 ms |
11136 KiB |
| 1_19 |
AC |
65 ms |
11904 KiB |
| 1_20 |
AC |
62 ms |
11008 KiB |
| 1_21 |
AC |
66 ms |
11904 KiB |
| 1_22 |
AC |
63 ms |
11136 KiB |
| 1_23 |
AC |
65 ms |
11904 KiB |
| 1_24 |
AC |
62 ms |
11008 KiB |
| 1_25 |
AC |
66 ms |
11904 KiB |
| 1_26 |
AC |
64 ms |
11392 KiB |
| 1_27 |
AC |
65 ms |
11904 KiB |
| 1_28 |
AC |
64 ms |
12672 KiB |
| 1_29 |
AC |
66 ms |
12800 KiB |
| 1_30 |
AC |
63 ms |
13568 KiB |
| 1_31 |
AC |
67 ms |
16000 KiB |