Submission #565116

#	Time	Username	Problem	Language	Result	Execution time	Memory
565116		Dodo	Saveit (IOI10_saveit)	C++14	0 / 100	261 ms	25392 KiB

encoder

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

void encode(int n, int h, int p, int a[], int b[]){

  map<pair<int,int>,bool>mp;

  for(int i=0;i<p;i++)
    mp[{a[i],b[i]}]=1;

  for(int i=0;i<h;i++)
  {
    for(int j=0;j<n;j++)
    {
      if(mp[{i,j}]||mp[{j,i}])encode_bit(1);
      else encode_bit(0);
    }
  }
  return;
}

decoder

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


void decode(int n, int h) {
  vector<ll>v[n];
   for(int i=0;i<h;i++)
   {
     for(int j=0;j<n;j++)
     {
       int a = decode_bit();
       if(a==1)
       {
         v[i].push_back(j);
         v[j].push_back(i);
       }
     }
   }

   for(int i=0;i<h;i++)
   {
     deque<ll>q;
     ll vis[n]={};
     vis[i]=1;
     q.push_back(i);
     while(!q.empty())
     {
       ll x=q.front();
       q.pop_front();
       for(auto u:v[x])
       {
         if(vis[u]==0)
         {
           vis[u]=vis[x]+1;
           q.push_back(u);
         }
       }
     }
     for(int j=0;j<n;j++)
     {
       hops(i,j,vis[j]-1);
     }
   }
}

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