Submission #676650

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
676650	2022-12-31T15:24:46 Z	nvujica	Saveit (IOI10_saveit)	C++14	Compilation error	0 ms	0 KB

encoder

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

const int maxn = 1005, maxh = 40;

int dist[maxh][maxn];
queue <int> q;
vector <int> v[maxn];

int rek(int x, int p){
	for(int i = 0; i < v[x].size(); i++){
		int x2 = v[x][i];
		
		if(x2 == p) continue;
		
		ll b3 = 0;
		
		for(int j = 0; j < 36; j++){
			b3 *= 3;
			
			if(dist[j][x2] - dist[j][x] == 1) b3 += 1;
			else if(dist[j][x2] - dist[j][x] == -1) b3 += 2; 
		}
		
		for(int j = 0; j < 10; j++){
			if(p & (1 << j)) encode_bit(1);
			else encode_bit(0);
		}
		
		for(int j = 0; j < 58; j++){
			if(b3 & (1LL << j)) encode_bit(1);
			else encode_bit(0);
		}
		
		rek(x2, x);
	}
}

void encode(int n, int h, int p, int *a, int *b){
	memset(dist, -1, sizeof dist);
	
	for(int i = 0; i < p; i++){
		v[a[i]].push_back(b[i]);
		v[b[i]].push_back(a[i]);
	}
	
	for(int i = 0; i < h; i++){
		dist[i][i] = 0;
		q.push(i);
		
		while(!q.empty()){
			int x = q.front();
			q.pop();
			
			for(int j = 0; j < v[x].size(); j++){
				int x2 = v[x][j];
				
				if(dist[i][x2] == -1){
					dist[i][x2] = dist[i][x] + 1;
					q.push(x2);
				}
			}
		}
	}
	
	for(int i = 0; i < h; i++){
		for(int j = 0; j < 10; j++){
			if(dist[0][i] & (1 << j)) encode_bit(1);
			else encode_bit(0);
		}
	}
	
	rek(0, -1);
}

decoder

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

const int maxn = 1005, maxh = 40;

int dist[maxh][maxn];

void decode(int n, int h){
	for(int i = 0; i < h; i++){
		for(int j = 0; j < 10; j++){
			dist[0][i] *= 2;
			dist[0][i] += decode_bit();
		}
	}
	
	for(int i = 1; i < n; i++){
		int p = 0;
		
		for(int j = 0; j < 10; j++){
			p *= 2;
			p += decode_bit();
		}
		
		ll b3 = 0;
		
		for(int j = 0; j < 58; j++){
			b3 *= 2;
			b3 += decode_bit();
		}
		
		for(int j = 0; j < h; j++){
			int x = b3 % 3;
			
			if(x == 0) dist[j][i] = dist[j][p];
			if(x == 1) dist[j][i] = dist[j][p] + 1;
			if(x == 2) dist[j][i] = dist[j][p] - 1;
			
			b3 /= 3;
		}
	}
	
	for(int i = 0; i < h; i++){
		for(int j = 0; j < n; j++){
			hops(i, j, dist[i][j]);
		}
	}
}

Compilation message

encoder.cpp:9:1: error: 'queue' does not name a type; did you mean 'sigqueue'?
    9 | queue <int> q;
      | ^~~~~
      | sigqueue
encoder.cpp:10:1: error: 'vector' does not name a type
   10 | vector <int> v[maxn];
      | ^~~~~~
encoder.cpp: In function 'int rek(int, int)':
encoder.cpp:13:21: error: 'v' was not declared in this scope
   13 |  for(int i = 0; i < v[x].size(); i++){
      |                     ^
encoder.cpp:39:1: warning: no return statement in function returning non-void [-Wreturn-type]
   39 | }
      | ^
encoder.cpp: In function 'void encode(int, int, int, int*, int*)':
encoder.cpp:45:3: error: 'v' was not declared in this scope
   45 |   v[a[i]].push_back(b[i]);
      |   ^
encoder.cpp:51:3: error: 'q' was not declared in this scope
   51 |   q.push(i);
      |   ^
encoder.cpp:57:23: error: 'v' was not declared in this scope
   57 |    for(int j = 0; j < v[x].size(); j++){
      |                       ^