oj.uz

Submission #1034143

# Submission time Handle Problem Language Result Execution time Memory
1034143 2024-07-25T10:06:34 Z d4xn Tricolor Lights (JOI24_tricolor) C++17
0 / 100
 1 ms 856 KB 
#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');
  }

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

#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 (u[0] == u[1]) return 1;
  else return 2;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 856 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 856 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 856 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 856 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 856 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -