oj.uz

답안 #982872

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
982872 2024-05-14T21:55:02 Z AmirAli_H1 Broken Device (JOI17_broken_device) C++17
49 / 100
 59 ms 2968 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 const int mod = 1e9 + 7;
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;
	
	ll sd = 23232323;
	for (int T = 0; T < 10; T++) {
		shuffle(A, A + n, default_random_engine(sd));
		sd = (sd * 23) % mod;
	}
	
	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 const int mod = 1e9 + 7;
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];
	
	ll sd = 23232323;
	for (int T = 0; T < 10; T++) {
		shuffle(A, A + n, default_random_engine(sd));
		sd = (sd * 23) % mod;
	}
	
	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 51 ms 2528 KB Output is partially correct - L* = 23
2 Partially correct 56 ms 2604 KB Output is partially correct - L* = 21
3 Partially correct 51 ms 2396 KB Output is partially correct - L* = 21
4 Partially correct 53 ms 2400 KB Output is partially correct - L* = 25
5 Partially correct 52 ms 2652 KB Output is partially correct - L* = 22
6 Partially correct 51 ms 2556 KB Output is partially correct - L* = 23
7 Partially correct 52 ms 2384 KB Output is partially correct - L* = 21
8 Partially correct 56 ms 2400 KB Output is partially correct - L* = 25
9 Partially correct 51 ms 2372 KB Output is partially correct - L* = 23
10 Partially correct 57 ms 2296 KB Output is partially correct - L* = 27
11 Partially correct 59 ms 2432 KB Output is partially correct - L* = 23
12 Partially correct 51 ms 2372 KB Output is partially correct - L* = 22
13 Partially correct 52 ms 2500 KB Output is partially correct - L* = 21
14 Partially correct 55 ms 2548 KB Output is partially correct - L* = 25
15 Partially correct 52 ms 2396 KB Output is partially correct - L* = 22
16 Partially correct 52 ms 2300 KB Output is partially correct - L* = 21
17 Partially correct 51 ms 2968 KB Output is partially correct - L* = 22
18 Partially correct 52 ms 2364 KB Output is partially correct - L* = 25
19 Partially correct 52 ms 2384 KB Output is partially correct - L* = 22
20 Partially correct 51 ms 2484 KB Output is partially correct - L* = 24
21 Partially correct 51 ms 2488 KB Output is partially correct - L* = 24
22 Partially correct 52 ms 2420 KB Output is partially correct - L* = 22
23 Partially correct 51 ms 2476 KB Output is partially correct - L* = 25
24 Partially correct 51 ms 2528 KB Output is partially correct - L* = 25
25 Partially correct 51 ms 2432 KB Output is partially correct - L* = 22
26 Partially correct 51 ms 2404 KB Output is partially correct - L* = 24
27 Partially correct 52 ms 2312 KB Output is partially correct - L* = 26
28 Partially correct 51 ms 2400 KB Output is partially correct - L* = 22
29 Partially correct 52 ms 2308 KB Output is partially correct - L* = 23
30 Partially correct 52 ms 2392 KB Output is partially correct - L* = 24
31 Partially correct 54 ms 2424 KB Output is partially correct - L* = 23
32 Partially correct 51 ms 2396 KB Output is partially correct - L* = 24
33 Partially correct 51 ms 2484 KB Output is partially correct - L* = 23
34 Partially correct 51 ms 2368 KB Output is partially correct - L* = 24
35 Partially correct 54 ms 2656 KB Output is partially correct - L* = 24
36 Partially correct 56 ms 2472 KB Output is partially correct - L* = 27
37 Partially correct 51 ms 2416 KB Output is partially correct - L* = 19
38 Partially correct 51 ms 2464 KB Output is partially correct - L* = 27
39 Partially correct 51 ms 2492 KB Output is partially correct - L* = 24
40 Partially correct 51 ms 2404 KB Output is partially correct - L* = 25