oj.uz

Submission #483744

# Submission time Handle Problem Language Result Execution time Memory
483744 2021-11-01T02:15:40 Z kawaii Peru (RMI20_peru) C++14
0 / 100
 1 ms 468 KB 
#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){
    for(int i = 0; i <= n; i++){
        for(int j = 1; (1 << j) <= n; j++){
            mx[i][j] = max(mx[i][j - 1], mx[i + (1 << (j - 1))][j - 1]);
        }
    } 
    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.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -