oj.uz

답안 #313030

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
313030 2020-10-15T02:00:15 Z YJU Broken Device (JOI17_broken_device) C++14
51 / 100
 52 ms 3568 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){
			Set(i,0);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;
	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
51.0 / 100.0

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