Submission #351425

#TimeUsernameProblemLanguageResultExecution timeMemory
351425amunduzbaevParrots (IOI11_parrots)C++14
34 / 100
2 ms1336 KiB
#include "encoder.h"
#include "encoderlib.h"

#ifndef EVAL
#include "grader.cpp" 
#endif

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


void encode(int N, int M[]){
	vector<int> ans(N);
	for(int i=0;i<N;i++){
		ans[i] = M[i];
		if(i) ans[i] += ans[i-1]; 
		send(ans[i]);
	}
}
#include "decoder.h"
#include "decoderlib.h"

#ifndef EVAL
#include "grader.cpp" 
#endif

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

void decode(int n, int l, int x[]){
	sort(x, x+l);
	vector<int> ans(l);
	for(int i=0;i<l;i++){
		int tmp = x[i];
		if(i) tmp -= x[i-1];
		output(tmp);
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...