oj.uz

Submission #313029

# Submission time Handle Problem Language Result Execution time Memory
313029 2020-10-15T01:53:33 Z YJU Broken Device (JOI17_broken_device) C++14
0 / 100
 2 ms 1164 KB 
#include<bits/stdc++.h>
#include"Annalib.h"
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=4e5+5;
const ll K=350;
const ld pi=3.14159265359;
const ll INF=(1LL<<40);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()



void Anna(int n,ll x,int k,int *p){
	bool vis[200];
	memset(vis,0,sizeof(vis));
	ll ti=0;
	REP(i,k)vis[p[i]]=1;
	for(int i=0;i<n;i++){
		if(vis[i]||vis[i+1]||vis[i+2]||i+2>=n||ti>=60)continue;
		Set(i,1);
		if((x&(1LL<<ti)))Set(i+1,1);
		else Set(i+1,0);
		ti++;
		if((x&(1LL<<ti)))Set(i+2,1);
		else Set(i+2,0);
		ti++;
		i=i+2;
	}
}


#include<bits/stdc++.h>
#include"Brunolib.h"
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=4e5+5;
const ll K=350;
const ld pi=3.14159265359;
const ll INF=(1LL<<40);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()



ll Bruno(int n,int *A){
	ll ti=0,ans=0;
	REP(i,n){
		if(A[i]==1){
			ans|=(A[i+1]*(1LL<<ti));ti++;
			ans|=(A[i+2]*(1LL<<ti));ti++;
			i+=2;
		}
	}
	return ans;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1036 KB Wrong Answer [4]
2 Incorrect 2 ms 1164 KB Wrong Answer [4]
3 Incorrect 1 ms 1028 KB Wrong Answer [4]
4 Incorrect 0 ms 916 KB Wrong Answer [4]
5 Incorrect 1 ms 1036 KB Wrong Answer [4]
6 Incorrect 1 ms 788 KB Wrong Answer [4]
7 Incorrect 2 ms 1036 KB Wrong Answer [4]
8 Incorrect 1 ms 1164 KB Wrong Answer [4]
9 Incorrect 1 ms 1036 KB Wrong Answer [4]
10 Incorrect 0 ms 1036 KB Wrong Answer [4]
11 Incorrect 1 ms 1036 KB Wrong Answer [4]
12 Incorrect 1 ms 780 KB Wrong Answer [4]
13 Incorrect 1 ms 916 KB Wrong Answer [4]
14 Incorrect 1 ms 1160 KB Wrong Answer [4]
15 Incorrect 1 ms 916 KB Wrong Answer [4]
16 Incorrect 1 ms 1036 KB Wrong Answer [4]
17 Incorrect 1 ms 912 KB Wrong Answer [4]
18 Incorrect 1 ms 788 KB Wrong Answer [4]
19 Incorrect 1 ms 916 KB Wrong Answer [4]
20 Incorrect 1 ms 1036 KB Wrong Answer [4]
21 Incorrect 2 ms 1032 KB Wrong Answer [4]
22 Incorrect 1 ms 904 KB Wrong Answer [4]
23 Incorrect 1 ms 1028 KB Wrong Answer [4]
24 Incorrect 2 ms 1032 KB Wrong Answer [4]
25 Incorrect 2 ms 1036 KB Wrong Answer [4]
26 Incorrect 1 ms 1164 KB Wrong Answer [4]
27 Incorrect 1 ms 788 KB Wrong Answer [4]
28 Incorrect 1 ms 1040 KB Wrong Answer [4]
29 Incorrect 1 ms 1036 KB Wrong Answer [4]
30 Incorrect 0 ms 916 KB Wrong Answer [4]
31 Incorrect 1 ms 788 KB Wrong Answer [4]
32 Incorrect 0 ms 916 KB Wrong Answer [4]
33 Incorrect 0 ms 788 KB Wrong Answer [4]
34 Incorrect 1 ms 1044 KB Wrong Answer [4]
35 Incorrect 0 ms 916 KB Wrong Answer [4]
36 Incorrect 1 ms 1040 KB Wrong Answer [4]
37 Incorrect 0 ms 788 KB Wrong Answer [4]
38 Incorrect 1 ms 1040 KB Wrong Answer [4]
39 Incorrect 0 ms 916 KB Wrong Answer [4]
40 Incorrect 1 ms 916 KB Wrong Answer [4]