oj.uz

Submission #245001

# Submission time Handle Problem Language Result Execution time Memory
245001 2020-07-05T10:51:43 Z VEGAnn Rima (COCI17_rima) C++14
14 / 140
 260 ms 22108 KB 
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define sz(x) ((int)x.size())
using namespace std;
const int N = 500100;
const int NN = 18;
string s[N];
int n, ans = 0;
bool mem[NN][NN], f[(1 << NN)][NN];

bool ok(int i, int j){
    int ned = max(sz(s[i]), sz(s[j])) - 1;

    int lf = 0;

    while (lf < min(sz(s[i]), sz(s[j])) && s[i][lf] == s[j][lf])
        lf++;

    return bool(lf >= ned);
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

#ifdef _LOCAL
    freopen("in.txt","r",stdin);
#endif // _LOCAL

    cin >> n;

    for (int i = 0; i < n; i++){
        cin >> s[i];

        reverse(all(s[i]));
    }

    if (n <= 18){
        for (int i = 0; i < n; i++)
        for (int j = i + 1; j < n; j++)
            mem[i][j] = mem[j][i] = ok(i, j);

        for (int i = 0; i < n; i++)
            f[(1 << i)][i] = 1;

        for (int msk = 1; msk < (1 << n); msk++)
        for (int lst = 0; lst < n; lst++){
            if (!f[msk][lst]) continue;

            int cnt = __builtin_popcount(msk);

            ans = max(ans, cnt);

            for (int i = 0; i < n; i++)
                if (!(msk & (1 << i)) && ok[lst][i])
                    f[msk + (1 << i)][i] = 1;
        }

        cout << ans;

        return 0;
    }

    sort(s, s + n);

    for (int i = 0; i < n; ){
        int j = i + 1;

        while (j < n && ok(j - 1, j))
            j++;

        ans = max(ans, j - i);

        i = j;
    }

    cout << ans;

    return 0;
}

Compilation message

rima.cpp: In function 'int main()':
rima.cpp:54:48: warning: pointer to a function used in arithmetic [-Wpointer-arith]
                 if (!(msk & (1 << i)) && ok[lst][i])
                                                ^
rima.cpp:54:51: warning: pointer to a function used in arithmetic [-Wpointer-arith]
                 if (!(msk & (1 << i)) && ok[lst][i])
                                                   ^

Subtask #1
14.0 / 140.0

# Verdict Execution time Memory Grader output
1 Incorrect 45 ms 17152 KB Output isn't correct
2 Incorrect 151 ms 20600 KB Output isn't correct
3 Incorrect 155 ms 20600 KB Output isn't correct
4 Incorrect 260 ms 18680 KB Output isn't correct
5 Correct 25 ms 21760 KB Output is correct
6 Incorrect 17 ms 17304 KB Output isn't correct
7 Incorrect 16 ms 17060 KB Output isn't correct
8 Incorrect 16 ms 16880 KB Output isn't correct
9 Incorrect 35 ms 22108 KB Output isn't correct
10 Incorrect 16 ms 17092 KB Output isn't correct