oj.uz

답안 #752100

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
752100 2023-06-02T09:48:35 Z minhcool 앵무새 (IOI11_parrots) C++17
81 / 100
 5 ms 1092 KB 
#include "encoder.h"
#include "encoderlib.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
 
#define ll long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
 
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
 
const int N = 3e5 + 5;
 
const int oo = 1e18 + 7, mod = 1e9 + 7;
 
mt19937 rng(1);
 
int rnd(int l, int r){
	int temp = rng() % (r - l + 1);
	return abs(temp) + l;
}
 
void encode(int N, int M[]){
	for(int i = 0; i < N; i++){
		for(int j = 0; j < 8; j++){
			if(M[i] & (1 << j)){
				send(8 * i + j);
			}
		}
	}
}
 
#include "decoder.h"
#include "decoderlib.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

#define ll long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 3e5 + 5;

const int oo = 1e18 + 7, mod = 1e9 + 7;

mt19937 rng(1);

int rnd(int l, int r){
	int temp = rng() % (r - l + 1);
	return abs(temp) + l;
}

void decode(int N, int L, int X[]){
	vector<int> ans(N);
	for(int i = 0; i < L; i++){
		int pos = X[i]/8, pos2 = X[i]%8;
		ans[pos] += (1 << pos2);
	}
	for(int i = 0; i < N; i++) output(ans[i]);
}

Compilation message

encoder.cpp:20:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   20 | const int oo = 1e18 + 7, mod = 1e9 + 7;
      |                ~~~~~^~~

decoder.cpp:20:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   20 | const int oo = 1e18 + 7, mod = 1e9 + 7;
      |                ~~~~~^~~

Subtask #1
17.0 / 17.0

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

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1032 KB Output is correct
2 Correct 2 ms 1036 KB Output is correct
3 Correct 2 ms 1048 KB Output is correct
4 Correct 2 ms 1048 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1028 KB Output is correct
2 Correct 2 ms 1044 KB Output is correct
3 Correct 2 ms 1012 KB Output is correct
4 Correct 3 ms 1012 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1036 KB Output is correct
2 Correct 2 ms 1048 KB Output is correct
3 Correct 2 ms 1052 KB Output is correct
4 Correct 3 ms 1056 KB Output is correct
5 Correct 3 ms 1068 KB Output is correct
6 Correct 3 ms 1072 KB Output is correct

Subtask #5
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 2 ms 1072 KB Output is partially correct - P = 8.000000
2 Partially correct 5 ms 1092 KB Output is partially correct - P = 8.000000
3 Incorrect 1 ms 648 KB Error : Bad encoded integer
4 Incorrect 1 ms 640 KB Error : Bad encoded integer
5 Incorrect 1 ms 648 KB Error : Bad encoded integer
6 Incorrect 1 ms 636 KB Error : Bad encoded integer
7 Incorrect 1 ms 660 KB Error : Bad encoded integer