oj.uz

답안 #849910

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
849910 2023-09-15T14:34:53 Z Andrey 앵무새 (IOI11_parrots) C++14
81 / 100
 5 ms 1568 KB 
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;

void encode(int n, int m[])
{
    vector<int> bruh(0);
    for(int i = 0; i < n; i++) {
        for(int j = 7; j >= 0; j--) {
            if((1 << j)&m[i]) {
                bruh.push_back(1);
            }
            else {
                bruh.push_back(0);
            }
        }
    }
    int br = 0;
    for(int i = 0; i < bruh.size(); i++) {
        if(bruh[i] == 0 && br < 256) {
            send(br);
        }
        else {
            br++;
        }
    }
}

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

void decode(int n, int l, int x[])
{
    vector<int> br(256);
    for(int i = 0; i < l; i++) {
        br[x[i]]++;
    }
    vector<int> bruh(0);
    for(int i = 0; i < 256; i++) {
        for(int j = 0; j < br[i]; j++) {
            bruh.push_back(0);
        }
        bruh.push_back(1);
    }
    for(int i = 0; i < 10000; i++) {
        bruh.push_back(0);
    }
    int sb = 0;
    for(int i = 0; i < n; i++) {
        sb = 0;
        for(int j = i*8; j < (i+1)*8; j++) {
            sb*=2;
            sb+=bruh[j];
        }
        output(sb);
    }
}

Compilation message

encoder.cpp: In function 'void encode(int, int*)':
encoder.cpp:20:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for(int i = 0; i < bruh.size(); i++) {
      |                    ~~^~~~~~~~~~~~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 788 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1308 KB Output is correct
2 Correct 2 ms 1304 KB Output is correct
3 Correct 3 ms 1568 KB Output is correct
4 Correct 3 ms 1148 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1308 KB Output is correct
2 Correct 3 ms 1304 KB Output is correct
3 Correct 3 ms 1312 KB Output is correct
4 Correct 3 ms 1312 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1508 KB Output is correct
2 Correct 2 ms 1160 KB Output is correct
3 Correct 2 ms 1324 KB Output is correct
4 Correct 5 ms 1328 KB Output is correct
5 Correct 3 ms 1380 KB Output is correct
6 Correct 4 ms 1344 KB Output is correct

Subtask #5
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 2 ms 1468 KB Output is partially correct - P = 8.000000
2 Partially correct 3 ms 1332 KB Output is partially correct - P = 8.000000
3 Incorrect 2 ms 1332 KB Error : Output is wrong
4 Incorrect 3 ms 1356 KB Error : Output is wrong
5 Incorrect 4 ms 1360 KB Error : Output is wrong
6 Incorrect 4 ms 1460 KB Error : Output is wrong
7 Incorrect 3 ms 1364 KB Error : Output is wrong