oj.uz

Submission #960305

# Submission time Handle Problem Language Result Execution time Memory
960305 2024-04-10T08:23:23 Z penguin133 Parrots (IOI11_parrots) C++17
81 / 100
 3 ms 1732 KB 
#include <bits/stdc++.h>
using namespace std;

//#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
#include "encoder.h"
#include "encoderlib.h"

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] >> j & 1){
				  send(i * 8 + j);
			  }
		  }
	  }
  }
}
#include <bits/stdc++.h>
using namespace std;

//#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
#include "decoder.h"
#include "decoderlib.h"

void decode(int N, int L, int X[])
{
	int ans[300] = {0};
  if(N <= 32){
	  for(int i = 0; i < L; i++){
		  int t = X[i] / 8, t1 = X[i] % 8;
		  ans[t] += (1<<t1);
	  }
	  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 788 KB Output is correct

Subtask #2
17.0 / 17.0

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

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1304 KB Output is correct
2 Correct 1 ms 1316 KB Output is correct
3 Correct 1 ms 1316 KB Output is correct
4 Correct 1 ms 1308 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 2 ms 1320 KB Output is correct
3 Correct 2 ms 1732 KB Output is correct
4 Correct 2 ms 1332 KB Output is correct
5 Correct 3 ms 1332 KB Output is correct
6 Correct 3 ms 1328 KB Output is correct

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 1312 KB partially correct P=8.000000
2 Partially correct 2 ms 1336 KB partially correct P=8.000000
3 Incorrect 1 ms 1048 KB Error : Output length must be N
4 Halted 0 ms 0 KB -