oj.uz

답안 #596904

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
596904 2022-07-15T09:08:36 Z jy0n 원형 문자열 (IZhO13_rowords) C++17
76 / 100
 108 ms 292 KB 
#include <bits/stdc++.h>
using namespace std;
using ull=unsigned long long;

const int Sigma= 26;
string A, B;
vector<ull> d, s[Sigma];

#define set_bit(bs, i) (bs[i>>6] |= 1llu << (i&63))
#define get_bit(bs, i) ((bs[i>>6] >> (i&63))&1)
#define sub(a, b) ((a-b>a)? (a-=b, 1) : (a-=b, 0))

int main() {
    cin >> A >> B;
    int n = (int)A.size(), m = (int)B.size(), l = (m>>6)+1, ans=0;
    d.resize(l);
    for (int i=0; i<Sigma; ++i) s[i].resize(l);
    for (int i=0; i<m; ++i) set_bit(s[B[i]-'a'], i);
    for (int k=0; k<n; ++k) {
        memset(&d[0], 0, sizeof(ull)*l);
        for (int i=0; i<m; ++i) if (A[k] == B[i]) { set_bit(d, i); break; }
        for (int i=1; i<n; ++i) {
            ull sc = 1, mc = 0;
            for (int j=0; j<l; ++j) {
                ull x = s[A[(k+i)%n]-'a'][j]|d[j];
                ull t = (d[j] << 1)|sc;
                sc = d[j] >> 63;
                ull tt = x;
                mc = sub(tt, mc) + sub(tt, t);
                d[j] = x&(x^tt);
            }
        }
        int ret = 0;
        for (int i=0; i<m; ++i) ret += get_bit(d, i);
        ans=max(ans, ret);
    }
    cout << ans << endl;
}

Compilation message

rowords.cpp: In function 'int main()':
rowords.cpp:11:31: warning: operation on 'tt' may be undefined [-Wsequence-point]
   11 | #define sub(a, b) ((a-b>a)? (a-=b, 1) : (a-=b, 0))
......
   29 |                 mc = sub(tt, mc) + sub(tt, t);
      |                          ~~~~~~
rowords.cpp:29:22: note: in expansion of macro 'sub'
   29 |                 mc = sub(tt, mc) + sub(tt, t);
      |                      ^~~

Subtask #1
76.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 9 ms 212 KB Output is correct
7 Correct 56 ms 284 KB Output is correct
8 Incorrect 66 ms 284 KB Output isn't correct
9 Correct 53 ms 280 KB Output is correct
10 Correct 53 ms 212 KB Output is correct
11 Correct 73 ms 280 KB Output is correct
12 Correct 92 ms 280 KB Output is correct
13 Correct 77 ms 280 KB Output is correct
14 Correct 71 ms 280 KB Output is correct
15 Correct 89 ms 212 KB Output is correct
16 Correct 59 ms 280 KB Output is correct
17 Incorrect 71 ms 280 KB Output isn't correct
18 Correct 96 ms 284 KB Output is correct
19 Correct 52 ms 288 KB Output is correct
20 Incorrect 81 ms 292 KB Output isn't correct
21 Correct 39 ms 212 KB Output is correct
22 Correct 72 ms 276 KB Output is correct
23 Correct 93 ms 280 KB Output is correct
24 Incorrect 82 ms 276 KB Output isn't correct
25 Incorrect 108 ms 284 KB Output isn't correct