oj.uz

Submission #61067

# Submission time Handle Problem Language Result Execution time Memory
61067 2018-07-25T07:30:56 Z 윤교준(#1762) Broken Device (JOI17_broken_device) C++11
8 / 100
 76 ms 3976 KB 
#include "Annalib.h"
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define allv(V) ((V).begin()),((V).end())
#define sorv(V) sort(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
#define revv(V) reverse(allv(V))
#define sz(V) ((int)(V).size())
#define upmin(a,b) (a)=min((a),(b))
#define upmax(a,b) (a)=max((a),(b))
#define rb(x) ((x)&(-(x)))
#define INF (0x3f3f3f3f)
#define INFLL (0x3f3f3f3f3f3f3f3fll)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

void Anna(int N, ll X, int K, int P[]) {
	for(int i = 0; i < N; i++)
		Set(i, !!(X & (1ll << (i%60))));
}

#include "Brunolib.h"
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define allv(V) ((V).begin()),((V).end())
#define sorv(V) sort(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
#define revv(V) reverse(allv(V))
#define sz(V) ((int)(V).size())
#define upmin(a,b) (a)=min((a),(b))
#define upmax(a,b) (a)=max((a),(b))
#define rb(x) ((x)&(-(x)))
#define INF (0x3f3f3f3f)
#define INFLL (0x3f3f3f3f3f3f3f3fll)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

ll Bruno(int N, int A[]) {
	ll ret = 0;
	for(int i = 0; i < 2; i++) {
		ll t = 0;
		for(int j = 0; j < 60; j++)
			if(A[i*60 + j])
				t |= 1ll << j;
		upmax(ret, t);
	}
	return ret;
}

Subtask #1
8.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 43 ms 2800 KB Output is partially correct - L* = 14
2 Partially correct 48 ms 3192 KB Output is partially correct - L* = 14
3 Partially correct 65 ms 3376 KB Output is partially correct - L* = 14
4 Partially correct 48 ms 3536 KB Output is partially correct - L* = 14
5 Partially correct 55 ms 3696 KB Output is partially correct - L* = 15
6 Partially correct 59 ms 3696 KB Output is partially correct - L* = 14
7 Partially correct 49 ms 3696 KB Output is partially correct - L* = 14
8 Partially correct 66 ms 3696 KB Output is partially correct - L* = 14
9 Partially correct 55 ms 3744 KB Output is partially correct - L* = 14
10 Partially correct 76 ms 3744 KB Output is partially correct - L* = 14
11 Partially correct 62 ms 3744 KB Output is partially correct - L* = 14
12 Partially correct 50 ms 3744 KB Output is partially correct - L* = 14
13 Partially correct 50 ms 3744 KB Output is partially correct - L* = 14
14 Partially correct 49 ms 3744 KB Output is partially correct - L* = 14
15 Partially correct 59 ms 3744 KB Output is partially correct - L* = 14
16 Partially correct 46 ms 3744 KB Output is partially correct - L* = 14
17 Partially correct 46 ms 3744 KB Output is partially correct - L* = 14
18 Partially correct 54 ms 3744 KB Output is partially correct - L* = 14
19 Partially correct 65 ms 3944 KB Output is partially correct - L* = 14
20 Partially correct 51 ms 3944 KB Output is partially correct - L* = 14
21 Partially correct 45 ms 3944 KB Output is partially correct - L* = 14
22 Partially correct 48 ms 3944 KB Output is partially correct - L* = 14
23 Partially correct 47 ms 3944 KB Output is partially correct - L* = 14
24 Partially correct 56 ms 3944 KB Output is partially correct - L* = 14
25 Partially correct 47 ms 3976 KB Output is partially correct - L* = 14
26 Partially correct 69 ms 3976 KB Output is partially correct - L* = 14
27 Partially correct 63 ms 3976 KB Output is partially correct - L* = 14
28 Partially correct 67 ms 3976 KB Output is partially correct - L* = 15
29 Partially correct 51 ms 3976 KB Output is partially correct - L* = 14
30 Partially correct 63 ms 3976 KB Output is partially correct - L* = 14
31 Partially correct 52 ms 3976 KB Output is partially correct - L* = 14
32 Partially correct 63 ms 3976 KB Output is partially correct - L* = 14
33 Partially correct 66 ms 3976 KB Output is partially correct - L* = 14
34 Partially correct 68 ms 3976 KB Output is partially correct - L* = 14
35 Partially correct 68 ms 3976 KB Output is partially correct - L* = 14
36 Partially correct 53 ms 3976 KB Output is partially correct - L* = 14
37 Partially correct 64 ms 3976 KB Output is partially correct - L* = 14
38 Partially correct 49 ms 3976 KB Output is partially correct - L* = 14
39 Partially correct 61 ms 3976 KB Output is partially correct - L* = 14
40 Partially correct 53 ms 3976 KB Output is partially correct - L* = 14