제출 #1320548

#제출 시각아이디문제언어결과실행 시간메모리
1320548yeyso2Triple Peaks (IOI25_triples)C++20
3.88 / 100
12 ms1948 KiB
#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 = {7, 2, 1, 1, 4, 1, 4, 3}; 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 4 1 2 1 3 4 7 4 - 3 - 5 1 4 7 2 1 1 4 - - 3 7 2 1 1 4 1 4 3 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...