# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
564993 | birthdaycake | 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.
int dis[1001][37];
vector<int>adj[1001];
void reset(int n, int h){
for(int i = 0; i < n; i++){
adj[i].clear();
for(int j = 0; j < h; j++) dis[i][j] = 1e18;
}
}
int encode_bit(int x){
return x;
}
void encode(int n, int h, int p, int a[], int b[]){
reset(n,h);
for(int i = 0; i < p; i++){
adj[a[i]].push_back(b[i]);
adj[b[i]].push_back(a[i]);
}
for(int i = 0; i < h; i++){
dis[i][i] = 0;
set<pair<int,int>>bfs;
bfs.insert({0,i});
while(bfs.size()){
auto x = *bfs.begin();
bfs.erase(x);
if(dis[x.second][i] < x.first) continue;
for(auto s:adj[x.second]){
if(dis[x.second] + 1 < dis[s]){
dis[s] = dis[x.second] + 1;
bfs.insert({dis[x.second] + 1, s});
}
}
}
}
for(int i = 0; i < n; i++){
for(int j = 0; j < h; j++){
for(int k = 0; k < 10; k++){
if(dis[i][j] & (1 << k)) encode_bit(1);
else encode_bit(0);
}
}
}
}
int dis[1001][37];
void reset(int n, int h){
for(int i = 0; i < n; i++){
for(int j = 0; j < h; j++) dis[i][j] = 0;
}
}
int decode(int n, int h){
reset(n,h);
for(int i = 0; i < n; i++){
for(int j = 0; j < j; j++){
for(int k = 0; k < 10; k++){
dis[i][j] += (1 << decode_bit());
}
}
}
for(int i = 0; i < n; i++){
for(int j = 0; j < h; j++){
hops(j,i,dis[i][j]);
}
}
}