oj.uz

답안 #982867

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
982867 2024-05-14T21:49:28 Z AmirAli_H1 Broken Device (JOI17_broken_device) C++17
51 / 100
 36 ms 3292 KB 
// In the name of Allah

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

typedef		long long int			ll;
typedef		long double				ld;
typedef		pair<int, int>			pii;
typedef		pair<ll, ll>			pll;
typedef		complex<ld>				cld;

#define		all(x)					(x).begin(),(x).end()
#define		len(x)					((ll) (x).size())
#define		F						first
#define		S						second
#define		pb						push_back
#define		sep						' '
#define		endl					'\n'
#define		Mp						make_pair
#define		kill(x)					cout << x << '\n', exit(0)
#define		set_dec(x)				cout << fixed << setprecision(x);
#define		file_io(x,y)			freopen(x, "r", stdin); freopen(y, "w", stdout);

static int n, k; ll x;
static const int maxn = 150 + 4;
static const int maxlg = 60;
static int A[maxn], M[maxn];

void Anna(int nx, ll valx, int kx, int p[]) {
	n = nx; k = kx; x = valx;
	
	iota(A, A + n, 0); fill(M, M + n, 0);
	for (int i = 0; i < k; i++) M[p[i]] = 1;
	shuffle(A, A + n, default_random_engine(23232323));
	
	int j = 0;
	for (int i = 1; i < n; i += 2) {
		int j1 = A[i - 1], j2 = A[i];
		if (j >= maxlg) {
			Set(j1, 0); Set(j2, 0);
		}
		else {
			if (x & (1ll << j)) {
				if (M[j1]) {
					Set(j1, 0); Set(j2, 0);
				}
				else {
					Set(j1, 1); Set(j2, 0);
					j++;
				}
			}
			else {
				if (M[j2]) {
					Set(j1, 0); Set(j2, 0);
				}
				else {
					Set(j1, 0); Set(j2, 1);
					j++;
				}
			}
		}
	}
	if (n % 2 == 1) Set(A[n - 1], 0);
}
// In the name of Allah

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

typedef		long long int			ll;
typedef		long double				ld;
typedef		pair<int, int>			pii;
typedef		pair<ll, ll>			pll;
typedef		complex<ld>				cld;

#define		all(x)					(x).begin(),(x).end()
#define		len(x)					((ll) (x).size())
#define		F						first
#define		S						second
#define		pb						push_back
#define		sep						' '
#define		endl					'\n'
#define		Mp						make_pair
#define		kill(x)					cout << x << '\n', exit(0)
#define		set_dec(x)				cout << fixed << setprecision(x);
#define		file_io(x,y)			freopen(x, "r", stdin); freopen(y, "w", stdout);

static int n;
static const int maxn = 150 + 4;
static const int maxlg = 60;
static int A[maxn], val[maxn];

ll Bruno(int nx, int a[]) {
	n = nx; iota(A, A + n, 0);
	for (int i = 0; i < n; i++) val[i] = a[i];
	shuffle(A, A + n, default_random_engine(23232323));
	
	int j = 0; ll res = 0;
	for (int i = 1; i < n; i += 2) {
		int j1 = A[i - 1], j2 = A[i];
		if (val[j1] != 0) {
			res ^= (1ll << j);
			j++;
		}
		else if (val[j2] != 0) {
			j++;
		}
	}
	
	return res;
}

Subtask #1
51.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 27 ms 3292 KB Output is partially correct - L* = 25
2 Partially correct 27 ms 2872 KB Output is partially correct - L* = 28
3 Partially correct 27 ms 2772 KB Output is partially correct - L* = 27
4 Partially correct 27 ms 2780 KB Output is partially correct - L* = 22
5 Partially correct 27 ms 2776 KB Output is partially correct - L* = 26
6 Partially correct 27 ms 2760 KB Output is partially correct - L* = 23
7 Partially correct 27 ms 2836 KB Output is partially correct - L* = 20
8 Partially correct 27 ms 2776 KB Output is partially correct - L* = 24
9 Partially correct 27 ms 2772 KB Output is partially correct - L* = 23
10 Partially correct 27 ms 2772 KB Output is partially correct - L* = 24
11 Partially correct 30 ms 2776 KB Output is partially correct - L* = 23
12 Partially correct 30 ms 3104 KB Output is partially correct - L* = 25
13 Partially correct 32 ms 2756 KB Output is partially correct - L* = 26
14 Partially correct 28 ms 2772 KB Output is partially correct - L* = 22
15 Partially correct 28 ms 2844 KB Output is partially correct - L* = 23
16 Partially correct 32 ms 2904 KB Output is partially correct - L* = 26
17 Partially correct 28 ms 2868 KB Output is partially correct - L* = 23
18 Partially correct 36 ms 2688 KB Output is partially correct - L* = 27
19 Partially correct 27 ms 2776 KB Output is partially correct - L* = 23
20 Partially correct 27 ms 2768 KB Output is partially correct - L* = 24
21 Partially correct 34 ms 2752 KB Output is partially correct - L* = 24
22 Partially correct 27 ms 2752 KB Output is partially correct - L* = 25
23 Partially correct 27 ms 2680 KB Output is partially correct - L* = 26
24 Partially correct 27 ms 2860 KB Output is partially correct - L* = 24
25 Partially correct 27 ms 2684 KB Output is partially correct - L* = 23
26 Partially correct 33 ms 2816 KB Output is partially correct - L* = 22
27 Partially correct 28 ms 2776 KB Output is partially correct - L* = 24
28 Partially correct 27 ms 2780 KB Output is partially correct - L* = 24
29 Partially correct 28 ms 2732 KB Output is partially correct - L* = 26
30 Partially correct 27 ms 2692 KB Output is partially correct - L* = 22
31 Partially correct 27 ms 2776 KB Output is partially correct - L* = 27
32 Partially correct 27 ms 2848 KB Output is partially correct - L* = 24
33 Partially correct 27 ms 2772 KB Output is partially correct - L* = 21
34 Partially correct 28 ms 2760 KB Output is partially correct - L* = 22
35 Partially correct 27 ms 2776 KB Output is partially correct - L* = 23
36 Partially correct 27 ms 2720 KB Output is partially correct - L* = 21
37 Partially correct 27 ms 2804 KB Output is partially correct - L* = 24
38 Partially correct 27 ms 2772 KB Output is partially correct - L* = 23
39 Partially correct 27 ms 2772 KB Output is partially correct - L* = 24
40 Partially correct 28 ms 2892 KB Output is partially correct - L* = 23