oj.uz

Submission #351256

# Submission time Handle Problem Language Result Execution time Memory
351256 2021-01-19T17:37:42 Z idk321 Parrots (IOI11_parrots) C++11
81 / 100
 8 ms 1540 KB 
#include "encoder.h"
#include "encoderlib.h"

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

void encode(int n, int m[])
{

    vector<int> sm(m, m + n);
   sort(sm.begin(), sm.end());
  bool vis[n] = {};

  for (int i = 0; i  < n; i++)
  {
        for (int j = 0; j < 5; j++) send(m[i]);
  }
    int add = 0;

    int times = 1;
  for (int i = 0; i < n; i++)
  {
        if (add > 255)
        {
            add = 0;
            times++;
        }
        int curr = sm[i];
        int ind = -1;
        for (int j = 0; j < n; j++)
        {
            if (!vis[j] && curr == m[j])
            {
                ind = j;
                vis[j] = true;
                break;
            }
        }
        for (int j = 0; j < times; j++ )send(add + ind);
        add += 32;
    }



}

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

void decode(int n, int l, int x[])
{

    vector<int> freq(256);
    vector<int> res(n, -1);
    for (int i = 0; i < l; i++)
    {
        freq[x[i]]++;
    }
    vector<int> v;
    vector<int> ind;

    for (int i = 0; i < 256; i++)
    {
        for (int j = 0; j < freq[i] / 5; j++)v.push_back(i);
        freq[i] %= 5;
    }

    for (int j = 1; j <= 4; j++)
    {
        for (int i = 0; i < 256; i++)if (freq[i] == j) ind.push_back(i % 32);
    }

    for (int i = 0; i < n; i++)
    {
        //cout << ind[i] << endl;
        res[ind[i]] = v[i];
    }


    for (int i : res) output(i);
}

Subtask #1
17.0 / 17.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1264 KB Output is correct
2 Correct 4 ms 1324 KB Output is correct
3 Correct 3 ms 1144 KB Output is correct
4 Correct 3 ms 1312 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1264 KB Output is correct
2 Correct 2 ms 1324 KB Output is correct
3 Correct 3 ms 1364 KB Output is correct
4 Correct 3 ms 1276 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1264 KB Output is correct
2 Correct 4 ms 1148 KB Output is correct
3 Correct 3 ms 1152 KB Output is correct
4 Correct 6 ms 1320 KB Output is correct
5 Correct 8 ms 1540 KB Output is correct
6 Correct 6 ms 1452 KB Output is correct

Subtask #5
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Partially correct 4 ms 1276 KB Output is partially correct - P = 6.500000
2 Partially correct 7 ms 1344 KB Output is partially correct - P = 7.500000
3 Incorrect 1 ms 948 KB Error : Bad encoded integer
4 Incorrect 1 ms 964 KB Error : Bad encoded integer
5 Incorrect 2 ms 868 KB Error : Bad encoded integer
6 Incorrect 1 ms 868 KB Error : Bad encoded integer
7 Incorrect 1 ms 740 KB Error : Bad encoded integer