# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
564984 | shrimb | Saveit (IOI10_saveit) | C++17 | 248 ms | 12568 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;
void encode(int n, int h, int p, int *v1, int *v2){
vector<int> adj[n + 1];
for (int i = 0 ; i < p ; i++) {
adj[v1[i]].push_back(v2[i]);
adj[v2[i]].push_back(v1[i]);
}
for (int i = 0 ; i < h ; i++) {
int dist[n];
for (int j = 0 ; j < n ; j++) dist[j] = INT_MAX;
dist[i] = 0;
queue<int> q;
q.push(i);
while (q.size()) {
auto cur = q.front();
q.pop();
for (int j : adj[cur]) {
if (dist[j] > dist[cur] + 1) {
dist[j] = dist[cur] + 1;
q.push(j);
}
}
}
for (int j = 0 ; j < n ; j++) {
for (int k = 0 ; k < 10 ; k++) {
# | 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... |