답안 #126558

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
126558 2019-07-08T05:41:12 Z baluteshih Broken Device (JOI17_broken_device) C++14
41 / 100
56 ms 3312 KB
#include "Annalib.h"
#include <bits/stdc++.h>
#define jizz ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define pb push_back
#define MP make_pair
#define F first
#define S second
#define MEM(i,j) memset(i,j,sizeof i)
#define ALL(v) v.begin(),v.end()
#define ET cout << "\n"
#define DB(a,s,e) {for(int i=s;i<e;++i) cout << a[i] << " ";ET;}
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

void Anna( int N, long long X, int K, int P[] )
{
	const ll XOR=35464864864684;
	X^=XOR;
	bitset<150> bye,use;
	for(int i=0;i<K;++i)
		bye[P[i]]=1;
	for(ll i=0,nw=1;i<N&&nw<=X;++i)
		if(nw&X)
		{
			if(i+1<N&&!bye[i]&&!bye[i+1])
				use[i]=use[i+1]=1,++i,nw<<=1;
		}
		else
			if(!bye[i])
				use[i]=1,++i,nw<<=1;
	for(int i=0;i<N;++i)
		Set(i,use[i]);
}
#include "Brunolib.h"
#include <bits/stdc++.h>
#define jizz ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define pb push_back
#define MP make_pair
#define F first
#define S second
#define MEM(i,j) memset(i,j,sizeof i)
#define ALL(v) v.begin(),v.end()
#define ET cout << "\n"
#define DB(a,s,e) {for(int i=s;i<e;++i) cout << a[i] << " ";ET;}
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;


long long Bruno(int N,int A[])
{
	const ll XOR=35464864864684;
	ll ans=0;
	for(ll i=0,nw=1;i<N;++i)
		if(A[i])
		{
			if(A[i+1]) ans|=nw;
			nw<<=1,++i;
		}
	return ans^XOR;
}
# 결과 실행 시간 메모리 Grader output
1 Partially correct 40 ms 3000 KB Output is partially correct - L* = 17
2 Partially correct 40 ms 3064 KB Output is partially correct - L* = 16
3 Partially correct 40 ms 2888 KB Output is partially correct - L* = 18
4 Partially correct 44 ms 3056 KB Output is partially correct - L* = 17
5 Partially correct 43 ms 3056 KB Output is partially correct - L* = 17
6 Partially correct 40 ms 3056 KB Output is partially correct - L* = 22
7 Partially correct 40 ms 3056 KB Output is partially correct - L* = 18
8 Partially correct 41 ms 3056 KB Output is partially correct - L* = 18
9 Partially correct 40 ms 3056 KB Output is partially correct - L* = 18
10 Partially correct 43 ms 3000 KB Output is partially correct - L* = 16
11 Partially correct 41 ms 3064 KB Output is partially correct - L* = 17
12 Partially correct 40 ms 3056 KB Output is partially correct - L* = 22
13 Partially correct 40 ms 3056 KB Output is partially correct - L* = 18
14 Partially correct 40 ms 3056 KB Output is partially correct - L* = 18
15 Partially correct 44 ms 3056 KB Output is partially correct - L* = 16
16 Partially correct 40 ms 3056 KB Output is partially correct - L* = 18
17 Partially correct 43 ms 3056 KB Output is partially correct - L* = 17
18 Partially correct 43 ms 3056 KB Output is partially correct - L* = 16
19 Partially correct 41 ms 2896 KB Output is partially correct - L* = 18
20 Partially correct 40 ms 3312 KB Output is partially correct - L* = 18
21 Partially correct 41 ms 3144 KB Output is partially correct - L* = 17
22 Partially correct 40 ms 3056 KB Output is partially correct - L* = 16
23 Partially correct 40 ms 3056 KB Output is partially correct - L* = 15
24 Partially correct 41 ms 3072 KB Output is partially correct - L* = 17
25 Partially correct 40 ms 3056 KB Output is partially correct - L* = 21
26 Partially correct 40 ms 3056 KB Output is partially correct - L* = 16
27 Partially correct 40 ms 3056 KB Output is partially correct - L* = 18
28 Partially correct 40 ms 3056 KB Output is partially correct - L* = 20
29 Partially correct 41 ms 3056 KB Output is partially correct - L* = 16
30 Partially correct 40 ms 3056 KB Output is partially correct - L* = 20
31 Partially correct 41 ms 3056 KB Output is partially correct - L* = 17
32 Partially correct 40 ms 2832 KB Output is partially correct - L* = 18
33 Partially correct 56 ms 3056 KB Output is partially correct - L* = 18
34 Partially correct 40 ms 3056 KB Output is partially correct - L* = 18
35 Partially correct 40 ms 3056 KB Output is partially correct - L* = 16
36 Partially correct 41 ms 3312 KB Output is partially correct - L* = 20
37 Partially correct 40 ms 3056 KB Output is partially correct - L* = 16
38 Partially correct 40 ms 3056 KB Output is partially correct - L* = 18
39 Partially correct 40 ms 3056 KB Output is partially correct - L* = 17
40 Partially correct 40 ms 3152 KB Output is partially correct - L* = 17