oj.uz

Submission #479073

# Submission time Handle Problem Language Result Execution time Memory
479073 2021-10-09T21:38:07 Z Green55 Round words (IZhO13_rowords) C++17
100 / 100
 303 ms 344 KB 
#include<bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
 
#define uint unsigned long long
#define ull unsigned __int128
 
const int LEN = 64;
const int MAX = 2205 + LEN;
 
inline bool at(uint a[], int i){
    return a[i/LEN] & ((uint)1 << (i%LEN));
}
 
inline bool tog(uint a[], int i) {
    return a[i/LEN] ^= ((uint)1 << (i%LEN));
}
 
int n;
uint a[MAX/LEN], b[MAX/LEN], cs[26][MAX/LEN];
 
void solve(uint c[]){
    //sliding b -> a
    memcpy(a, b, sizeof(b));
    memset(b, 0, sizeof(b));
    
    // b = (a << 1) | 1
    uint carry = 1;
    for(int i=0; i<n/LEN; ++i) {
        b[i] = (a[i] << 1) | carry;
        carry = bool(a[i] & ((uint)1<<(LEN-1)));
    }
 
    // b = -b = ~b + 1
    for(int i=0; i<n/LEN; ++i) b[i] = ~b[i];
    for(int i=0; i<n; ++i) if(tog(b, i)) break;
 
    // a |= c, b += a, b &= a, b ^= a
    carry = 0;
    for(int i=0; i<n/LEN; ++i) {
        a[i] |= c[i];
        ull tmp = b[i]; tmp += a[i]; tmp += carry;
        b[i] = tmp & (~(uint)0);
        carry = tmp >> LEN;
 
        b[i] &= a[i];
        b[i] ^= a[i];
    }
}

int solve_tc(string s, string t) {
    memset(a, 0, sizeof(a));
    memset(b, 0, sizeof(b));
    memset(cs, 0, sizeof(cs));
 
    // init c['A'] ~ c['Z']
    for(int i=0; i<t.size(); ++i) {
        tog(cs[t[i] - 'a'], i);
    }
    n = (t.size()/LEN+1)*LEN;
 
    for(int idx=0; idx<s.size(); ++idx) {
        char c = s[idx];
        solve(cs[c - 'a']);
    }
 
    int ret = 0;
    for(int i=0; i<n; ++i){
        ret += at(b, i);
    }
    return ret;
}
 
int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
 
    string a, b;
    cin >> a >> b;
    int ans = 0;
    for(int i=0; i<b.size(); ++i){
        ans = max(ans, solve_tc(a, b));
        b.push_back(b[0]);
        b.erase(b.begin());
    }
    reverse(all(b));
    for(int i=0; i<b.size(); ++i){
        ans = max(ans, solve_tc(a, b));
        b.push_back(b[0]);
        b.erase(b.begin());
    }
    cout << ans;
}

Compilation message

rowords.cpp: In function 'int solve_tc(std::string, std::string)':
rowords.cpp:57:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |     for(int i=0; i<t.size(); ++i) {
      |                  ~^~~~~~~~~
rowords.cpp:62:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |     for(int idx=0; idx<s.size(); ++idx) {
      |                    ~~~^~~~~~~~~
rowords.cpp: In function 'int main()':
rowords.cpp:80:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |     for(int i=0; i<b.size(); ++i){
      |                  ~^~~~~~~~~
rowords.cpp:86:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |     for(int i=0; i<b.size(); ++i){
      |                  ~^~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 12 ms 204 KB Output is correct
7 Correct 217 ms 300 KB Output is correct
8 Correct 226 ms 300 KB Output is correct
9 Correct 220 ms 304 KB Output is correct
10 Correct 215 ms 304 KB Output is correct
11 Correct 295 ms 204 KB Output is correct
12 Correct 288 ms 304 KB Output is correct
13 Correct 303 ms 304 KB Output is correct
14 Correct 241 ms 344 KB Output is correct
15 Correct 302 ms 312 KB Output is correct
16 Correct 252 ms 308 KB Output is correct
17 Correct 131 ms 300 KB Output is correct
18 Correct 259 ms 204 KB Output is correct
19 Correct 219 ms 304 KB Output is correct
20 Correct 271 ms 312 KB Output is correct
21 Correct 32 ms 204 KB Output is correct
22 Correct 57 ms 204 KB Output is correct
23 Correct 87 ms 204 KB Output is correct
24 Correct 104 ms 320 KB Output is correct
25 Correct 135 ms 204 KB Output is correct