# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
667625 | 2022-12-01T20:03:41 Z | berr | Star Trek (CEOI20_startrek) | C++17 | 3 ms | 5076 KB |
#include <bits/stdc++.h> using namespace std; const int N=1e5+37; vector<int> adj[N], adj2[N]; int huh, huuh, mod=1e9+7; int mul(int x, int y){ return (x*y)%mod; } int poww(int x, int y) { if(y==0) return 1; int tmp=poww(x, y/2); if(y%2) return mul(tmp, mul(tmp, x)); return mul(tmp, tmp); } int dfs2(int v, int p, int d) { int f=1; if(d%2==0) f=0; int count=0, val=0; for(auto i: adj2[v]) { if(i==p) continue; if(dfs2(i, v, d+1)) { if(d%2==0){ f=1; } } else { if(d%2) f=0; } } return f; } int dfs(int v, int p, int d) { int f=1; if(d%2==0) f=0; int count=0, val=0; for(auto i: adj[v]) { if(i==p) continue; if(dfs(i, v, d+1)) { if(d%2==0){ f=1; } } else { if(d%2) f=0; } } if(huh==v) { if(dfs2(huuh, 0, d+1)) { if(d%2==0) f=1; } else { if(d%2) f=0; } } return f; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, d; cin>>n>>d; for(int i=0; i<n-1; i++){ int x, y; cin>>x>>y; adj[x].push_back(y); adj[y].push_back(x); adj2[x].push_back(y); adj2[y].push_back(x); } int ans=0; { cout<<poww(2, d+1); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 4948 KB | Output is correct |
2 | Incorrect | 3 ms | 5076 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 4968 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 4944 KB | Output is correct |
2 | Incorrect | 3 ms | 4948 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 4944 KB | Output is correct |
2 | Incorrect | 3 ms | 4948 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 4944 KB | Output is correct |
2 | Incorrect | 3 ms | 4948 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 4944 KB | Output is correct |
2 | Incorrect | 3 ms | 4948 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 4944 KB | Output is correct |
2 | Incorrect | 3 ms | 4948 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 4948 KB | Output is correct |
2 | Incorrect | 3 ms | 5076 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |