Codeforces Round #687 (based on Technocup 2021 Elimination Round 2) DIV1 B問題 (1000pt)
Codeforces Round #687 (based on Technocup 2021 Elimination Round 2) DIV2 D問題 (2000pt)
Technocup 2021 - Elimination Round 2 D問題 (2000pt)
Problem description
省略
省略
C++に変換後のコードはこちら
//no-unlocked
int N, A[1d5];
int sm[1d5+1];
{
int res = int_inf;
rd(N,A(N));
rep(i,1,N-1) if(A[i-1] > (A[i]^A[i+1])) wt(1), return 0;
rep(i,1,N-1) if((A[i-1]^A[i]) > A[i+1]) wt(1), return 0;
rep(i,N) sm[i+1] = sm[i] ^ A[i];
rep(i,N) rep(j,1,i+1) rep(k,1,N-i+1){
if((sm[i]^sm[i-j]) > (sm[i+k]^sm[i])) res <?= j + k - 2;
}
wt(if[res==int_inf, -1, res]);
}
Current time: 2024年04月20日06時55分52秒
Last modified: 2020年12月05日15時41分30秒 (by laycrs)
Tags: Competitive_Programming_Incomplete Codeforces CF687 CF_DIV1_B CF_DIV2_D
トップページに戻る
Logged in as: unknown user (not login)