# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
335267 | CaroLinda | Džumbus (COCI19_dzumbus) | C++14 | 72 ms | 15212 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>
#define sz(x) (int)(x.size() )
#define ll long long
const int MAXN = 1010 ;
const int inf = 1e9+7 ;
using namespace std ;
//Don't forget to check during the calculation if you are doing operations with infinity
//We don't want overflow, do we?
int N , M , Q ;
int drink[MAXN] , sub[MAXN] ;
int dp0[MAXN][MAXN] , dp1[MAXN][MAXN][2] ;
vector< int > tree[MAXN] ;
bool vis[MAXN] ;
void dfs1(int x, int parent )
{
vis[x] = true ;
for(int i = 0 ; i < sz(tree[x] ) ; i++ )
{
if( tree[x][i] != parent ) continue ;
swap( tree[x][i], tree[x][ sz(tree[x])-1 ] ) ;
tree[x].pop_back() ;
Compilation message (stderr)
# | 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... |