Submission #1251173

#	Time	Username	Problem	Language	Result	Execution time	Memory
1251173		wng_	3개의 봉우리 (IOI25_triples)	C++20	8 / 100	2097 ms	1864 KiB

triples

#include <bits/stdc++.h>
#include "triples.h"

using namespace std;
using ll = long long;

bool cmp(int a, int b, int c, int ab, int ac, int bc) {
    return a == ab && b == ac && c == bc ||
      a == ab && b == bc && c == ac ||
      a == ac && b == bc && c == ab ||
      a == ac && b == ab && c == bc ||
      a == bc && b == ac && c == ab ||
      a == bc && b == ab && c == ac;
}

ll count_triples(vector<int> H) {
  ll res = 0;
  int N = H.size();
  for (int i = 0; i < N; i++) {
    for (int j = i + 1; j < N; j++) {
      for (int k = j + 1; k < N; k++) {
        res += cmp(H[i], H[j], H[k], j - i, k - i, k - j);
      }
    }
  }

  return res;
}

std::vector<int> construct_range(int M, int K) {
  return {1, 1, 1};
}

• Subtask 0: 0 / 0
• Subtask 1: 8 / 8
• Subtask 2: 0 / 6
• Subtask 3: 0 / 10
• Subtask 4: 0 / 11
• Subtask 5: 0 / 16
• Subtask 6: 0 / 19
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5