oj.uz

Submission #933796

# Submission time Handle Problem Language Result Execution time Memory
933796 2024-02-26T10:44:36 Z AtabayRajabli Parrots (IOI11_parrots) C++17
81 / 100
 3 ms 1568 KB 
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>

using namespace std;

void encode(int N, int M[])
{
  for(int i = 0; i < N; i++)
  {
    int msg = 0;
    for(int j = 4; j >= 0; j--)
    {
      if((1 << j) & i)msg += (1 << (j + 3));
    }
    for(int j = 7; j >= 0; j--)
    {
      int msg2 = msg;
      if((1 << j) & M[i])
      {
        for(int k = 2; k >= 0; k--)
        {
          if(j & (1 << k))msg2 += (1 << k);
        }
        send(msg2);
      }
    }
    
  }
}

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

using namespace std;

void decode(int N, int L, int X[])
{
  vector<int> ans(N, 0);
  for(int i = 0; i < L; i++)
  {
    int ind = 0;
    for(int j = 7; j >= 3; j--)
    {
      if((1 << j) & X[i])ind += (1 << (j - 3));
    }
    int y = 0;
    for(int j = 2; j >= 0; j--)
    {
      y += ((1 << j) & X[i]);
    }
    ans[ind] += (1 << y);
  }
  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 792 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 1396 KB Output is correct
3 Correct 1 ms 1316 KB Output is correct
4 Correct 2 ms 1316 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 1308 KB Output is correct
3 Correct 1 ms 1312 KB Output is correct
4 Correct 1 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 2 ms 1320 KB Output is correct
3 Correct 2 ms 1324 KB Output is correct
4 Correct 3 ms 1328 KB Output is correct
5 Correct 3 ms 1568 KB Output is correct
6 Correct 3 ms 1336 KB Output is correct

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 1312 KB partially correct P=8.000000
2 Partially correct 3 ms 1336 KB partially correct P=8.000000
3 Incorrect 2 ms 1340 KB Error : Output is wrong
4 Halted 0 ms 0 KB -