# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
205182 | stefdasca | Saveit (IOI10_saveit) | C++14 | 0 ms | 0 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<bits/stdc++.h>
#include "grader.h"
#include "encoder.h"
using namespace std;
vector<int> v[1002];
int dist[40][1002], tt[40][1002], state[1002];
void encode(int n, int h, int m, int *a, int *b)
{
for(int i = 0; i < m; ++i)
{
v[a[i]].push_back(b[i]);
v[b[i]].push_back(a[i]);
}
for(int i = 0; i < h; ++i)
{
for(int j = 0; j < n; ++j)
dist[i][j] = (1<<30);
dist[i][i] = 0;
deque<int> d;
while(!d.empty())
{
int nod = d[0];
d.pop_front()
for(int i = 0; i < v[nod].size(); ++i)
{
int vecin = v[nod][i];
if(dist[i][vecin] > dist[i][nod] + 1)
{
dist[i][vecin] = dist[i][nod] + 1;
tt[i][vecin] = nod;
d.push_back(vecin);
}
}
}
if(i == 0)
for(int j = 1; j < n; ++j)
for(int x = 0; x < 10; ++x)
encode_bit((tt[0][j] & (1<<x)) != 0);
for(int j = 0; j < n; ++j)
{
if(dist[i][j] == dist[i][tt[0][j]])
state[j] = 0;
else
if(dist[i][j] > dist[i][tt[0][j]])
state[j] = 1;
else
state[j] = 2;
}
// 5 states with 8 bits
for(int j = 0; j < n; j += 5)
{
int msk = 0;
for(int x = j; x < min(n-1, j + 4); ++x)
msk = msk * 3 + state[x];
for(int pw = 0; pw <= 7; ++pw)
encode_bit((msk & (1<<pw)) != 0);
}
}
}