oj.uz

답안 #100873

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
100873 2019-03-15T01:16:18 Z Pro_ktmr Broken Device (JOI17_broken_device) C++14
0 / 100
 68 ms 3072 KB 
#include"bits/stdc++.h"
using namespace std;
#define LL long long
#define MP make_pair
#include"Annalib.h"

//void Set(int pos, int bit)
//N=150
void Anna(int N, long long X, int K, int P[]){
	bool canUse[150];
	for(int i=0; i<N; i++) canUse[i] = true;
	for(int i=0; i<K; i++) canUse[P[i]] = false;
	LL now = 0;
	for(int i=0; i<N; i++){
		if(i+1 < N && canUse[i] && canUse[i+1]){
			Set(i, 1);
			Set(i+1, (X>>now)%2);
			i++;
			now++;
		}
		else if(i+1 < N && canUse[i] && (X>>now)%2 == 0){
			Set(i, 1);
			Set(i+1, 0);
			i++;
			now++;
		}
		else{
			Set(i, 0);
		}
	}
}

#include"bits/stdc++.h"
using namespace std;
#define LL long long
#define MP make_pair
#include"Brunolib.h"

long long Bruno(int N, int A[]){
	LL ans = 0;
	LL now = 0;
	for(int i=0; i+1<N; i++){
		if(A[i] == 1){
			ans += (A[i+1]<<now);
			i++;
			now++;
		}
	}
	return ans;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 49 ms 3072 KB Output isn't correct - L* = 0
2 Incorrect 46 ms 3056 KB Output isn't correct - L* = 0
3 Incorrect 49 ms 3056 KB Output isn't correct - L* = 0
4 Incorrect 40 ms 3072 KB Output isn't correct - L* = 0
5 Incorrect 49 ms 2952 KB Output isn't correct - L* = 0
6 Incorrect 41 ms 3072 KB Output isn't correct - L* = 0
7 Incorrect 39 ms 2880 KB Output isn't correct - L* = 0
8 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
9 Incorrect 38 ms 3072 KB Output isn't correct - L* = 0
10 Incorrect 37 ms 3072 KB Output isn't correct - L* = 0
11 Incorrect 61 ms 3056 KB Output isn't correct - L* = 0
12 Incorrect 68 ms 3056 KB Output isn't correct - L* = 0
13 Incorrect 47 ms 3072 KB Output isn't correct - L* = 0
14 Incorrect 40 ms 3072 KB Output isn't correct - L* = 0
15 Incorrect 34 ms 3072 KB Output isn't correct - L* = 0
16 Incorrect 51 ms 3072 KB Output isn't correct - L* = 0
17 Incorrect 35 ms 3072 KB Output isn't correct - L* = 0
18 Incorrect 37 ms 3000 KB Output isn't correct - L* = 0
19 Incorrect 43 ms 3048 KB Output isn't correct - L* = 0
20 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
21 Incorrect 44 ms 2896 KB Output isn't correct - L* = 0
22 Incorrect 39 ms 3072 KB Output isn't correct - L* = 0
23 Incorrect 34 ms 3064 KB Output isn't correct - L* = 0
24 Incorrect 36 ms 3072 KB Output isn't correct - L* = 0
25 Incorrect 37 ms 3056 KB Output isn't correct - L* = 0
26 Incorrect 35 ms 3072 KB Output isn't correct - L* = 0
27 Incorrect 40 ms 3056 KB Output isn't correct - L* = 0
28 Incorrect 33 ms 3072 KB Output isn't correct - L* = 0
29 Incorrect 39 ms 3072 KB Output isn't correct - L* = 0
30 Incorrect 36 ms 3072 KB Output isn't correct - L* = 0
31 Incorrect 38 ms 3072 KB Output isn't correct - L* = 0
32 Incorrect 38 ms 3072 KB Output isn't correct - L* = 0
33 Incorrect 36 ms 3072 KB Output isn't correct - L* = 0
34 Incorrect 38 ms 3072 KB Output isn't correct - L* = 0
35 Incorrect 36 ms 3072 KB Output isn't correct - L* = 0
36 Incorrect 52 ms 3056 KB Output isn't correct - L* = 0
37 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
38 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
39 Incorrect 34 ms 3072 KB Output isn't correct - L* = 0
40 Incorrect 39 ms 3072 KB Output isn't correct - L* = 0