QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#20405	#3098. Ancient Machine	uezexh^#	5	68ms	9408kb	C++20	1.4kb	2022-02-15 23:56:55	2023-01-17 10:44:55

Judging History

你现在查看的是最新测评结果

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-01-17 10:44:55]
评测

测评结果：5
用时：68ms
内存：9408kb

查看

[2022-02-15 23:56:55]
提交

Anna

#include "Anna.h"
#include <vector>
using namespace std;
void Anna(int N,vector<char> S){
	using ll=long long;
	vector<int> a([](int n){
		while(n%64)
			++n;
		return n;
	}(N));
	ll fib[66]={0,1};
	for(int i=2;i<66;++i)
		fib[i]=fib[i-1]+fib[i-2];
	bool f=false;
	for(int i=0;i<N;++i){
		if(!f){
			if(S[i]=='X'){
				f=true;
				a[i]=1;
				++i;
			}
		}else if(S[i]=='Z'){
			if(S[i-1]=='Z')
				a[i-1]=0;
			a[i]=1;
		}
	}
	for(int i=0;i<int(a.size());i+=64){
		ll s=0;
		for(int j=0;j<64;++j)
			if(a[i+j])
				s+=fib[65-j];
		for(int j=0;j<45;++j)
			Send((s>>j)&1);
	}
}

源文件, 语言: C++20

Bruno

#include "Bruno.h"
using namespace std;
void Bruno(int N,int L,vector<int> A){
	using ll=long long;
	vector<int> a([](int n){
		while(n%64)
			++n;
		return n;
	}(N));
	ll fib[66]={0,1};
	for(int i=2;i<66;++i)
		fib[i]=fib[i-1]+fib[i-2];
	for(int i=0;i<int(A.size());i+=45){
		ll s=0;
		for(int j=0;j<45;++j)
			if(A[i+j])
				s|=(1LL<<j);
		for(int j=0;j<64;++j)
			if(s>=fib[65-j]){
				s-=fib[65-j];
				a[i+(j++)]=1;
			}
	}
	vector<int> p;
	for(int i=0;i<N;++i)
		if(a[i])
			p.push_back(i);
	if(int(p.size())<=1){
		for(int i=0;i<N;++i)
			Remove(i);
	}else{
		for(int i=0;i<p[0];++i)
			Remove(i);
		for(int i=p.back()+1;i<N;++i)
			Remove(i);
		for(int i=1;i<int(p.size());++i){
			for(int j=p[i]-1;j>p[i-1];--j)
				Remove(j);
			Remove(p[i]);
		}
		Remove(p[0]);
	}
}

源文件, 语言: C++20

詳細信息

Subtask #1:

score: 5

Accepted

Test #1:

score: 100

Accepted

time: 0ms

memory: 3192kb

input:

18
Y X Y Z X Z X X Z Z Y Y Z Y Y Z X X

output:

45
111110000110100111010010011010100100000011110

input:

45
111110000110100111010010011010100100000011110

output:

0 45 3

result:

ok n = 18, D = 45, L = 3

Test #2:

score: 100

Accepted

time: 4ms

memory: 3104kb

input:

18
X Z X Y Y Y X Z X Y Z Z Z Z Y Z Z Y

output:

45
000111001100101100111001000010100000110000001

input:

45
000111001100101100111001000010100000110000001

output:

0 45 3

result:

ok n = 18, D = 45, L = 3

Test #3:

score: 100

Accepted

time: 4ms

memory: 3080kb

input:

18
Y Z Z Y Z X X Z Y Y Z Z Z Y X X Z Y

output:

45
101101110001001101111110100010100000000001000

input:

45
101101110001001101111110100010100000000001000

output:

0 45 2

result:

ok n = 18, D = 45, L = 2

Test #4:

score: 100

Accepted

time: 0ms

memory: 3064kb

input:

18
X Z Z X Z X X Z X Y Y X X Z X Y Z X

output:

45
110001001000011111000111101000100111011000011

input:

45
110001001000011111000111101000100111011000011

output:

0 45 2

result:

ok n = 18, D = 45, L = 2

Test #5:

score: 100

Accepted

time: 4ms

memory: 3124kb

input:

18
X Y X Y Y X X Z Y Z Y X Z Y Y X X Z

output:

45
011100111001111000010100110011110001011000001

input:

45
011100111001111000010100110011110001011000001

output:

0 45 5

result:

ok n = 18, D = 45, L = 5

Test #6:

score: 100

Accepted

time: 0ms

memory: 3172kb

input:

18
X X Y Z X Y Y Y X X Z X X X Z X Z Z

output:

45
101001110101011011001011111110001100111011001

input:

45
101001110101011011001011111110001100111011001

output:

0 45 2

result:

ok n = 18, D = 45, L = 2

Test #7:

score: 100

Accepted

time: 4ms

memory: 3124kb

input:

3
X Y Z

output:

45
111111100101011101010100100011111100100110101

input:

45
111111100101011101010100100011111100100110101

output:

0 45 1

result:

ok n = 3, D = 45, L = 1

Test #8:

score: 100

Accepted

time: 4ms

memory: 3132kb

input:

3
Z Y X

output:

45
010001110010011000001101111000110110111110100

input:

45
010001110010011000001101111000110110111110100

output:

0 45 0

result:

ok n = 3, D = 45, L = 0

Test #9:

score: 100

Accepted

time: 4ms

memory: 3064kb

input:

18
X X X X X X X X X X X X X X X X X X

output:

45
101110011010000101011110100101001011100111110

input:

45
101110011010000101011110100101001011100111110

output:

0 45 0

result:

ok n = 18, D = 45, L = 0

Test #10:

score: 100

Accepted

time: 4ms

memory: 3104kb

input:

18
Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y

output:

45
000000000000000000000000000000000000000000000

input:

45
000000000000000000000000000000000000000000000

output:

0 45 0

result:

ok n = 18, D = 45, L = 0

Test #11:

score: 100

Accepted

time: 2ms

memory: 3136kb

input:

18
Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z

output:

45
000000000000000000000000000000000000000000000

input:

45
000000000000000000000000000000000000000000000

output:

0 45 0

result:

ok n = 18, D = 45, L = 0

Subtask #2:

score: 0

Wrong Answer

Test #12:

score: 0

Wrong Answer

time: 68ms

memory: 9408kb

input:

100000
X Z X Z Z X Y Z Y X Y X Z Z Z Y X Z Y X Y Y X Y Y Y Z Y Z Z Y X X Y X X Y Y X X X Z Y Y Y Z Z Z Z Y X Y Y Z Z Z X Y Z X X X X Y X Y X X Z X Z Z Z X Y X X X Z X Z X X X Y Y Y Y Z X X Y Z Y Y X Z X Z Z Z Z Z Y Z Y X Y Y Y Y X Z Z Y Z Z Y Z Z Z X Z Z X X Z Z Z Z X X Z Y Y Z Y Y Z Z Y Y Z Y Z Y Z...

output:

70335
010011111001110100001001110001111100111001001111010101110111011000010001110110100010101000010110111110001100100010110101010100100100110101100010000011010011111011110101101011101100100000111011111000110111010011110010100101101011000001100000000111110101111101101010110001111010101000001001001001...

input:

70335
010011111001110100001001110001111100111001001111010101110111011000010001110110100010101000010110111110001100100010110101010100100100110101100010000011010011111011110101101011101100100000111011111000110111010011110010100101101011000001100000000111110101111101101010110001111010101000001001001001...

output:

0 70335 8688

result:

wrong answer your query is valid but your solution is not optimal: read 8688 but expected 22133