oj.uz

Submission #126527

# Submission time Handle Problem Language Result Execution time Memory
126527 2019-07-08T03:17:09 Z baluteshih Broken Device (JOI17_broken_device) C++14
41 / 100
 44 ms 3376 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=165438486768787;
	X^=XOR;
	bitset<150> bye,use;
	for(int i=0;i<K;++i)
		bye[P[i]]=1;
	for(ll i=0,nw=1;i+1<N&&nw<=X;++i)
		if(!bye[i]&&!bye[i+1])
			if(nw&X)
				use[i]=use[i+1]=1,++i,nw<<=1;
			else
				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=165438486768787;
	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;
}

Compilation message

Anna.cpp: In function 'void Anna(int, long long int, int, int*)':
Anna.cpp:25:5: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
   if(!bye[i]&&!bye[i+1])
     ^

Subtask #1
41.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 40 ms 3312 KB Output is partially correct - L* = 15
2 Partially correct 40 ms 3232 KB Output is partially correct - L* = 15
3 Partially correct 40 ms 3056 KB Output is partially correct - L* = 17
4 Partially correct 40 ms 3160 KB Output is partially correct - L* = 16
5 Partially correct 40 ms 3280 KB Output is partially correct - L* = 15
6 Partially correct 40 ms 3312 KB Output is partially correct - L* = 15
7 Partially correct 40 ms 3056 KB Output is partially correct - L* = 18
8 Partially correct 40 ms 3256 KB Output is partially correct - L* = 18
9 Partially correct 40 ms 3360 KB Output is partially correct - L* = 16
10 Partially correct 40 ms 3376 KB Output is partially correct - L* = 16
11 Partially correct 40 ms 3312 KB Output is partially correct - L* = 17
12 Partially correct 40 ms 3312 KB Output is partially correct - L* = 17
13 Partially correct 40 ms 3312 KB Output is partially correct - L* = 15
14 Partially correct 40 ms 3296 KB Output is partially correct - L* = 15
15 Partially correct 40 ms 3232 KB Output is partially correct - L* = 16
16 Partially correct 44 ms 3376 KB Output is partially correct - L* = 15
17 Partially correct 40 ms 3056 KB Output is partially correct - L* = 17
18 Partially correct 40 ms 3056 KB Output is partially correct - L* = 16
19 Partially correct 40 ms 3152 KB Output is partially correct - L* = 18
20 Partially correct 41 ms 3312 KB Output is partially correct - L* = 15
21 Partially correct 40 ms 3312 KB Output is partially correct - L* = 15
22 Partially correct 40 ms 3056 KB Output is partially correct - L* = 15
23 Partially correct 40 ms 3312 KB Output is partially correct - L* = 15
24 Partially correct 40 ms 3272 KB Output is partially correct - L* = 17
25 Partially correct 40 ms 3256 KB Output is partially correct - L* = 15
26 Partially correct 41 ms 3312 KB Output is partially correct - L* = 16
27 Partially correct 40 ms 3312 KB Output is partially correct - L* = 15
28 Partially correct 40 ms 3256 KB Output is partially correct - L* = 16
29 Partially correct 40 ms 3184 KB Output is partially correct - L* = 15
30 Partially correct 40 ms 3312 KB Output is partially correct - L* = 16
31 Partially correct 40 ms 3056 KB Output is partially correct - L* = 15
32 Partially correct 40 ms 3320 KB Output is partially correct - L* = 16
33 Partially correct 40 ms 3064 KB Output is partially correct - L* = 15
34 Partially correct 40 ms 3376 KB Output is partially correct - L* = 16
35 Partially correct 40 ms 3192 KB Output is partially correct - L* = 15
36 Partially correct 40 ms 3128 KB Output is partially correct - L* = 15
37 Partially correct 40 ms 3312 KB Output is partially correct - L* = 16
38 Partially correct 40 ms 3312 KB Output is partially correct - L* = 17
39 Partially correct 40 ms 2944 KB Output is partially correct - L* = 15
40 Partially correct 40 ms 3000 KB Output is partially correct - L* = 15