# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
199833 | mohammedehab2002 | Praktični (COCI18_prakticni) | C++11 | 172 ms | 18936 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;
bool vis[100005];
int a[100005],b[100005],c[100005],cum[100005],bas[30],ori[30],mask[30];
vector<pair<int,int> > v[100005];
vector<int> ans[100005];
void dfs(int node)
{
vis[node]=1;
for (auto u:v[node])
{
if (!vis[u.first])
{
cum[u.first]=(cum[node]^u.second);
dfs(u.first);
}
}
}
int add(int a)
{
int tmp=a,p=-1;
for (int i=29;i>=0;i--)
{
if (tmp&(1<<i))
tmp^=bas[i];
if (p==-1 && tmp&(1<<i))
p=i;
}
if (p==-1)
return 0;
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... |
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |