Submission #839948


Source Code Expand

#include <array>
#include <string>
#include <iostream>
#include <vector>

int f (std::vector<int> const & a, int A) {
  int sum = 0;
  for (int i = 0; i < a.size(); ++i) {
    sum += (a[i] - A) * (a[i] - A);
  }
  return sum;
}

int main () {
  std::string line;
  std::getline(std::cin, line);

  int N = line.size();

  for (int i = 0; i < N; ++i) {
    if (i < N - 1 && (line[i] == line[i + 1])) {
      std::cout << i << " " << i + 1 << std::endl;
      return 0;
    }
    if (i < N - 1 && (line[i] == line[i + 2])) {
      std::cout << i << " " << i + 2 << std::endl;
      return 0;
    }
  }
  std::cout << "-1 -1" << std::endl;
}

Submission Info

Submission Time
Task D - Unbalanced
User toufu12345
Language C++14 (GCC 5.4.1)
Score 0
Code Size 668 Byte
Status WA
Exec Time 11 ms
Memory 512 KiB

Judge Result

Set Name Sample Sub1 Sub2
Score / Max Score 0 / 0 0 / 200 0 / 200
Status
AC × 1
WA × 1
AC × 5
WA × 9
AC × 8
WA × 16
Set Name Test Cases
Sample 0_01, 0_02
Sub1 0_01, 0_02, 1_03, 1_04, 1_05, 1_06, 1_07, 1_08, 1_09, 1_10, 1_11, 1_12, 1_13, 1_14
Sub2 0_01, 0_02, 1_03, 1_04, 1_05, 1_06, 1_07, 1_08, 1_09, 1_10, 1_11, 1_12, 1_13, 1_14, 2_15, 2_16, 2_17, 2_18, 2_19, 2_20, 2_21, 2_22, 2_23, 2_24
Case Name Status Exec Time Memory
0_01 WA 4 ms 256 KiB
0_02 AC 4 ms 256 KiB
1_03 WA 4 ms 256 KiB
1_04 AC 4 ms 256 KiB
1_05 WA 4 ms 256 KiB
1_06 WA 4 ms 256 KiB
1_07 WA 4 ms 256 KiB
1_08 WA 4 ms 256 KiB
1_09 WA 4 ms 256 KiB
1_10 WA 4 ms 256 KiB
1_11 WA 4 ms 256 KiB
1_12 AC 4 ms 256 KiB
1_13 AC 4 ms 256 KiB
1_14 AC 4 ms 256 KiB
2_15 WA 10 ms 512 KiB
2_16 WA 11 ms 512 KiB
2_17 WA 10 ms 512 KiB
2_18 WA 10 ms 512 KiB
2_19 WA 10 ms 512 KiB
2_20 WA 10 ms 512 KiB
2_21 WA 10 ms 512 KiB
2_22 AC 10 ms 512 KiB
2_23 AC 10 ms 512 KiB
2_24 AC 10 ms 512 KiB