| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 201471 | dolphingarlic | Saveit (IOI10_saveit) | C++14 | 264 ms | 12272 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>
#define FOR(i, x, y) for (int i = x; i < y; i++)
using namespace std;
vector<int> graph[1000];
int par[1000], dist[1000][36], state[1000];
bool visited[1000];
void dfs(int node = 0, int parent = 0) {
par[node] = parent;
visited[node] = true;
for (int i : graph[node]) if (!visited[i]) dfs(i, node);
}
void encode(int nv, int nh, int ne, int *v1, int *v2) {
FOR(i, 0, ne) {
graph[v1[i]].push_back(v2[i]);
graph[v2[i]].push_back(v1[i]);
}
dfs();
FOR(i, 0, nv) FOR(j, 0, 10) encode_bit((par[i] & (1 << j)) >> j);
FOR(hub, 0, nh) {
dist[hub][hub] = 1;
queue<int> q;
q.push(hub);
while (q.size()) {
int curr = q.front();
| # | 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... | ||||