Submission #412051

# Submission time Handle Problem Language Result Execution time Memory
412051 2021-05-26T12:46:27 Z alishahali1382 Broken Device (JOI17_broken_device) C++14
0 / 100
2 ms 584 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], shit[MAXN];
int P[MAXN];

void Anna(int n, ll x, int k, int A[]){
	iota(P, P+n, 0);
	for (int i=1; i<4; i++) swap(P[i], P[4*i/5]);
	P[0]=3;
	P[1]=0;
	P[2]=1;
	P[3]=2;
	for (int i=0; i<n; i++) bad[i]=0;
	for (int i=0; i<k; i++) bad[P[A[i]]]=1, shit[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(i, S[P[i]]-'0'), assert(!shit[i] || S[P[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<4; i++) swap(PP[i], PP[(4*i)/5]);
	PP[0]=3;
	PP[1]=0;
	PP[2]=1;
	PP[3]=2;
	for (int i=0; i<n; i++) QQ[PP[i]]=i;
	string T="";
	for (int i=0; i<n; i++) A[i]=B[QQ[i]], T+=char('0'+A[i]);
	// debug(T)

	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;
	
	return res;
}

Compilation message

Bruno.cpp: In function 'll Bruno(int, int*)':
Bruno.cpp:41:6: warning: unused variable 'pos' [-Wunused-variable]
   41 |  int pos=0;
      |      ^~~
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 460 KB Execution killed with signal 6
2 Runtime error 2 ms 460 KB Execution killed with signal 6
3 Runtime error 1 ms 460 KB Execution killed with signal 6
4 Runtime error 1 ms 460 KB Execution killed with signal 6
5 Runtime error 1 ms 460 KB Execution killed with signal 6
6 Runtime error 2 ms 460 KB Execution killed with signal 6
7 Runtime error 1 ms 460 KB Execution killed with signal 6
8 Runtime error 1 ms 460 KB Execution killed with signal 6
9 Runtime error 1 ms 460 KB Execution killed with signal 6
10 Runtime error 1 ms 460 KB Execution killed with signal 6
11 Runtime error 1 ms 460 KB Execution killed with signal 6
12 Runtime error 1 ms 460 KB Execution killed with signal 6
13 Runtime error 1 ms 460 KB Execution killed with signal 6
14 Runtime error 1 ms 460 KB Execution killed with signal 6
15 Runtime error 2 ms 460 KB Execution killed with signal 6
16 Runtime error 1 ms 460 KB Execution killed with signal 6
17 Runtime error 1 ms 460 KB Execution killed with signal 6
18 Runtime error 1 ms 460 KB Execution killed with signal 6
19 Runtime error 1 ms 460 KB Execution killed with signal 6
20 Runtime error 1 ms 460 KB Execution killed with signal 6
21 Runtime error 1 ms 460 KB Execution killed with signal 6
22 Runtime error 2 ms 460 KB Execution killed with signal 6
23 Runtime error 1 ms 460 KB Execution killed with signal 6
24 Runtime error 1 ms 460 KB Execution killed with signal 6
25 Runtime error 1 ms 460 KB Execution killed with signal 6
26 Runtime error 1 ms 460 KB Execution killed with signal 6
27 Runtime error 1 ms 460 KB Execution killed with signal 6
28 Runtime error 1 ms 460 KB Execution killed with signal 6
29 Runtime error 1 ms 460 KB Execution killed with signal 6
30 Runtime error 1 ms 460 KB Execution killed with signal 6
31 Runtime error 1 ms 460 KB Execution killed with signal 6
32 Runtime error 1 ms 460 KB Execution killed with signal 6
33 Runtime error 1 ms 460 KB Execution killed with signal 6
34 Runtime error 1 ms 460 KB Execution killed with signal 6
35 Runtime error 1 ms 460 KB Execution killed with signal 6
36 Runtime error 1 ms 584 KB Execution killed with signal 6
37 Runtime error 1 ms 460 KB Execution killed with signal 6
38 Runtime error 1 ms 460 KB Execution killed with signal 6
39 Runtime error 1 ms 460 KB Execution killed with signal 6
40 Runtime error 1 ms 460 KB Execution killed with signal 6