# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
4680 | cki86201 | Saveit (IOI10_saveit) | C++98 | 606 ms | 13704 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 "grader.h"
#include "encoder.h"
void encode_number(int x,int u)
{
for(int i=0;i<u;i++)encode_bit((x&(1<<i))!=0);
}
int st[1010],en[2000020],next[2000020];
bool check[1010];
int up[1010];
void addedge(int s,int d,int c){next[c]=st[s],st[s]=c,en[c]=d;}
void dfs(int x)
{
check[x]=1;
for(int i=st[x];i!=-1;i=next[i]){
if(!check[en[i]]){
up[en[i]]=x;
dfs(en[i]);
}
}
}
int dis[40][1010],q[1010],now;
void bfs(int x)
{
int *f,*r;
# | 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... |