# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
871583 | Trisanu_Das | Star Trek (CEOI20_startrek) | C++17 | 45 ms | 19664 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int N=1e5+5;
const ll mod=1e9+7;
ll binpow(ll a,ll b){
ll res=1;
while(b>0){
if(b&1)res*=a,res%=mod;
a*=a,a%=mod;
b>>=1;
}
return res;
}
int n;
ll d,ans,sum;
vector<int> adj[N];
ll dp[N][4];
bool dp1[N],dp2[N];
void dfs(int u,int p){
for(auto v:adj[u]){
if(v==p)continue;
dfs(v,u);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |