oj.uz

Submission #253661

# Submission time Handle Problem Language Result Execution time Memory
253661 2020-07-28T13:51:47 Z Vimmer Savez (COCI15_savez) C++14
96 / 120
 1000 ms 3520 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 1000050
#define M ll(998244353)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef short int si;
typedef array <ll, 3> a3;
typedef array <ll, 4> a4;

//typedef tree <ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


map <deque<char>, int> mp;

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;

    cin >> n;

    int ans = 0;

    for (int i = 0; i < n; i++)
    {
        string s;

        cin >> s;

        deque <char> l, r; l.clear(); r.clear();

        int val = 1;

        for (int j = 0; j < sz(s); j++)
        {
            l.pb(s[j]);

            r.pf(s[sz(s) - j - 1]);

            if (l == r) val = max(val, mp[l] + 1);
        }

        mp[l] = val;

        ans = max(ans, val);
    }

    cout << ans << endl;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 640 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 3 ms 512 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1086 ms 3520 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Execution timed out 1085 ms 1960 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 549 ms 1432 KB Output is correct
2 Correct 515 ms 1528 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 275 ms 1528 KB Output is correct
2 Correct 247 ms 1544 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 1400 KB Output is correct
2 Correct 161 ms 1400 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 1400 KB Output is correct
2 Correct 138 ms 1528 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 170 ms 1528 KB Output is correct
2 Correct 166 ms 1656 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 255 ms 1784 KB Output is correct
2 Correct 230 ms 1656 KB Output is correct
3 Correct 454 ms 2296 KB Output is correct