Submission #1320545

#	Time	Username	Problem	Language	Result	Execution time	Memory
1320545		yeyso2	Triple Peaks (IOI25_triples)	C++20	5.29 / 100	12 ms	1948 KiB

triples

#include "triples.h"
#include <bits/stdc++.h>
using namespace std;
long long count_triples(std::vector<int> H) {
  return 0ll;
}

std::vector<int> construct_range(int M, int K) {
  vector<int> res;
  vector<int> pattern = {3, 1, 1, 2, 1, 5};
  for(int i = 0; i < M; i ++){
    res.push_back(pattern[i % pattern.size()]);
  }
  return res;
}
/*


2 1 - - - - X - - - - X - - - -

We're given a single mountain of height 2.
2 - - - - X - (X+2)

2 - 2 - 4 - 6 - 8 - 10

- - - 3 A 1 B - - - -

in 3 mountains, we want 2 triple peaks on average
4 mountains, 6 triple peaks

3 1 1 2 1 5 3 1 1 2 1 5

*/

• 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: 3 / 5
• Subtask 8: 1.245 / 5
• Subtask 9: 0.4998 / 5
• Subtask 10: 0.2143 / 5
• Subtask 11: 0.25 / 5
• Subtask 12: 0.0833 / 5