Submission #1261849

#TimeUsernameProblemLanguageResultExecution timeMemory
1261849Canuc80kTriple Peaks (IOI25_triples)C++20
0 / 100
12 ms1860 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) { for (int i = 0; i < H.size(); i ++) pp[H[i]][i] ++; ll res = 0; for (int i = 1; i <= 10; i ++) for (int j = i + 1; j <= 10; j ++) for (int k = j + 1; k <= 10; k ++) { ll a = j - i, b = k - i, c = k - i; bool oka = 0, okb = 0, okc = 0; if (pp[i][a] || pp[j][a] || pp[k][a]) oka = 1; if (pp[i][b] || pp[j][b] || pp[k][b]) okb = 1; if (pp[i][c] || pp[j][c] || pp[k][c]) okc = 1; if (oka && okb && okc) res ++; } 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...