제출 #1281550

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1281550		M_W_13	Triple Peaks (IOI25_triples)	C++20	0 / 100	13 ms	2364 KiB

triples

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

using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
#define pb push_back
#define st first
#define nd second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(a) a.begin(), a.end()

long long count_triples(std::vector<int> T) {
  int n = T.size();
  ll ans = 0;
  rep(i, n) {
    int j = i + T[i];
    if (j >= n) continue;
    int k[3];
    k[0] = j - T[j];
    k[1] = i + T[j];
    k[2] = i - T[j];
    rep(c, 3) {
      if (k[c] < 0 || k[c] >= n) continue;
      int r = k[c];
      if (i == j || j == r || i == r) continue;
      int t1 = abs(i - j);
      int t2 = abs(i - r);
      int t3 = abs(j - r);
      if (t2 > t3) swap(t2, t3);
      if (t1 > t2) swap(t1, t2);
      if (t2 > t3) swap(t2, t3);
      int a1 = T[i];
      int a2 = T[j];
      int a3 = T[r];
      if (a2 > a3) swap(a2, a3);
      if (a1 > a2) swap(a1, a2);
      if (a2 > a3) swap(a2, a3);
      if (a1 != t1 || a2 != t2 || a3 != t3) continue;
      ans++;
    }
  }
  return ans;
}

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

• Subtask 0: 0 / 0
• Subtask 1: 0 / 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