oj.uz

답안 #731717

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
731717 2023-04-27T20:53:39 Z Dipto_Debdip DNA 돌연변이 (IOI21_dna) C++17
21 / 100
 36 ms 3764 KB 
#include "dna.h"
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
string aa, bb;
void init(std::string a, std::string b) {
    aa = a, bb = b;
}
int get_distance(int x, int y) {
    string a, b;
    for (ll i = x; i <= y; i++) a += aa[i];
    for (ll i = x; i <= y; i++) b += bb[i];
    if (x == y) {
      if (a != b) return -1;
      return 0;
    } else if (y - x == 1) {
      string rev = a;
      if (a == b) return 0;
      reverse(rev.begin(), rev.end());
      if (rev == b) return 1;
      else return -1;
    } else {
      if (a == b) return 0;
      else {
        if (a[0] == b[0]) {
          string rem1, rem2;
          rem1 += a[1];
          rem1 += a[2];
          rem2 += b[1];
          rem2 += b[2];
          reverse(rem1.begin(), rem1.end());
          if (rem1 == rem2) return 1;
          else return -1;
        } else if (a[1] == b[1]) {
          string rem1, rem2;
          rem1 += a[0];
          rem1 += a[2];
          rem2 += b[0];
          rem2 += b[2];
          reverse(rem1.begin(), rem1.end());
          if (rem1 == rem2) return 1;
          else return -1;
        } else if (a[2] == b[2]) {
          string rem1, rem2;
          rem1 += a[0];
          rem1 += a[1];
          rem2 += b[0];
          rem2 += b[1];
          reverse(rem1.begin(), rem1.end());
          if (rem1 == rem2) return 1;
          else return -1;
        } else {
          vector<char> one, two;
          for (char ch : a) one.push_back(ch);
          for (char ch : b) two.push_back(ch);
          sort(one.begin(), one.end());
          sort(two.begin(), two.end());
          if (one == two) return 2;
          else return -1;
        }
      }
    }
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 2380 KB Output is correct
2 Correct 34 ms 3764 KB Output is correct
3 Correct 32 ms 3636 KB Output is correct
4 Correct 32 ms 3748 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
0.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 2 ms 1236 KB Output is correct
6 Incorrect 2 ms 1204 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 2 ms 1236 KB Output is correct
6 Incorrect 2 ms 1204 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 2 ms 1236 KB Output is correct
6 Incorrect 2 ms 1204 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 2380 KB Output is correct
2 Correct 34 ms 3764 KB Output is correct
3 Correct 32 ms 3636 KB Output is correct
4 Correct 32 ms 3748 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 2 ms 1236 KB Output is correct
13 Incorrect 2 ms 1204 KB Output isn't correct
14 Halted 0 ms 0 KB -