제출 #596915

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
596915		jy0n	Round words (IZhO13_rowords)	C++17	68 / 100	206 ms	296 KiB

rowords

#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);
    }
    for (int i=0; i<Sigma; ++i) memset(&s[i][0], 0, sizeof(ull)*l);
    for (int i=m-1; i>=0; --i) set_bit(s[B[i]-'a'], m-1-i);
    for (int k=0; k<n; ++k) {
        memset(&d[0], 0, sizeof(ull)*l);
        for (int i=m-1; i>=0; --i) if (A[k] == B[i]) { set_bit(d, m-1-i); break; }
        for (int i=n-1; i>=0; --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=m-1; i>=0; --i) ret += get_bit(d, m-1-i);
        ans=max(ans, ret);
    }
    cout << ans << endl;
}

컴파일 시 표준 에러 (stderr) 메시지

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);
      |                      ^~~
rowords.cpp:38:56: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   38 |     for (int i=m-1; i>=0; --i) set_bit(s[B[i]-'a'], m-1-i);
      |                                                     ~~~^~
rowords.cpp:9:28: note: in definition of macro 'set_bit'
    9 | #define set_bit(bs, i) (bs[i>>6] |= 1llu << (i&63))
      |                            ^
rowords.cpp:38:56: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   38 |     for (int i=m-1; i>=0; --i) set_bit(s[B[i]-'a'], m-1-i);
      |                                                     ~~~^~
rowords.cpp:9:46: note: in definition of macro 'set_bit'
    9 | #define set_bit(bs, i) (bs[i>>6] |= 1llu << (i&63))
      |                                              ^
rowords.cpp:41:70: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   41 |         for (int i=m-1; i>=0; --i) if (A[k] == B[i]) { set_bit(d, m-1-i); break; }
      |                                                                   ~~~^~
rowords.cpp:9:28: note: in definition of macro 'set_bit'
    9 | #define set_bit(bs, i) (bs[i>>6] |= 1llu << (i&63))
      |                            ^
rowords.cpp:41:70: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   41 |         for (int i=m-1; i>=0; --i) if (A[k] == B[i]) { set_bit(d, m-1-i); break; }
      |                                                                   ~~~^~
rowords.cpp:9:46: note: in definition of macro 'set_bit'
    9 | #define set_bit(bs, i) (bs[i>>6] |= 1llu << (i&63))
      |                                              ^
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))
......
   49 |                 mc = sub(tt, mc) + sub(tt, t);
      |                          ~~~~~~
rowords.cpp:49:22: note: in expansion of macro 'sub'
   49 |                 mc = sub(tt, mc) + sub(tt, t);
      |                      ^~~
rowords.cpp:54:57: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   54 |         for (int i=m-1; i>=0; --i) ret += get_bit(d, m-1-i);
      |                                                      ~~~^~
rowords.cpp:10:29: note: in definition of macro 'get_bit'
   10 | #define get_bit(bs, i) ((bs[i>>6] >> (i&63))&1)
      |                             ^
rowords.cpp:54:57: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   54 |         for (int i=m-1; i>=0; --i) ret += get_bit(d, m-1-i);
      |                                                      ~~~^~
rowords.cpp:10:39: note: in definition of macro 'get_bit'
   10 | #define get_bit(bs, i) ((bs[i>>6] >> (i&63))&1)
      |                                       ^

• Subtask 1: 68 / 100