제출 #230752

#제출 시각아이디문제언어결과실행 시간메모리
230752Dilshod_Imomov앵무새 (IOI11_parrots)C++17
34 / 100
10 ms1792 KiB
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;
void encode(int N, int M[])
{
	int ind = 0;
	for ( int i = 1000; i <= N * 1000; i += 1000 ) {
		send( M[ind++] + i );
		// cout << M[ind - 1] + i << ' ';
	}
	// cout << '\n';
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
void decode(int N, int L, int X[])
{
	sort( X, X + L );
	int ind = 0;
	for ( int i = 1000; i <= N * 1000; i += 1000 ) {
		output(X[ind++] - i);
		// cout << X[ind - 1] << ' ';
	}
	// cout << "\n";
}
#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...