oj.uz

Submission #756036

# Submission time Handle Problem Language Result Execution time Memory
756036 2023-06-11T00:52:16 Z That_Salamander Parrots (IOI11_parrots) C++14
52 / 100
 3 ms 1052 KB 
#include <bits/stdc++.h>

#define FOR(var,bound) for(int var = 0; var < bound; var++)
#define FORB(var,lb,ub) for (int var = lb; var < ub; var++)
#define FORR(var,bound) for(int var = bound-1; var >= 0; var--)

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pii;

void send(int x);
void output(int x);

void encode(int n, int m[]) {
    FOR (i, n) {
        send(i * 4 * 4 + (m[i] & 0x3));
        send((i*4+1) * 4 + ((m[i] >> 2) & 0x3));
        send((i*4+2) * 4 + ((m[i] >> 4) & 0x3));
        send((i*4+3) * 4 + ((m[i] >> 6) & 0x3));
    }
}
#include <bits/stdc++.h>

#define FOR(var,bound) for(int var = 0; var < bound; var++)
#define FORB(var,lb,ub) for (int var = lb; var < ub; var++)
#define FORR(var,bound) for(int var = bound-1; var >= 0; var--)

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pii;

void send(int x);
void output(int x);

void decode(int N, int L, int X[]) {
    sort(X, X + L);

    FOR (i, N) {
        output((X[i*4]&0x3) + ((X[i*4+1]&0x3)<<2) + ((X[i*4+2]&0x3)<<4) + ((X[i*4+3]&0x3)<<6));
    }
}

Subtask #1
17.0 / 17.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1040 KB Output is correct
2 Correct 2 ms 1032 KB Output is correct
3 Correct 2 ms 1032 KB Output is correct
4 Correct 2 ms 1036 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1028 KB Output is correct
2 Correct 3 ms 1044 KB Output is correct
3 Correct 2 ms 1048 KB Output is correct
4 Correct 2 ms 1052 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1028 KB Output is correct
2 Correct 2 ms 1040 KB Output is correct
3 Incorrect 1 ms 612 KB Error : Bad encoded integer
4 Halted 0 ms 0 KB -

Subtask #5
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1036 KB Output is correct - P = 4.000000
2 Incorrect 2 ms 516 KB Error : Bad encoded integer
3 Incorrect 1 ms 520 KB Error : Bad encoded integer
4 Incorrect 2 ms 512 KB Error : Bad encoded integer
5 Incorrect 1 ms 516 KB Error : Bad encoded integer
6 Incorrect 1 ms 516 KB Error : Bad encoded integer
7 Incorrect 0 ms 516 KB Error : Bad encoded integer