oj.uz

답안 #313037

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
313037 2020-10-15T02:49:01 Z YJU Broken Device (JOI17_broken_device) C++14
0 / 100
 46 ms 3584 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];
	REP(i,200)vis[i]=1;
	ll ti=0;
	REP(i,k)vis[p[i]]=0;
	for(int i=0;i<n;i++){
		if(vis[i]||i+2>=n||ti>=60||vis[i+1]<(bool)(x&(1LL<<(ti+1)))||vis[i+2]<(bool)(x&(1LL<<(ti+2)))){
			Set(i,0);continue;
		}
		Set(i,1);
		Set(i+1,(bool)(x&(1LL<<(ti+1))));
		Set(i+2,(bool)(x&(1LL<<(ti+2))));
		ti+=2;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;
	for(int i=0;i<n;i++){
		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

# 결과 실행 시간 메모리 Grader output
1 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
2 Partially correct 45 ms 3312 KB Output isn't correct - L* = 0
3 Partially correct 45 ms 3312 KB Output isn't correct - L* = 0
4 Partially correct 44 ms 3136 KB Output isn't correct - L* = 0
5 Partially correct 44 ms 3312 KB Output isn't correct - L* = 0
6 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
7 Partially correct 46 ms 3328 KB Output isn't correct - L* = 0
8 Partially correct 45 ms 3328 KB Output isn't correct - L* = 0
9 Partially correct 44 ms 3320 KB Output isn't correct - L* = 0
10 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
11 Partially correct 45 ms 3328 KB Output isn't correct - L* = 0
12 Partially correct 46 ms 3312 KB Output isn't correct - L* = 0
13 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
14 Partially correct 44 ms 3312 KB Output isn't correct - L* = 0
15 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
16 Partially correct 44 ms 3320 KB Output isn't correct - L* = 0
17 Partially correct 45 ms 3320 KB Output isn't correct - L* = 0
18 Partially correct 46 ms 3568 KB Output isn't correct - L* = 0
19 Partially correct 46 ms 3312 KB Output isn't correct - L* = 0
20 Partially correct 46 ms 3328 KB Output isn't correct - L* = 0
21 Partially correct 44 ms 3312 KB Output isn't correct - L* = 0
22 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
23 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
24 Partially correct 45 ms 3584 KB Output isn't correct - L* = 0
25 Partially correct 45 ms 3312 KB Output isn't correct - L* = 0
26 Partially correct 44 ms 3312 KB Output isn't correct - L* = 0
27 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
28 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
29 Partially correct 45 ms 3328 KB Output isn't correct - L* = 0
30 Partially correct 46 ms 3584 KB Output isn't correct - L* = 0
31 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
32 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
33 Partially correct 46 ms 3136 KB Output isn't correct - L* = 0
34 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
35 Partially correct 44 ms 3312 KB Output isn't correct - L* = 0
36 Partially correct 44 ms 3312 KB Output isn't correct - L* = 0
37 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
38 Partially correct 44 ms 3312 KB Output isn't correct - L* = 0
39 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
40 Partially correct 45 ms 3312 KB Output isn't correct - L* = 0