Submission #1261871

#TimeUsernameProblemLanguageResultExecution timeMemory
1261871Canuc80kTriple Peaks (IOI25_triples)C++20
6 / 100
752 ms1984 KiB
#include "bits/stdc++.h" using namespace std; using ll = long long; using ld = long double; using ull = unsigned long long; map<ll, ll> pp[11]; long long count_triples(std::vector<int> H) { ll res = 0; for (int i = 0; i < H.size(); i ++) for (int j = i + 1; j < H.size() && j <= i + 10; j ++) for (int k = j + 1; k < H.size() && k <= j + 10; k ++) { vector<ll> a = {H[i], H[j], H[k]}; vector<ll> b = {abs(i - j), abs(j - k), abs(k - i)}; sort(a.begin(), a.end()); sort(b.begin(), b.end()); bool ok = 1; for (int p = 0; p < a.size(); p ++) if (a[p] != b[p]) ok = 0; res += ok; } return res; } 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; }

Compilation message (stderr)

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