oj.uz

답안 #411951

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
411951 2021-05-26T10:35:26 Z alishahali1382 Broken Device (JOI17_broken_device) C++14
0 / 100
 50 ms 2736 KB 
#include "Annalib.h"
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int MAXN=210, LOG=60;

int bad[MAXN];

void Anna(int n, ll x, int k, int P[]){
	for (int i=0; i<n; i++) bad[i]=0;
	for (int i=0; i<k; i++) bad[P[i]]=1;
	string S;
	for (int i=0; i<n; i+=3){
		if (bad[i]+bad[i+1]+bad[i+2]==0){
			int a=(x&1); x>>=1;
			int b=(x&1); x>>=1;
			if (!a && !b) S+="011";
			if (a && !b) S+="101";
			if (!a && b) S+="110";
			if (a && b) S+="111";
			// Set(i, 1^a^b);
			// Set(i+1, a);
			// Set(i+2, b);
		}
		else if (bad[i]+bad[i+1]+bad[i+2]==1){
			if (bad[i]) S+="000";
			else{
				int a=(x&1); x>>=1;
				if (!a) S+="001";
				else S+="010";
			}
		}
		else{
			S+="000";
		}
	}
	for (int i=0; i<n; i++) Set(i, S[i]-'0');
	// debug(S)

	return ;
}

#include "Brunolib.h"
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int MAXN=210, LOG=60;

ll Bruno(int n, int A[]){
	vector<int> vec;
	int pos=0;
	for (int i=0; i<n; i+=3){
		string S="";
		S+=char('0'+A[i]);
		S+=char('0'+A[i+1]);
		S+=char('0'+A[i+2]);
		if (S=="000") continue ;
		if (S=="001") vec.pb(0);
		if (S=="010") vec.pb(1);
		if (S=="011") vec.pb(0), vec.pb(0);
		if (S=="101") vec.pb(1), vec.pb(0);
		if (S=="110") vec.pb(0), vec.pb(1);
		if (S=="111") vec.pb(1), vec.pb(1);
	}
	reverse(all(vec));
	ll res=0;
	for (int x:vec) res=res*2ll+x;
	// debug(res)
	return res;
}

Compilation message

Bruno.cpp: In function 'll Bruno(int, int*)':
Bruno.cpp:27:6: warning: unused variable 'pos' [-Wunused-variable]
   27 |  int pos=0;
      |      ^~~

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 43 ms 2520 KB Output isn't correct - L* = 0
2 Partially correct 44 ms 2716 KB Output isn't correct - L* = 0
3 Partially correct 44 ms 2504 KB Output isn't correct - L* = 0
4 Partially correct 43 ms 2568 KB Output isn't correct - L* = 0
5 Partially correct 43 ms 2500 KB Output isn't correct - L* = 0
6 Partially correct 43 ms 2496 KB Output isn't correct - L* = 0
7 Partially correct 44 ms 2644 KB Output isn't correct - L* = 0
8 Partially correct 43 ms 2552 KB Output isn't correct - L* = 0
9 Partially correct 41 ms 2516 KB Output isn't correct - L* = 0
10 Partially correct 43 ms 2604 KB Output isn't correct - L* = 0
11 Partially correct 43 ms 2516 KB Output isn't correct - L* = 0
12 Partially correct 47 ms 2532 KB Output isn't correct - L* = 0
13 Partially correct 41 ms 2532 KB Output isn't correct - L* = 0
14 Partially correct 43 ms 2420 KB Output isn't correct - L* = 0
15 Partially correct 41 ms 2504 KB Output isn't correct - L* = 0
16 Partially correct 43 ms 2448 KB Output isn't correct - L* = 0
17 Partially correct 43 ms 2500 KB Output isn't correct - L* = 0
18 Partially correct 43 ms 2456 KB Output isn't correct - L* = 0
19 Partially correct 43 ms 2544 KB Output isn't correct - L* = 0
20 Partially correct 43 ms 2648 KB Output isn't correct - L* = 0
21 Partially correct 47 ms 2676 KB Output isn't correct - L* = 0
22 Partially correct 41 ms 2520 KB Output isn't correct - L* = 0
23 Partially correct 44 ms 2508 KB Output isn't correct - L* = 0
24 Partially correct 43 ms 2456 KB Output isn't correct - L* = 0
25 Partially correct 41 ms 2564 KB Output isn't correct - L* = 0
26 Partially correct 43 ms 2568 KB Output isn't correct - L* = 0
27 Partially correct 43 ms 2564 KB Output isn't correct - L* = 0
28 Partially correct 44 ms 2736 KB Output isn't correct - L* = 0
29 Partially correct 43 ms 2424 KB Output isn't correct - L* = 0
30 Partially correct 43 ms 2448 KB Output isn't correct - L* = 0
31 Partially correct 44 ms 2524 KB Output isn't correct - L* = 0
32 Partially correct 43 ms 2488 KB Output isn't correct - L* = 0
33 Partially correct 50 ms 2560 KB Output isn't correct - L* = 0
34 Partially correct 45 ms 2644 KB Output isn't correct - L* = 0
35 Partially correct 43 ms 2512 KB Output isn't correct - L* = 0
36 Partially correct 44 ms 2544 KB Output isn't correct - L* = 0
37 Partially correct 41 ms 2488 KB Output isn't correct - L* = 0
38 Partially correct 43 ms 2428 KB Output isn't correct - L* = 0
39 Partially correct 43 ms 2520 KB Output isn't correct - L* = 0
40 Partially correct 43 ms 2548 KB Output isn't correct - L* = 0