# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154219 | Ruxandra985 | Uzastopni (COCI15_uzastopni) | C++14 | 1088 ms | 17528 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];
bitset <101> aux[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];
}
for (i=1;i<=k;i++)
aux[i].reset();
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++){
for (y=x;y<=k;y++){
if (x <= joke[vecin] && joke[vecin] <= y){
if (x > joke[nod] || y < joke[nod])
dp[nod][x][y] = (dp[nod][x][y] | dp[vecin][x][y]);
}
aux[y][x-1] = (aux[y][x-1] | dp[nod][x][y]);
}
}
}
for (len = 2; len <= k ;len++){
for (x = 1; x + len - 1 <= k ; x++){
y = x + len - 1;
if ((dp[nod][x] & aux[y]).count())
dp[nod][x][y] = 1;
//for (z=x;z<y && !dp[nod][x][y];z++){
// dp[nod][x][y] = (dp[nod][x][z] & dp[nod][z+1][y]);
//}
}
}
}
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++)
for (j=joke[1];j<=k;j++){
//if (dp[1][i][j])
// printf ("%d %d\n",i,j);
sol = sol + dp[1][i][j];
}
fprintf (fout,"%d",sol);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |