제출 #1307013

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1307013		MunkhErdene	3개의 봉우리 (IOI25_triples)	C++17	0.51 / 100	13 ms	3144 KiB

triples

#include "triples.h"
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<int, pii> pi3;
typedef pair<ll, int> pli;
typedef vector<int> vi;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define SZ(x) ((int)x.size())
#define kill(x) return cout<<x<<'\n', 0;
#define getbit(x,y) (((x)>>(y))&1)
#define popcount(x) (__builtin_popcount(x))
 
const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=998244353;
const int MAXN=50010;
 
int n, m, k;
int f[MAXN];
int g[MAXN];
int cnt[MAXN];
vector<pair<pii, int>> pairs;
vector<int> vec[MAXN];
bitset<MAXN> L[MAXN*2], R[MAXN*2];
 
int check231(int i, int j, int k, vi &h){
    return (h[i] == k-j && h[j] == k-i && h[k] == j-i);
}
 
ll count_triples(vi h) {
    return 0ll;
}
 
vi construct_range(int M, int K) {
    return {4, 1, 4, 3, 2, 6, 1};
}

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