Submission #64325

#	Time	Username	Problem	Language	Result	Execution time	Memory
64325		Abelyan	Saveit (IOI10_saveit)	C++17	0 / 100	273 ms	6688 KiB

encoder

#include "grader.h"
#include "encoder.h"
#include <bits/stdc++.h>
using namespace std;

#define fr first
#define sc second
#define cout cerr

const int N=1006,H=40,P3[6]={1,3,9,27,81,243};
vector<int> g[N],graph[N];
int pars[N],pr[H][N];
bool col[N];
queue<pair<int,int> > q;
int dist[N][H];

void to_bit(int k){
    for (int i=9;i>=0;i--){
        if (k&(1<<i)){
            encode_bit(1);
        }
        else{
            encode_bit(0);
        }
    }
}

void dfs(int v,int p=-1){
    col[v]=true;
    for (int i=0;i<g[v].size();i++){
        int to=g[v][i];
        if (!col[to]) dfs(to,v);
    }
    pars[v]=p;
}

void dfshub(int v,int hub,int p=-1){
    //cout<<v<<" "<<hub<<" "<<p<<endl;
    for (int i=0;i<graph[v].size();i++){
        int to=graph[v][i];
        if (to!=p)dfshub(to,hub,v);
    }
    if (p!=-1)
        pr[hub][v]=p;
}

void encode(int n, int h, int m, int *a, int *b){
    
}

decoder

#include "grader.h"
#include "decoder.h"
#include <bits/stdc++.h>
using namespace std;

#define fr first
#define sc second
#define cout cerr

const int N=1006,H=40,P3[6]={1,3,9,27,81,243};
vector<int> gr[N];
int tarb[N][H];

int to_dec(){
    int ans=0;
    for (int i=9;i>=0;i--){
        ans+=(1<<i)*decode_bit();
    }
    //cout<<ans<<endl;
    return ans;
}

void to_tr(int k,int arr[]){
    for (int i=5;i>=0;i--){
        arr[5-i]=k/P3[i];
        k%=P3[i];
    }
}

int dfsdec(int v,int ans,int hub,int par=-1){
    for (int i=0;i<gr[v].size();i++){
        int to=gr[v][i];
        if (to!=par)
            dfsdec(to,ans+tarb[to][hub]-1,hub,v);
    }
    hops(hub,v,ans);
}

void decode(int n, int h) {
    for (int i=0;i<n*h;i++){
        if (i==0)hops(0,0,0);
        else hops(0,0,-1);
    }
}

Compilation message (stderr)

encoder.cpp: In function 'void dfs(int, int)':
encoder.cpp:30:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<g[v].size();i++){
                  ~^~~~~~~~~~~~
encoder.cpp: In function 'void dfshub(int, int, int)':
encoder.cpp:39:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<graph[v].size();i++){
                  ~^~~~~~~~~~~~~~~~

decoder.cpp: In function 'int dfsdec(int, int, int, int)':
decoder.cpp:31:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<gr[v].size();i++){
                  ~^~~~~~~~~~~~~
decoder.cpp:37:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

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