oj.uz

답안 #61062

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
61062 2018-07-25T07:26:39 Z 윤교준(#1762) Broken Device (JOI17_broken_device) C++11
0 / 100
 69 ms 3968 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%40))));
}

#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 < 3; i++) {
		ll t = 0;
		for(int j = 0; j < 40; j++)
			if(A[i*40 + j])
				t |= 1ll << j;
		upmax(ret, t);
	}
	return ret;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 68 ms 3056 KB Output isn't correct - L* = 0
2 Incorrect 44 ms 3376 KB Output isn't correct - L* = 0
3 Incorrect 52 ms 3616 KB Output isn't correct - L* = 0
4 Incorrect 46 ms 3616 KB Output isn't correct - L* = 0
5 Incorrect 60 ms 3776 KB Output isn't correct - L* = 0
6 Incorrect 62 ms 3776 KB Output isn't correct - L* = 0
7 Incorrect 47 ms 3776 KB Output isn't correct - L* = 0
8 Incorrect 67 ms 3776 KB Output isn't correct - L* = 0
9 Incorrect 51 ms 3776 KB Output isn't correct - L* = 0
10 Incorrect 62 ms 3824 KB Output isn't correct - L* = 0
11 Incorrect 63 ms 3824 KB Output isn't correct - L* = 0
12 Incorrect 49 ms 3824 KB Output isn't correct - L* = 0
13 Incorrect 49 ms 3824 KB Output isn't correct - L* = 0
14 Incorrect 49 ms 3832 KB Output isn't correct - L* = 0
15 Incorrect 46 ms 3832 KB Output isn't correct - L* = 0
16 Incorrect 62 ms 3968 KB Output isn't correct - L* = 0
17 Incorrect 48 ms 3968 KB Output isn't correct - L* = 0
18 Incorrect 49 ms 3968 KB Output isn't correct - L* = 0
19 Incorrect 55 ms 3968 KB Output isn't correct - L* = 0
20 Incorrect 46 ms 3968 KB Output isn't correct - L* = 0
21 Incorrect 48 ms 3968 KB Output isn't correct - L* = 0
22 Incorrect 46 ms 3968 KB Output isn't correct - L* = 0
23 Incorrect 56 ms 3968 KB Output isn't correct - L* = 0
24 Incorrect 65 ms 3968 KB Output isn't correct - L* = 0
25 Incorrect 53 ms 3968 KB Output isn't correct - L* = 0
26 Incorrect 48 ms 3968 KB Output isn't correct - L* = 0
27 Incorrect 53 ms 3968 KB Output isn't correct - L* = 0
28 Incorrect 50 ms 3968 KB Output isn't correct - L* = 0
29 Incorrect 50 ms 3968 KB Output isn't correct - L* = 0
30 Incorrect 57 ms 3968 KB Output isn't correct - L* = 0
31 Incorrect 56 ms 3968 KB Output isn't correct - L* = 0
32 Incorrect 44 ms 3968 KB Output isn't correct - L* = 0
33 Incorrect 57 ms 3968 KB Output isn't correct - L* = 0
34 Incorrect 50 ms 3968 KB Output isn't correct - L* = 0
35 Incorrect 62 ms 3968 KB Output isn't correct - L* = 0
36 Incorrect 66 ms 3968 KB Output isn't correct - L* = 0
37 Incorrect 66 ms 3968 KB Output isn't correct - L* = 0
38 Incorrect 69 ms 3968 KB Output isn't correct - L* = 0
39 Incorrect 64 ms 3968 KB Output isn't correct - L* = 0
40 Incorrect 51 ms 3968 KB Output isn't correct - L* = 0