# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
152392 | sofhiasouza | Poklon (COCI17_poklon7) | C++14 | 934 ms | 262148 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 pb push_back
#define int long long
using namespace std;
const int maxn = 4e6+10;
int n, cont, qtdz, val[maxn];
vector < int > grafo[maxn];
vector < bool >resp;
void dfs(int u, int niv)
{
if(!grafo[u].size())
{
vector < bool > aux;
int flag = 0;
for(int i = 31 ; i >= 0 ; i--)
{
if(val[u]&(1 << i))
{
flag = 1;
aux.pb(1);
}
else if(flag) aux.pb(0);
}
if(aux.size()+niv > resp.size()+qtdz)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |