제출 #1249854

#제출 시각아이디문제언어결과실행 시간메모리
1249854ZicrusTriple Peaks (IOI25_triples)C++20
8 / 100
2093 ms1972 KiB
#include <bits/stdc++.h> #include "triples.h" using namespace std; typedef long long ll; typedef pair<ll, ll> pll; #define all(v) v.begin(), v.end() constexpr ll inf = 1ll << 62ll; mt19937 mt(time(0)); ll _ = 0; ll count_triples(vector<int> h) { ll n = h.size(); ll cnt = 0; for (ll i = 0; i < n; i++) { for (ll j = i+1; j < n; j++) { for (ll k = j+1; k < n; k++) { multiset<ll> dists = {abs(i-j), abs(j-k), abs(k-i)}; multiset<ll> heights = {h[i], h[j], h[k]}; if (dists == heights) { cnt++; } } } } return cnt; } vector<int> construct_range(int M, int K) { return {}; } #ifdef TEST #include "grader.cpp" #endif
#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...