# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154190 | Ruxandra985 | Uzastopni (COCI15_uzastopni) | C++14 | 1085 ms | 17732 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 <cstdio>
#include <iostream>
#include <vector>
#include <bitset>
using namespace std;
bitset <101> dp[10001][101];
vector <int> v[10001];
int joke[10001],k;
void dfs (int nod){
int i,vecin,x,y,z,len;
dp[nod][joke[nod]][joke[nod]] = 1;
for (i=0;i<v[nod].size();i++){
dfs (v[nod][i]);
vecin = v[nod][i];
/// acum e acum:P
for (x = 1; x<=k;x++) /// daca le as pune pe toate
dp[nod][x] |= dp[vecin][x];
}
for (x=1;x<=joke[nod];x++)
for (y=joke[nod];y<=k;y++)
dp[nod][x][y] = 0;
for (len = 2; len <= k ;len++){
for (x = 1; x + len - 1 <= k ; x++){
y = x + len - 1;
for (z=x;z<y && !dp[nod][x][y];z++){
dp[nod][x][y] = (dp[nod][x][z] & dp[nod][z+1][y]);
}
}
}
for (x = joke[nod] + 1; x<=k;x++)
dp[nod][x].reset();
for (x=1;x<joke[nod];x++)
for (y=x;y<joke[nod];y++)
dp[nod][x][y] = 0;
}
int main()
{
FILE *fin = stdin;
FILE *fout = stdout;
int n,i,x,y,sol,j;
fscanf (fin,"%d",&n);
for (i=1;i<=n;i++){
fscanf (fin,"%d",&joke[i]);
k = max ( k ,joke[i]);
}
for (i=1;i<n;i++){
fscanf (fin,"%d%d",&x,&y);
v[x].push_back(y);
}
dfs (1);
sol = 0;
for (i=1;i<=joke[1];i++)
sol = sol + dp[1][i].count();
fprintf (fout,"%d",sol);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |