Submission #1250952

#TimeUsernameProblemLanguageResultExecution timeMemory
1250952thunoproTriple Peaks (IOI25_triples)C++20
8 / 100
2093 ms1864 KiB
#include "triples.h"
#include<bits/stdc++.h>
using namespace std ; 
#define ll long long 
#define fi first 
#define se second 
#define re exit(0); 

typedef vector<int> vi ; 
int N ; 
long long count_triples(vi H ) {
	N = H.size () ; 
	int res = 0 ; 
	for ( int i = 0 ; i < N ; i ++ ) for ( int j = i + 1 ; j < N ; j ++ ) for ( int k = j + 1 ; k < N ; k ++ ) 
	{
		vi A = {H[i],H[j],H[k]} ; 
		vi B = {j-i,k-i,k-j} ; 
		sort (A.begin(),A.end()) ; 
		sort (B.begin(),B.end()) ;
		bool ok = true ; 
		for ( int i = 0 ; i < 3 ; i ++ ) if ( A [i] != B [i] ) ok = false ; 
		res += ( ok == true ) ; 
	}
	return res ; 
}

std::vector<int> construct_range(int M, int K) {
  return {1, 1, 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...