제출 #1252379

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1252379		chr34	3개의 봉우리 (IOI25_triples)	C++20	6 / 100	530 ms	1984 KiB

triples

#include <bits/stdc++.h>
 
using namespace std;
 
//#define int long long
#define endl "\n"
#define dbg(x) cout << #x << " = " << (x) << endl;
const long long INF = 1e18;
const int MAXN = 1e6 + 10;
const int MOD = 1e9 + 7;
 
bool match(vector<int> a, vector<int> b){
	sort(a.begin(), a.end());
	sort(b.begin(), b.end());
	
	for(int i = 0; i < 3; ++i) if(a[i] != b[i]) return false;
	
	return true;
}
 
long long count_triples(vector<int> h){
	int n = h.size();
	int ans = 0;
	
	
	for(int a = 1; a <= 10; ++a){
		for(int b = 1; b <= 10; ++b){
			int c = a + b;
			if(c > 10) continue;
			vector<int> expected = {a, b, c};
			
			for(int j = a; j + b < n; ++j){
				int i = j - a;
				int k = j + b;
				
				vector<int> heights = {h[i], h[j], h[k]};
				
				if(match(heights, expected)) ans++;
			} 
		}
	}
	
	return ans;
}
 
vector<int> construct_range(int m, int k){
	return {};
}
 
/*int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	//freopen("input.in", "r", stdin);
	//freopen("input.out", "w", stdout);    
	cout<<count_triples({4, 1, 4, 3, 2, 6, 1});
    return 0;
}*/

• Subtask 0: 0 / 0
• Subtask 1: 0 / 8
• Subtask 2: 6 / 6
• Subtask 3: 0 / 10
• Subtask 4: 0 / 11
• Subtask 5: 0 / 16
• Subtask 6: 0 / 19
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5