Submission #1261895

#TimeUsernameProblemLanguageResultExecution timeMemory
1261895Canuc80kTriple Peaks (IOI25_triples)C++20
0 / 100
13 ms1968 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; // #TH: a[k] max for (int k = 2; k < H.size(); k ++) { int i = k - H[k], j1 = k - H[i], j2 = i + H[i]; if (i < 0 || H[i] >= H[k]) continue; if (j1 < 0 || H[j1] < H[i] || H[j1] > H[k] || H[j1] != j1 - i) j1 = -1; if (j2 >= H.size() || H[j2] < H[i] || H[j2] > H[k] || H[j2] != k - j2) j2 = -1; res += (j1 != -1) + (j2 != -1 && j2 != j1); } 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:26:1: warning: no return statement in function returning non-void [-Wreturn-type]
   26 | }
      | ^
#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...