oj.uz

답안 #982874

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
982874 2024-05-14T22:04:39 Z AmirAli_H1 Broken Device (JOI17_broken_device) C++17
49 / 100
 32 ms 2676 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(923232361));
	
	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(923232361));
	
	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
49.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 28 ms 2368 KB Output is partially correct - L* = 25
2 Partially correct 27 ms 2400 KB Output is partially correct - L* = 24
3 Partially correct 27 ms 2376 KB Output is partially correct - L* = 23
4 Partially correct 27 ms 2396 KB Output is partially correct - L* = 26
5 Partially correct 30 ms 2392 KB Output is partially correct - L* = 26
6 Partially correct 30 ms 2492 KB Output is partially correct - L* = 24
7 Partially correct 28 ms 2528 KB Output is partially correct - L* = 25
8 Partially correct 27 ms 2396 KB Output is partially correct - L* = 25
9 Partially correct 30 ms 2676 KB Output is partially correct - L* = 25
10 Partially correct 27 ms 2404 KB Output is partially correct - L* = 27
11 Partially correct 27 ms 2396 KB Output is partially correct - L* = 24
12 Partially correct 27 ms 2480 KB Output is partially correct - L* = 20
13 Partially correct 28 ms 2380 KB Output is partially correct - L* = 25
14 Partially correct 27 ms 2392 KB Output is partially correct - L* = 20
15 Partially correct 28 ms 2568 KB Output is partially correct - L* = 23
16 Partially correct 27 ms 2308 KB Output is partially correct - L* = 25
17 Partially correct 27 ms 2404 KB Output is partially correct - L* = 24
18 Partially correct 27 ms 2396 KB Output is partially correct - L* = 22
19 Partially correct 27 ms 2468 KB Output is partially correct - L* = 22
20 Partially correct 30 ms 2404 KB Output is partially correct - L* = 26
21 Partially correct 27 ms 2488 KB Output is partially correct - L* = 24
22 Partially correct 27 ms 2392 KB Output is partially correct - L* = 27
23 Partially correct 28 ms 2656 KB Output is partially correct - L* = 25
24 Partially correct 27 ms 2304 KB Output is partially correct - L* = 23
25 Partially correct 27 ms 2584 KB Output is partially correct - L* = 23
26 Partially correct 28 ms 2384 KB Output is partially correct - L* = 27
27 Partially correct 28 ms 2396 KB Output is partially correct - L* = 24
28 Partially correct 27 ms 2480 KB Output is partially correct - L* = 24
29 Partially correct 31 ms 2452 KB Output is partially correct - L* = 23
30 Partially correct 28 ms 2400 KB Output is partially correct - L* = 19
31 Partially correct 27 ms 2400 KB Output is partially correct - L* = 25
32 Partially correct 27 ms 2508 KB Output is partially correct - L* = 23
33 Partially correct 31 ms 2372 KB Output is partially correct - L* = 24
34 Partially correct 28 ms 2636 KB Output is partially correct - L* = 25
35 Partially correct 27 ms 2396 KB Output is partially correct - L* = 27
36 Partially correct 27 ms 2372 KB Output is partially correct - L* = 25
37 Partially correct 27 ms 2468 KB Output is partially correct - L* = 24
38 Partially correct 28 ms 2484 KB Output is partially correct - L* = 22
39 Partially correct 27 ms 2396 KB Output is partially correct - L* = 25
40 Partially correct 32 ms 2388 KB Output is partially correct - L* = 22