QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#137925	#6341. The Last Battle	konstantys^#	0	38ms	3980kb	C++17	1.9kb	2023-08-10 19:04:51	2024-07-04 01:32:34

Judging History

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

[2024-07-04 01:32:34]
评测

测评结果：0
用时：38ms
内存：3980kb

查看

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

[2023-08-10 19:04:51]
提交

Anna

#include "Anna.h"
#include <string>
#include<vector>
using namespace std;
namespace {

int variable_example = 0;

}

void Anna(int X, int Y, int N, std::string S) {
    vector<int> v;
    v={14, 100,88, 38, 36, 148,128,120,
20, 109,56, 32, 8,  93, 53, 105,
146,0,  9,  82, 64, 200,155,73,
118,160,83, 96, 135,133,130,17,
78, 45, 136,35, 99, 202,11, 41,
18, 193,1,  66, 65, 139,153,71,
6,  173,59, 134,12, 132,42, 44,
48, 29, 112,114,69, 30, 3,  16};
	variable_example += 1;
	auto x=v[X*8+Y];
    for(int i=0;i<8;i++){
        if(i!=X && i!=Y) Paint(i,i,(x>>i)&1);
    }
    int l=0;
	for (int i = 0; i < 8; i++) {
		for (int j = 0; j < 8; j++) {
			if (i != j) {
                if(i==X || j==Y) continue;
                if(l>=N || S[l]=='A')
				Paint(i, j, 0);
				else Paint(i,j,1);
				l++;
			}
		}
	}
}

Source code, Language: C++17

Bruno

#include "Bruno.h"
#include <vector>
#include <string>
using namespace std;
namespace {

int variable_example = 0;

}

std::string Bruno(int N, std::vector<std::vector<int>> T) {
	vector<int> v={14, 100,88, 38, 36, 148,128,120,
20, 109,56, 32, 8,  93, 53, 105,
146,0,  9,  82, 64, 200,155,73,
118,160,83, 96, 135,133,130,17,
78, 45, 136,35, 99, 202,11, 41,
18, 193,1,  66, 65, 139,153,71,
6,  173,59, 134,12, 132,42, 44,
48, 29, 112,114,69, 30, 3,  16};
    string s="";
    int x=0;
    for(int i=0;i<8;i++){
        if(T[i][i]==1) x|=(1<<i);
    }
    int X,Y;
    for(int i=0;i<8;i++){
        for(int u=0;u<8;u++){
            if(v[i*8+u]==x || v[i*8+u]==(x^(1<<i)) || v[i*8+u]==(x^(1<<u)) || v[i*8+u]==(x^(1<<u)^(1<<i))){
                X=i,Y=u;
            }
        }
    }
	for(int i=0;i<8;i++){
        for(int u=0;u<8;u++){
            if(i==u) continue;
            if(i==X || u==Y) continue;
            if(s.size()<N){
                if(T[i][u]==1) s+="B"; else s+="A";
            }
        }
	}
	return s;
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0

Wrong Answer

time: 38ms

memory: 3980kb

Manager to Anna

Anna to Manager

1000000000000000010000000000000001000000010000000
0000000010000000000000001000000000000000100000000
0000000010000000000000000000000010000000100000000
1000000010000000100000000000000010000000100000000
1000000000000000100000000000000000000000000000010
0000000010000000000000001000000000000000100000000
...

Manager to Bruno

20000
1 1000000110010100000000000001000000000001000001000000001100000000
1 0001000001000000000011000001000000011000000100000000001000010000
1 1101011101000000001000000100000000000000010001000100001001000000
1 1100000000000001001000000001000000000000010001000000001000000000
1 100010000000100000100000...

Bruno to Manager

A
A
B
A
A
A
B
B
B
A
B
A
A
A
A
B
B
A
A
A
A
A
A
A
A
A
B
B
A
A
A
B
A
B
B
A
B
A
B
B
A
A
B
A
A
A
A
B
A
B
B
A
B
B
A
A
A
A
A
A
A
B
A
B
A
B
B
A
A
A
B
B
B
B
B
A
B
A
B
A
A
B
A
A
A
B
B
B
A
A
B
A
B
A
A
B
B
A
A
B
A
A
B
A
A
A
A
A
A
A
B
B
B
A
B
A
A
A
A
A
A
A
A
B
A
A
B
A
A
B
A
A
B
A
A
A
A
B
A
A
B
A
A
A
A
B
A
A
A
A
...

result:

points 0.0 Accepted: 0