結果

問題 No.563 超高速一人かるた large
コンテスト
ユーザー mai
提出日時 2017-08-26 00:13:22
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 4,401 bytes
コンパイル時間 14,913 ms
コンパイル使用メモリ 291,116 KB
最終ジャッジ日時 2025-01-05 02:31:14
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample WA * 3
other WA * 1 RE * 17
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In member function '{anonymous}::MaiScanner& {anonymous}::MaiScanner::operator>>(std::string&)':
main.cpp:68:9: warning: no return statement in function returning non-void [-Wreturn-type]
   68 |         }
      |         ^

ソースコード

diff # 

#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=0ll;cnt<(l);++cnt)
#define iterate(cnt,b,e) for(auto cnt=(b);cnt!=(e);++cnt)
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
template<typename iterator> inline size_t argmin(iterator begin, iterator end) {
    return distance(begin, min_element(begin, end));
}
template<typename iterator> inline size_t argmax(iterator begin, iterator end) {
    return distance(begin, max_element(begin, end));
}
template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> T& minset(T& to, const T& val) { return to = min(to, val); }

mt19937_64 randdev(8901016);
inline ll rand_range(ll l, ll h) {
    return uniform_int_distribution<ll>(l, h)(randdev);
}

#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0;
            T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) {
            input_integer<int>(var);
            return *this;
        }
        inline MaiScanner& operator>>(long long& var) {
            input_integer<long long>(var);
            return *this;
        }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
        }
        template<typename IT> void in(IT begin, IT end) {
            for (auto it = begin; it != end; ++it) *this >> *it;
        }
    };
}
MaiScanner scanner;

ll m, n, kei;

string str[25];

int aa[25][25];

ll result[25];

int main() {

    // にゃーん
    scanner >> n;

    repeat(i, n) {
        cin >> str[i];
    }

    sort(str, str + n);

    repeat(i, n-1) {
        iterate(j, i + 1, n) {
            ll l = 0;
            while (str[i][l] == str[j][l])
                ++l;
            ++l;
            //printf("%d<=>%d cp:%d \n",i,j,l);
            //cout << str[i] << " " << str[j] << endl;
            aa[i + 1][j + 1] = l;
            aa[j + 1][i + 1] = l;
        }
    }
    //debugaa(aa,4,4);

    //repeat(line, n)
    {
        for (ll bit = 0; bit < (1 << n)-1; ++bit) {
            ll sm = 0;
            ll bc = __builtin_popcountll(bit);
            ll prev = -1;
            ll curr = 0;
            ll next = -1;
            do { ++next; } while (next < n && ((1 << next)&bit));
            curr = next;
            do { ++next; } while (next < n && ((1 << next)&bit));
            for (;curr < n;) {
                //if (bc == 2)
                    //printf("%d %d %d\n",prev,curr,next);
                sm = (sm + max(aa[curr+1][next+1], aa[curr+1][prev+1])) % MD;
                prev = curr;
                curr = next;
                do { ++next; } while (next < n && ((1 << next)&bit));
            }
            result[bc] = (result[bc] + sm)%MD;
        }
    }
    
    repeat(i, n){
        cout << result[i] << endl;
        result[i+1] = (result[i]*(n-1) + result[i+1])%MD;
    }


    return 0;
}
0