oj.uz

Submission #788204

# Submission time Handle Problem Language Result Execution time Memory
788204 2023-07-20T00:03:12 Z horiiseun Parrots (IOI11_parrots) C++17
81 / 100
 4 ms 1072 KB 
#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include "encoder.h"
#include "encoderlib.h"
using namespace std;

void encode(int N, int M[]) {
	for (int i = 0; i < N; i++) {
		for (int j = 0; j <= 7; j++) {
			if (M[i] & (1 << j)) {
				send(i * 8 + j);
			}
		}
	}
}
#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include "decoder.h"
#include "decoderlib.h"
using namespace std;

void decode(int N, int L, int X[]) {
	vector<int> ans(N, 0);
	for (int i = 0; i < L; i++) {
		ans[X[i] / 8] |= (1 << (X[i] % 8));
	}
	for (int i = 0; i < N; i++) {
		output(ans[i]);
	}
}

Subtask #1
17.0 / 17.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1028 KB Output is correct
2 Correct 2 ms 1004 KB Output is correct
3 Correct 2 ms 1040 KB Output is correct
4 Correct 2 ms 1036 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1028 KB Output is correct
2 Correct 2 ms 1048 KB Output is correct
3 Correct 1 ms 1036 KB Output is correct
4 Correct 1 ms 1044 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1032 KB Output is correct
2 Correct 2 ms 1072 KB Output is correct
3 Correct 2 ms 1044 KB Output is correct
4 Correct 3 ms 1064 KB Output is correct
5 Correct 3 ms 1056 KB Output is correct
6 Correct 4 ms 1060 KB Output is correct

Subtask #5
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 1040 KB Output is partially correct - P = 8.000000
2 Partially correct 3 ms 1060 KB Output is partially correct - P = 8.000000
3 Incorrect 0 ms 512 KB Error : Bad encoded integer
4 Incorrect 0 ms 548 KB Error : Bad encoded integer
5 Incorrect 0 ms 520 KB Error : Bad encoded integer
6 Incorrect 1 ms 684 KB Error : Bad encoded integer
7 Incorrect 1 ms 652 KB Error : Bad encoded integer