QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#448306#4912. WereYouLastasupersalmon10 1ms5000kbC++141.0kb2024-06-19 15:21:032024-06-19 15:21:04

Judging History

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

  • [2024-06-19 15:21:04]
  • 评测
  • 测评结果:10
  • 用时:1ms
  • 内存:5000kb
  • [2024-06-19 15:21:03]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

bool query(int);
void modify(int,bool);

bool WereYouLast(int N, int m){
	if(N == (1<<10)){
		int num = 0;
		
		for(int i = 0; i < 10; i++){
			num += ((int)query(i+1)<<i);
		}		
		if(num == (1<<10)-1) return 1;
		
		num++;
		
		for(int i = 0; i < 10; i++){
			modify(i+1,(num&(1<<i))>0);
		}

		
		return 0;
	}
	else if(true){
		bitset<65> arr("00000000000000000001101001100101000000000100001111000010000000000");
		
		int num = 1;
		bool die = true;
		int l[6];
		int s = 6;
		for(int i = 0; i < 6; i++){
			die &= (query(num)^arr[num]);
			l[i]=num;
			num = num * 2;
			if(query(num/2)^arr[num/2]) num++; 
			if( arr[1]^query(1) && i == 3){
				s = 4;
				break;
			}
		}
		if(die) return 1;
		
		for(int i = s - 1; i >= 0; i--){
			if(!(query(l[i])^arr[l[i]]) ){
				modify(l[i],!arr[l[i]]);
				s = i - 1;
				break;
			}
			modify(l[i],arr[l[i]]);
		}

		for(int i = s; i >= 0; i--){
			modify(l[i],arr[l[i]]);
		}
		return 0;
	}
	return 1;

}

詳細信息

Subtask #1:

score: 10
Accepted

Test #1:

score: 10
Accepted
time: 1ms
memory: 3840kb

input:

1024 10

output:

12345876 10 10

result:

ok Correct Answer.
C1 = 10.
C2 = 10.

Subtask #2:

score: 0
Wrong Answer

Test #2:

score: 0
Wrong Answer
time: 1ms
memory: 4996kb

input:

65536 100000

output:

12345876 -2 1

result:

wrong answer Invalid Operation At Position 1.

Subtask #3:

score: 0
Wrong Answer

Test #3:

score: 0
Wrong Answer
time: 1ms
memory: 5000kb

input:

1048576 100000

output:

12345876 -2 1

result:

wrong answer Invalid Operation At Position 1.

Subtask #4:

score: 0
Wrong Answer

Test #4:

score: 0
Wrong Answer
time: 1ms
memory: 4988kb

input:

67108864 100000

output:

12345876 -2 1

result:

wrong answer Invalid Operation At Position 1.