# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
503046 | ismoilov | Biochips (IZhO12_biochips) | C++14 | 268 ms | 402372 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;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
#define fpp(a,i,c) for(int (a) = (i); (a) <= (c); (a)++)
#define fm(a,i,c) for(int (a) = (i); (a) > (c); (a)--)
#define fmm(a,i,c) for(int (a) = (i); (a) >= (c); (a)--)
const int maxx = 2e5+5;
int a[maxx], b[maxx];
int d[maxx][505];
vector <int> g[maxx];
int n, m, r, cnt = 0;
void dfs(int v){
b[v] = cnt;
for(auto it : g[v])
dfs(it);
fpp(i,1,m)
d[cnt+1][i] = max(d[cnt][i], d[b[v]][i - 1] + a[v]);
cnt ++;
}
void S()
{
cin >> n >> m;
fpp(i,1,n){
int x;
cin >> x >> a[i];
if(x == 0)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |