oj.uz

Submission #582204

# Submission time Handle Problem Language Result Execution time Memory
582204 2022-06-23T13:50:55 Z Soul234 Savez (COCI15_savez) C++14
120 / 120
 184 ms 2208 KB 
#include<bits/stdc++.h>
using namespace std;

void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << h; if(sizeof...(t)) cerr << ", ";
    DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL

#define FOR(i,a,b) for(int i = (a) ; i<(b) ; i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for(int i = (b)-1 ; i>=(a) ; i--)
#define R0F(i,a) ROF(i,0,a)
#define each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"

using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;

void setIO(string NAME = "") {
    cin.tie(0)->sync_with_stdio(0);
    if(sz(NAME)) {
        freopen((NAME + ".inp").c_str(),"r",stdin);
        freopen((NAME + ".out").c_str(),"w",stdout);
    }
}

tcT> bool ckmin(T&a, const T&b) {
    return b < a ? a=b,1 : 0; }
tcT> bool ckmax(T&a, const T&b) {
    return b > a ? a=b,1 : 0; }

const int MOD = 1e9 + 7;


using H = array<ll,2>;
const H BASE = {4441, 7817};

H operator+(const H&a, const H&b) {
    return {(a[0] + b[0])%MOD, (a[1] + b[1])%MOD};
}
H operator+(const H&a, const ll&b) {
    return {(a[0] + b)%MOD,(a[1] + b)%MOD};
}
H operator-(const H&a, const H&b) {
    return {(a[0] - b[0] + MOD)%MOD, (a[1]-b[1]+MOD)%MOD};
}
H operator*(const H&a, const H&b) {
    return {a[0]*b[0]%MOD, a[1]*b[1]%MOD};
}
H operator*(const H&a, const ll&b) {
    return {a[0]*b%MOD, a[1]*b%MOD};
}

map<array<H,2>, int> dp;
int N;

void solve() {
    cin>>N;
    int ans = 0;
    F0R(i,N) {
        str s;
        cin>>s;
        array<H,2> hsh = {0,0};
        int tmp = 1;
        F0R(i,sz(s)) {
            hsh[0] = hsh[0]*BASE + s[i];
            hsh[1] = hsh[1]*BASE + s[sz(s)-i-1];
            if(hsh[0] != hsh[1]) continue;
            if(dp.count(hsh)) ckmax(tmp, dp[hsh] + 1);
        }
        dp[hsh] = tmp;
        ckmax(ans, tmp);
    }
    cout << ans << nl;
}

int main() {
    setIO();

    int t=1;
    //cin>>t;
    while(t-->0) {
        solve();
    }

    return 0;
}

Compilation message

savez.cpp: In function 'void setIO(std::string)':
savez.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen((NAME + ".inp").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
savez.cpp:38:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |         freopen((NAME + ".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 2 ms 340 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 1228 KB Output is correct
2 Correct 42 ms 1228 KB Output is correct
3 Correct 86 ms 1344 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 340 KB Output is correct
2 Correct 87 ms 1292 KB Output is correct
3 Correct 88 ms 1224 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 1296 KB Output is correct
2 Correct 97 ms 1192 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 1296 KB Output is correct
2 Correct 98 ms 1192 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 1184 KB Output is correct
2 Correct 90 ms 1228 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 1316 KB Output is correct
2 Correct 87 ms 1352 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 1448 KB Output is correct
2 Correct 92 ms 1436 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 1568 KB Output is correct
2 Correct 124 ms 1564 KB Output is correct
3 Correct 184 ms 2208 KB Output is correct