Submission #1258071

#	Time	Username	Problem	Language	Result	Execution time	Memory
1258071		SugarCubes69	3개의 봉우리 (IOI25_triples)	C++20	0 / 100	13 ms	1860 KiB

triples

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;

long long count_triples(std::vector<int> h) {
    ll ans = 0;

    ll N = h.size();

    for(int i=0;i<N;i++){
        int k=i+h[i],j;
        if(k>=N) continue;

        //h[k] = k-j
        j = k-h[k];
        ans += (i<j && h[j]==j-i);
        //h[k] = j-i
        j = i+h[k];
        ans += (j<k && h[j]==k-j);
    }
    for(int k=0;k<N;k++){
        int i=k-h[k],j;
        if(i<0) continue;

        //h[i] = k-j
        j = k-h[i];
        ans += (i<j && h[j]==j-i);
        //h[i] = j-i
        j = i+h[i];
        ans += (j<k && h[j]==k-j);
    }

    return ans;
}
std::vector<int> construct_range(int M, int K) {
    // vector<int> res; res.push_back(1);
    // for (int i = 1; i < M; i ++) res.push_back(i);
    // return res;
}


/*void run_part1() {
  int N;
  assert(1 == scanf("%d", &N));
  std::vector<int> H(N);
  for (int i = 0; i < N; i++)
    assert(1 == scanf("%d", &H[i]));
  fclose(stdin);

  long long T = count_triples(H);

  printf("%lld\n", T);
  fclose(stdout);
}

void run_part2() {
  int M, K;
  assert(2 == scanf("%d %d", &M, &K));
  fclose(stdin);

  std::vector<int> H = construct_range(M, K);

  int N = H.size();
  printf("%d\n", N);
  for (int i = 0; i < N; i++)
    printf("%d%c", H[i], " \n"[i + 1 == N]);
  fclose(stdout);
}


int main() {
  int part;
  assert(1 == scanf("%d", &part));
  if (part == 1)
    run_part1();
  else if (part == 2)
    run_part2();

  return 0;
}*/

Compilation message (stderr)

triples.cpp: In function 'std::vector<int> construct_range(int, int)':
triples.cpp:39:1: warning: no return statement in function returning non-void [-Wreturn-type]
   39 | }
      | ^

• 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