oj.uz

Submission #412017

# Submission time Handle Problem Language Result Execution time Memory
412017 2021-05-26T12:15:02 Z alishahali1382 Broken Device (JOI17_broken_device) C++14
0 / 100
 60 ms 2396 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];
int P[MAXN], Q[MAXN];

void Anna(int n, ll x, int k, int A[]){
	iota(P, P+n, 0);
	for (int i=1; i<n; i++) swap(P[i], P[(4*i)/5]);
	for (int i=0; i<n; i++) Q[P[i]]=i;

	for (int i=0; i<n; i++) bad[i]=0;
	for (int i=0; i<k; i++) bad[A[i]]=1;

	string S;
	for (int i=0; i<n; i+=2){
		if (bad[i]+bad[i+1]==0){
			ll y=x%3;
			x/=3;
			// debug(y)
			if (y==0) S+="01";
			if (y==1) S+="10";
			if (y==2) S+="11";
		}
		else{
			S+="00";
		}
	}
	for (int i=0; i<n; i++) Set(Q[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;

int PP[MAXN], QQ[MAXN];
int A[MAXN];

ll Bruno(int n, int B[]){
	iota(PP, PP+n, 0);
	for (int i=1; i<n; i++) swap(PP[i], PP[(4*i)/5]);
	for (int i=0; i<n; i++) QQ[PP[i]]=i;
	for (int i=0; i<n; i++) A[i]=B[PP[i]];
	vector<int> vec;
	int pos=0;
	for (int i=0; i<n; i+=2){
		string S="";
		S+=char('0'+A[i]);
		S+=char('0'+A[i+1]);
		if (S=="00") continue ;
		if (S=="01") vec.pb(0);
		if (S=="10") vec.pb(1);
		if (S=="11") vec.pb(2);
	}
	reverse(all(vec));
	ll res=0;
	for (int x:vec) res=res*3ll+x;
	// debug(res)
	// debugv(vec)
	
	return res;
}

Compilation message

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

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 44 ms 2268 KB Output isn't correct - L* = 0
2 Partially correct 43 ms 2248 KB Output isn't correct - L* = 0
3 Partially correct 44 ms 2372 KB Output isn't correct - L* = 0
4 Partially correct 44 ms 2256 KB Output isn't correct - L* = 0
5 Partially correct 49 ms 2260 KB Output isn't correct - L* = 0
6 Partially correct 55 ms 2252 KB Output isn't correct - L* = 0
7 Partially correct 44 ms 2252 KB Output isn't correct - L* = 0
8 Partially correct 47 ms 2180 KB Output isn't correct - L* = 0
9 Partially correct 60 ms 2280 KB Output isn't correct - L* = 0
10 Partially correct 50 ms 2240 KB Output isn't correct - L* = 0
11 Partially correct 56 ms 2356 KB Output isn't correct - L* = 0
12 Partially correct 54 ms 2196 KB Output isn't correct - L* = 0
13 Partially correct 55 ms 2280 KB Output isn't correct - L* = 0
14 Partially correct 49 ms 2296 KB Output isn't correct - L* = 0
15 Partially correct 58 ms 2320 KB Output isn't correct - L* = 0
16 Partially correct 52 ms 2336 KB Output isn't correct - L* = 0
17 Partially correct 47 ms 2144 KB Output isn't correct - L* = 0
18 Partially correct 46 ms 2360 KB Output isn't correct - L* = 0
19 Partially correct 49 ms 2336 KB Output isn't correct - L* = 0
20 Partially correct 50 ms 2328 KB Output isn't correct - L* = 0
21 Partially correct 53 ms 2312 KB Output isn't correct - L* = 0
22 Partially correct 53 ms 2336 KB Output isn't correct - L* = 0
23 Partially correct 55 ms 2144 KB Output isn't correct - L* = 0
24 Partially correct 46 ms 2288 KB Output isn't correct - L* = 0
25 Partially correct 50 ms 2228 KB Output isn't correct - L* = 0
26 Partially correct 51 ms 2300 KB Output isn't correct - L* = 0
27 Partially correct 53 ms 2336 KB Output isn't correct - L* = 0
28 Partially correct 55 ms 2240 KB Output isn't correct - L* = 0
29 Partially correct 48 ms 2360 KB Output isn't correct - L* = 0
30 Partially correct 47 ms 2316 KB Output isn't correct - L* = 0
31 Partially correct 55 ms 2376 KB Output isn't correct - L* = 0
32 Partially correct 52 ms 2396 KB Output isn't correct - L* = 0
33 Partially correct 54 ms 2348 KB Output isn't correct - L* = 0
34 Partially correct 51 ms 2368 KB Output isn't correct - L* = 0
35 Partially correct 44 ms 2256 KB Output isn't correct - L* = 0
36 Partially correct 47 ms 2308 KB Output isn't correct - L* = 0
37 Partially correct 56 ms 2292 KB Output isn't correct - L* = 0
38 Partially correct 51 ms 2316 KB Output isn't correct - L* = 0
39 Partially correct 46 ms 2220 KB Output isn't correct - L* = 0
40 Partially correct 46 ms 2344 KB Output isn't correct - L* = 0