| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 60863 | win11905 | Saveit (IOI10_saveit) | C++11 | 390 ms | 11656 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"
#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
static vector<int> g[N], ng[N];
static int d[N], par[N];
static bool chk[N];
static int ntsp[N];
void addShort(int u) {
for(int i = 9; ~i; --i) encode_bit(u >> i & 1);
}
static void dfs(int u, int p) {
if(u) par[u] = p, ng[u].emplace_back(p);
chk[u] = true;
for(int v : g[u]) if(v != p && !chk[v]) ng[u].emplace_back(v), dfs(v, u);
}
// 0 -1 1
void process(int u, int p) {
ntsp[u] = (d[u] == d[p] ? 0 : (d[u] < d[p] ? 1 : 2));
for(int v : ng[u]) if(v != p) process(v, u);
}
void encode(int nv, int nh, int ne, int *v1, int *v2){
for(int i = 0; i < ne; ++i)
| # | 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... | ||||