oj.uz

Submission #919927

# Submission time Handle Problem Language Result Execution time Memory
919927 2024-02-01T20:56:47 Z Lalic Parrots (IOI11_parrots) C++17
88 / 100
 7 ms 1380 KB 
#include <bits/stdc++.h>
#include "encoder.h"
#include "encoderlib.h"

using namespace std;

void encode(int N, int M[])
{
	if(N<=32){
		for(int i=0;i<N;i++){
			for(int j=0;j<8;j++){
				if(!(M[i]&(1<<j))) continue;
				
				int id=j, pos=i;
				send(id+(1<<3)*pos);
			}
		}
	}
	else{
		for(int i=0;i<N;i++){
			for(int j=0;j<8;j++){
				if(!(M[i]&(1<<j))) continue;
				
				int pos=i, id=j>>1;
				if(j&1) send(id+(1<<2)*pos);
				send(id+(1<<2)*pos);
			}
		}
	}
}

#include <bits/stdc++.h>
#include "decoder.h"
#include "decoderlib.h"

using namespace std;

void decode(int N, int L, int X[])
{
	vector<int> arr(N, 0);
	
	for(int i=0;i<L;i++){
		if(N<=32){
			int bit=X[i]%8, pos=X[i]/8;
			arr[pos]+=(1<<bit);
		}
		else{
			int bit=2*(X[i]%4), pos=X[i]/4;
			arr[pos]+=(1<<bit);
		}
	}
	
	for(auto u : arr) output(u);
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 780 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1312 KB Output is correct
2 Correct 1 ms 1300 KB Output is correct
3 Correct 2 ms 1300 KB Output is correct
4 Correct 1 ms 1308 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1308 KB Output is correct
2 Correct 1 ms 1300 KB Output is correct
3 Correct 1 ms 1312 KB Output is correct
4 Correct 2 ms 1316 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1304 KB Output is correct
2 Correct 1 ms 1308 KB Output is correct
3 Correct 2 ms 1312 KB Output is correct
4 Correct 2 ms 1332 KB Output is correct
5 Correct 3 ms 1320 KB Output is correct
6 Correct 3 ms 1324 KB Output is correct

Subtask #5
7.0 / 19.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 1308 KB Output is partially correct - P = 8.000000
2 Partially correct 3 ms 1324 KB Output is partially correct - P = 8.000000
3 Partially correct 4 ms 1340 KB Output is partially correct - P = 12.000000
4 Partially correct 5 ms 1352 KB Output is partially correct - P = 12.000000
5 Partially correct 6 ms 1376 KB Output is partially correct - P = 12.000000
6 Partially correct 5 ms 1380 KB Output is partially correct - P = 12.000000
7 Partially correct 7 ms 1372 KB Output is partially correct - P = 12.000000