oj.uz

Submission #959230

# Submission time Handle Problem Language Result Execution time Memory
959230 2024-04-07T17:51:39 Z d4xn Parrots (IOI11_parrots) C++17
24 / 100
 11 ms 1384 KB 
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;

void encode(int n, int m[]) {
  pair<int, int> a[256];
  
  int curr = 0;
  for (int i = 0; i < 64; i++) {
    for (int j = 0; j < 4; j++) {
      a[curr++] = make_pair(i, j);
    }
  }

  for(int i = 0; i < n; i++) {
    for (int j = 0; j < 4; j++) {
      int x = m[i] % 4;

      int y = 0;
      while (a[y].first != i || a[y].second != j) {
        y++;
      }

      for (int k = 0; k < x; k++) {
        send(y);
      }

      m[i] /= 4;
    }
  }cerr << endl;
}

#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;

void decode(int N, int L, int X[]) {
  pair<int, int> a[256];

  int curr = 0;
  for (int i = 0; i < 64; i++) {
    for (int j = 0; j < 4; j++) {
      a[curr++] = make_pair(i, j);
    }
  }

  int pw[4];
  pw[0] = 1;
  for (int i = 1; i < 4; i++) {
    pw[i] = pw[i-1]*4;
  }

  vector<int> ans(N, 0); 
  for (int i = 0; i < L; i++) {
    int x = X[i];
    ans[a[x].first] += pw[a[x].second];
  }

  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 784 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 796 KB Error : Encoded message too long
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 796 KB Error : Encoded message too long
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 788 KB Error : Encoded message too long
2 Halted 0 ms 0 KB -

Subtask #5
7.0 / 19.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 1312 KB partially correct P=12.000000
2 Partially correct 5 ms 1332 KB partially correct P=12.000000
3 Partially correct 5 ms 1340 KB partially correct P=12.000000
4 Partially correct 6 ms 1352 KB partially correct P=12.000000
5 Partially correct 11 ms 1380 KB partially correct P=12.000000
6 Partially correct 7 ms 1384 KB partially correct P=12.000000
7 Partially correct 7 ms 1384 KB partially correct P=12.000000