Submission #483743

#	Time	Username	Problem	Language	Result	Execution time	Memory
483743		kawaii	Peru (RMI20_peru)	C++14	0 / 100	1 ms	340 KiB

peru

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma,bmi,bmi2")

#include <bits/stdc++.h>
using namespace std;
//define int long long

long long mod = 1e9 + 7, ans = 0;
int n, m, k, a[2500001], l2[2500001], mx[2500001][22];
deque<pair<int, int> > dq;

long long mul(long long x, long long y){
    if(y == 0) return 1;
    long long ans = mul(x, y / 2);
    if(y % 2 == 0) return (ans * ans) % mod;
    else return (((ans * ans) % mod) * x) % mod;
}

int solve(int n, int k, int* a){
    
    return ans;
}

// signed main(){
//     if (ifstream("text.txt"))
//     {
//         freopen("text.txt", "r", stdin);
//         #ifdef CHECKING
//             freopen(taskname".out", "w", stdout);
//         #else
//             //\freopen("text.out", "w", stdout);
//         #endif //CHECKING
//     }
//     //freopen("subsubset.inp", "r", stdin);
//     //freopen("subsubset.out", "w", stdout);
//     ios_base::sync_with_stdio(NULL); cin.tie(nullptr); cout.tie(nullptr);
//     cin >> n >> k;
//     for(int i = 1; i <= n; i++){
//         cin >> a[i];
//         if(i >= 2) l2[i] = l2[i / 2] + 1;
//         mx[i][0] = a[i];
//     }
//     cout << solve(n, k, a);
// }

• Subtask 1: 0 / 18
• Subtask 2: 0 / 31
• Subtask 3: 0 / 51