QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#137920#6341. The Last Battlekonstantys#0 42ms3868kbC++171.8kb2023-08-10 19:02:432024-07-04 01:32:31

Judging History

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

  • [2024-07-04 01:32:31]
  • 评测
  • 测评结果:0
  • 用时:42ms
  • 内存:3868kb
  • [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:02:43]
  • 提交

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(S[l]=='A')
				Paint(i, j, 0);
				else Paint(i,j,1);
				l++;
			}
		}
	}
}

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(T[i][u]==1) s+="B"; else s+="A";
        }
	}
	return s;
}

详细

Test #1:

score: 0
Wrong Answer
time: 42ms
memory: 3868kb

Manager to Anna

20000
1 7 1 A
2 3 1 A
0 1 1 A
1 1 1 A
7 4 1 A
2 3 1 A
0 3 1 B
0 7 1 A
4 2 1 B
5 4 1 A
6 0 1 B
7 3 1 A
0 7 1 A
2 3 1 A
1 6 1 A
5 2 1 B
2 7 1 B
6 3 1 A
3 3 1 A
1 7 1 A
2 3 1 A
1 2 1 A
5 3 1 A
3 5 1 A
4 3 1 A
2 3 1 A
4 6 1 B
7 3 1 B
2 3 1 A
4 4 1 A
7 3 1 A
4 5 1 B
0 7 1 A
0 3 1 B
2 0 1 B
4 1 1 A
6 0 1 ...

Anna to Manager

1011111110011111111111111011111111111111111111111
0011111111011111111111111111111101111111111111110
0111111110111111011111110111111111111111111111110
1011111111011111111111110111111111111111111111110
1011111101011111111111110111111111111110111111111
0011111111011111111111111111111101111111111111110
...

Manager to Bruno

20000
1 1011111110010100110011101111111011110111111111101111111111111110
1 0011111111100111000011001111111111111111111110111110111111111110
1 1101011101111111101011111110111110110111111111111111111111111110
1 1101111100000001101101111011111110110111111111111011111110111110
1 101111111010111111110111...

Bruno to Manager

ABBBBBBBABBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB
ABBBBBBBABBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB
BABABBABBBBBBAABBBBBBBBBBABBBBBBBBBBBBBBBBB
ABBBBBBBABBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB
ABBBBBBBABBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB
ABBBBBBBABBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB
BBBBBBBBABBBBBBBBBBBBBBBBBBBBBBBBBBBB...

result:

points 0.0 Accepted: 0