Submission #888643

#	Time	Username	Problem	Language	Result	Execution time	Memory
888643		Sir_Ahmed_Imran	Saveit (IOI10_saveit)	C++17	0 / 100	150 ms	17952 KiB

encoder

                              ///~~~LOTA~~~///
#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
#define N 1000
void encode(int n,int m,int p,int a[],int b[]){
    int o;
    int d[m][n];
    bool vis[n];
    vector<int> e[n];
    for(int i=0;i<m;i++){
        e[a[i]].push_back(b[i]);
        e[b[i]].push_back(a[i]);
    }
    for(int i=0;i<m;i++){
        for(int j=o=0;j<n;j++)
            vis[j]=1;
        vector<int> u,v{i};
        while(!v.empty()){
            for(auto& j:v){
                d[i][j]=o;
                for(auto& k:e[j]){
                    if(vis[k])
                        u.push_back(k);
                    vis[k]=0;
                }
            }
            o++;
            v=u;
            u.clear();
        }
    }
    for(int i=0;i<m;i++){
        for(int j=0;j<n;j++){
            for(int k=512;k>0;k/=2){
                if(d[i][j]>=k){
                    encode_bit(1);
                    d[i][j]-=k;
                }
                else encode_bit(0);
            }
        }
    }
}

decoder

                              ///~~~LOTA~~~///
#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
#define N 1000
void decode(int n,int m){
    int o;
    for(int i=0;i<m;i++){
        for(int j=0;j<n;j++){
            o=0;
            for(int k=512;k>0;k/=2){
                if(decode_bit()) o+=k;
            }
            hops(i,j,o);
        }
    }
}

• Subtask 1: 0 / 25
• Subtask 2: 0 / 25
• Subtask 3: 0 / 25
• Subtask 4: 0 / 25