QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#875460	#6341. The Last Battle	weajink2	0	39ms	4480kb	C++17	2.6kb	2025-01-29 20:18:02	2025-01-29 20:18:04

Judging History

This is the latest submission verdict.

[2025-01-29 20:18:04]
Judged

Verdict: 0
Time: 39ms
Memory: 4480kb

Show

[2025-01-29 20:18:02]
Submitted

Anna

#include "Anna.h"

#include <bits/stdc++.h>

using namespace std;
#define rep(i, n) for(int i= 0; i<(n); i++)
#define reps(i,s, n) for(int i= (s); i<(n); i++)
#define each(a, x) for (auto &a : x)
#define vv(T) vector<T>
#define endl '\n'
#define sz(x) (int)x.size()
#define ll long long
#define all(c) begin(c), end(c)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pd pair<int,int> 
#define wr cout<<
#define wre wr endl;
#define wrut(a) {each(i,(a))wr i<<" "; wre}
#define wrot(a,b,c) {wre wr a<<" "<<b<<" "<<c<<" ";}
// #define int ll
void Anna(int X, int Y, int N, string A) {
  // swap(X,Y);
  int tab[8][8];
  rep(i,8){
    rep(j,8){
      tab[i][j]=0;
    }
  }
  int p=0,n=Y;
  if(X==0)p=1;
  rep(i,3){
    if(n%2==1){
      tab[p][i]=1;
    }
    n/=2;
  }
  n=X;
  int x=3;
  rep(i,3){
    if(x==Y)x++;
    tab[p][x]=n%2;
    n/=2;
    x++;
  }
  n=1;
  if(x==Y)x++;
  tab[p][x]=(int)A[0]-65;
  reps(i,p+1,8){
    rep(j,8){
      if (i != X && j != Y &&n<N){
        tab[i][j]=(int)A[n]-65;
        n++;
      }
    }
  }
  // rep(i,8){
  //   wrut(tab[i]);
  // }
  int akt = 0;
  for (int i = 0; i < 8; i++) {
    for (int j = 0; j < 8; j++) {
      if (i != X && j != Y) {
        Paint(i, j, tab[i][j]);
        // wr tab[i][j];
        akt++;
      }
    }wre
  }
}

源文件, 语言: C++17

Bruno

#include "Bruno.h"

#include <bits/stdc++.h>

using namespace std;
#define rep(i, n) for(int i= 0; i<(n); i++)
#define reps(i,s, n) for(int i= (s); i<(n); i++)
#define each(a, x) for (auto &a : x)
#define vv(T) vector<T>
#define endl '\n'
#define sz(x) (int)x.size()
#define ll long long
#define all(c) begin(c), end(c)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pd pair<int,int> 
#define wr cout<<
#define wre wr endl;
#define wrut(a) {each(i,(a))wr i<<" "; wre}
#define wrot(a,b,c) {wre wr a<<" "<<b<<" "<<c<<" ";}
// #define int ll
string Bruno(int N, vector<vector<int>> A) {
  string wy="";
  int x=0,y=0;
  int p=0;
  bool czy=1;
  rep(i,8){
    if(A[p][i]==1)czy=0;
  }
  if(czy)p++;
  int z=1;
  rep(i,3){
    if(A[p][i]==1){
      y+=A[p][i]*z;
    }
    z*=2;
  }
  z=1;
  // wr y<<" ";
  int b=3;
  rep(i,3){
    if(b==y)b++;
    x+=A[p][b]*z;
    z*=2;
    b++;
  }
  // wr x<<endl;
  if(b==y)b++;
  wy+=char(A[p][b]+65);
  // rep(i,8){
  //   wrut(A[i]);
  // }
  // wrut(wy);
  for (int i = p+1; i < 8; i++) {
    for (int j = 0; j < 8; j++) {
      if ((i != x && j != y)&&(int)wy.size() < N)
        wy += char('A' + A[i][j]);
    }
  }
  // wrut(wy);
  return wy;
}

源文件, 语言: C++17

詳細信息

Test #1:

score: 0

Wrong Answer

time: 39ms

memory: 4480kb

Manager to Anna

Anna to Manager









1111000000000000000000000000000000000000000000000








1100100000000000000000000000000000000000000000000








1000000000000000000000000000000000000000000000000








1010000000000000000000000000000000000000000000000








0011110000000000000000000000000000000000000000000








11...

Manager to Bruno

20000
1 1111000110010100000000000000000000000001000000000000000100000000
1 1101010000000000000011000001000000010000000100000000000000010000
1 1101011111000000000000000100000000000000010000000100000001000000
1 1101000000000001000000000000000000000000010000000000000000000000
1 001111100000100000000000...

Bruno to Manager

A
A
B
A
A
A
A
A
A
A
B
A
A
A
A
A
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
A
A
B
A
A
B
A
B
B
A
B
B
A
A
A
A
A
A
A
B
A
A
A
B
B
A
A
A
B
B
B
B
B
A
B
A
B
A
A
B
A
A
A
A
B
B
A
B
B
A
B
A
A
B
B
A
A
A
A
A
B
A
A
A
A
A
A
A
B
B
A
A
B
A
A
A
A
B
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