QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#553090#7562. Except Oneucup-team1231#WA 0ms3816kbC++14807b2024-09-08 08:13:392024-09-08 08:13:39

Judging History

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

  • [2024-09-08 08:13:39]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3816kb
  • [2024-09-08 08:13:39]
  • 提交

answer

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

struct state {
    vector<int> vec[2][2];

    state(char S[]) {
        for(int i = 0; i < 2; i++)
            for(int j = 0; j < 2; j++)
                vec[i][j] = vector<int>{0, 0, 0};
        for(int i = 0; i < 2; i ++) {
            char ch = i == 0 ? 'R' : 'B';
            if(S[1] == ch) continue;
            if(S[0] != 'Y' && S[2] != 'Y') vec[0][0][1]++;
            if(S[0] != 'Y' && S[2] != 'P') vec[0][1][1 + i]++;
            if(S[0] != 'P' && S[2] != 'Y') vec[1][0][1 - i]++;
            if(S[0] != 'P' && S[2] != 'P') vec[1][1][1]++;
        }
    }
};

state merge(const state& A, const state& B) {
}

state calc(int l, int r) {
}

int n;
char S[100005];

int main() {
    scanf("%d%s", &n, S);
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3816kb

input:

7 5 3

output:


result:

wrong answer Answer contains longer sequence [length = 1], but output contains 0 elements