oj.uz

Submission #761444

# Submission time Handle Problem Language Result Execution time Memory
761444 2023-06-19T16:18:33 Z ksu2009en Brperm (RMI20_brperm) C++17
13 / 100
 96 ms 37056 KB 
#include "brperm.h"
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <cstring>
#include <unordered_map>

using namespace std;
typedef long long ll;

ll inv(ll n, ll sz){
    if(sz == 0)
        return 0;
    
    string a;
    
    for(int i = sz - 1; i >= 0; i--){
        if((n >> i) % 2 != 0)
            a += "1";
        else
            a += "0";
    }
        
    reverse(a.begin(), a.end());
    
    ll n2 = 0, j = 0;
    
    for(int i = sz - 1; i >= 0; i--){
        if(a[j] == '1')
            n2 += (1 << i);
        
        j++;
    }
    
    return n2;
}

vector<pair<ll, ll>> d[18];
string a;
ll mp[100007][20];


void init(int n, const char s[]) {
    for(int sz = 0; sz <= 17; sz++){
        for(int i = 0; i < (1 << sz); i++){
            if(inv(i, sz) > i){
                d[sz].push_back({i, inv(i, sz)});
            }
        }
        
        for(int i = 0; i <= n; i++)
            mp[i][sz] = -1;
    }
    
    for(int i = 0; i < n; i++)
        a.push_back(s[i]);
    
    return;
}


int query(int l, int k) {
    for(int i = 0; i < (1 << k); i++)
        if(a[l + i] != a[l + inv(i, k)])
            return 0;
    
    return 1;
}
/*
 ykkubxafnylfriivjjqphltuagfkfcoigfcukuisdgufezomndodalbusgesraatkgnskdsiedfysodmsemmtjuoiezoaqljdodegogedjfpfwntljpgdhswtmqtwtpnbaawfumskuiwjodtsrlhblpunzqjkrzaakamjzyumkzfdjxwdkadgbwffjmldsfbhaltfnykbmvnxdkpfzsswpnmyyqpalsalaeqmqqivzqyhjgiiwfugmpxxsmkkgecuvrnlkujbyllhecpjsneluvsyckueeexhbtuhikfzuvwlfbeatpvvkwbuhvlmzuavlqauhnmjphsvkfuheoufonvpaexkcocsxuhucvofavrsoguyouabgocprmmtacdcuzddctoyvomxudzogdcyomtrsxttbydtyoctprydhunhaksxzayugpxaknqpbaczjkbgjbqybqcxqcklxzmxvmhnmjiphgfgzbjcmhgfxcptnfggtncdokdejtieklevpwyqysdwwyseqewvgsijsahpamatbbpytjmjbjrjckblzanlgklnkupofhykyfywplzzgxaagyilppybzbvaikutapuzykwmlqbeybpdxbkkpjkyzeaelkzhadthbymlxransdokuqxggxagkpzxqqixeirkaciiwhzczkiedwgaezargziiaimyntocxsrcvzzwrwmitpsgncjefhorfjmjbursjzwamvtdoatgrjjzcnzujsafhsvvuwjceuaxjvgjrfdjsczksotkdjzhqbvrnqqgfpxehuvastysoexlbtesugqkuhspsrfhwibzbdngsxondjhjbcuzwthikhahgvgthklxjwrhphsmnfexzbsczubhhtthxrpkiitbccqvrrefjbuwdcgutjbnbiomhdhdbhyhabmhmyrhjtpqyrxluxqksoqxlglocutuwlwsicxqwliqxtgixlscgomqaasnegaznezyvlk
 665 1
 */

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 2736 KB Output is correct
2 Correct 61 ms 2696 KB Output is correct

Subtask #2
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 2736 KB Output is correct
2 Correct 61 ms 2696 KB Output is correct
3 Runtime error 96 ms 37056 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 20 ms 33108 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 2736 KB Output is correct
2 Correct 61 ms 2696 KB Output is correct
3 Runtime error 96 ms 37056 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -