Submission #1250784

#TimeUsernameProblemLanguageResultExecution timeMemory
1250784yeyso2Triple Peaks (IOI25_triples)C++20
6 / 100
1035 ms1984 KiB
#include "triples.h"
#include <bits/stdc++.h>
using namespace std;
long long count_triples(vector<int> H) {
    int n = H.size();
    long long res = 0;
    for(int i = 0; i < n; i ++){
        for(int j = i + 1; j < min(n, i + 11); j ++){
            for(int k = j + 1; k < min(n, i + 11); k ++){
                multiset<int> distances;
                distances.insert(j - i);
                distances.insert(k - j);
                distances.insert(k - i);

                multiset<int> heights;
                heights.insert(H[i]);
                heights.insert(H[j]);
                heights.insert(H[k]);

                if(distances == heights){
                    res ++;
                }
            }
        }
    }
    return res;
}

vector<int> construct_range(int M, int K) {
  return {1, 1, 1};
}
/*
1
7
4 1 4 3 2 6 1
*/
#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...