| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 796928 | I_Love_EliskaM_ | Saveit (IOI10_saveit) | C++14 | 278 ms | 10344 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 <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<n;++i)
#define pb push_back
const int N=1e3;
vector<int> adj[N];
vector<int> nadj[N];
int par[N];
int vis[N];
void dfs(int u, int p) {
if (vis[u]) return;
vis[u]=1;
par[u]=p;
for(auto&v:adj[u]) {
if (v==p) continue;
dfs(v,u);
}
}
void encode(int n, int h, int p, int a[], int b[]) {
forn(i,p) {
int u=a[i], v=b[i];
adj[u].pb(v), adj[v].pb(u);
}
dfs(0,0);
forn(i,n) forn(j,10) encode_bit((par[i]>>j)&1);
| # | 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... | ||||