Submission #1034147

#	Time	Username	Problem	Language	Result	Execution time	Memory
1034147		d4xn	Tricolor Lights (JOI24_tricolor)	C++17	5 / 100	54 ms	1576 KiB

Anna

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

pair<string, int> anna(int n, string s) {
  string t(131, '.');
  
  if (s[0] == 'R') {
    if (s[1] == 'R') t[0] = t[1] = 'G';
    else if (s[1] == 'G') t[0] = t[1] = 'B';
    else t[0] = t[1] = 'G';
  }
  else if (s[0] == 'G') {
    if (s[1] == 'R') t[0] = t[1] = 'B';
    else if (s[1] == 'G') t[0] = t[1] = 'R';
    else t[0] = t[1] = 'R';
  }
  else {
    if (s[1] == 'R') t[0] = t[1] = 'G';
    else if (s[1] == 'G') t[0] = t[1] = 'R';
    else t[0] = t[1] = 'R';
  }

  if (t[1] == 'R') {
    if (s[2] == 'R') t[2] = 'G';
    else if (s[2] == 'G') t[2] = 'B';
    else t[2] = 'G';
  }
  else if (t[1] == 'G') {
    if (s[2] == 'R') t[2] = 'B';
    else if (s[2] == 'G') t[2] = 'R';
    else t[2] = 'R';
  }
  else {
    if (s[2] == 'R') t[2] = 'G';
    else if (s[2] == 'G') t[2] = 'R';
    else t[2] = 'R';
  }

  for (int i = 3; i < n; i++) {
    t[i] = (s[i] == 'R' ? 'G' : 'R');
  }

  string tt(n, '.');
  for (int i = 0; i < n; i++) {
    tt[i] = t[i];
  }

  return make_pair(tt, min(130, n));
}

Bruno

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

int n, l;

void init(int N, int L) {
  n = N;
  l = L;
}

int bruno(string u) {
  if (n == 1) return 1;

  if (u[0] == u[1]) return 1;
  else return 2;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 5
• Subtask 4: 0 / 15
• Subtask 5: 0 / 70