# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154189 | 2019-09-18T18:48:44 Z | Ruxandra985 | Uzastopni (COCI15_uzastopni) | C++14 | 500 ms | 17864 KB |
#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 = joke[nod] + 1; x<=k;x++) dp[nod][x] |= dp[vecin][x]; //for (y=x;y<=k;y++) // dp[nod][x][y] = (dp[nod][x][y] | dp[vecin][x][y]); for (x=1;x<joke[nod];x++) for (y=x;y<joke[nod];y++) dp[nod][x][y] = (dp[nod][x][y] | dp[vecin][x][y]); } 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++) for (j=joke[1];j<=k;j++){ sol = sol + dp[1][i][j]; } fprintf (fout,"%d",sol); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 632 KB | Output is correct |
2 | Correct | 3 ms | 632 KB | Output is correct |
3 | Correct | 3 ms | 760 KB | Output is correct |
4 | Correct | 3 ms | 632 KB | Output is correct |
5 | Correct | 3 ms | 760 KB | Output is correct |
6 | Correct | 48 ms | 904 KB | Output is correct |
7 | Correct | 47 ms | 744 KB | Output is correct |
8 | Correct | 48 ms | 760 KB | Output is correct |
9 | Correct | 45 ms | 764 KB | Output is correct |
10 | Correct | 45 ms | 760 KB | Output is correct |
11 | Correct | 40 ms | 16632 KB | Output is correct |
12 | Correct | 28 ms | 16632 KB | Output is correct |
13 | Correct | 22 ms | 16632 KB | Output is correct |
14 | Execution timed out | 1084 ms | 17600 KB | Time limit exceeded |
15 | Execution timed out | 1060 ms | 17864 KB | Time limit exceeded |
16 | Execution timed out | 1073 ms | 17736 KB | Time limit exceeded |
17 | Correct | 22 ms | 16632 KB | Output is correct |
18 | Correct | 22 ms | 16632 KB | Output is correct |
19 | Execution timed out | 1081 ms | 4828 KB | Time limit exceeded |
20 | Execution timed out | 1064 ms | 4824 KB | Time limit exceeded |