oj.uz

Submission #871666

# Submission time Handle Problem Language Result Execution time Memory
871666 2023-11-11T08:48:55 Z vjudge1 Difference (POI11_roz) C++17
10 / 100
 1000 ms 11220 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;

const int maxn = 1e6+55;
const int inf = 1e9+55;

typedef pair <int,int> pii;

int a[maxn], b[maxn];
int cnt[maxn], n;
int pref[maxn], cntPref[maxn];

int brute()
{
    int best = 0;
    for (int i = 1; i <= n; i ++)
    {
        multiset <int> st;
        for (int c = 0; c < 26; c ++) cnt[c] = 0;

        int mx = 0;
        for (int j = i; j <= n; j ++)
        {
            int c = a[j];
            if (st.find(cnt[c]) != st.end()) st.erase(st.find(cnt[c]));
            cnt[c] ++;
            st.insert(cnt[c]);

            int delta = abs(*(st.begin()) - *(--st.end()));
            best = max(best, delta);
        }
    }

    return best;
}

int cal(int c1, int c2)
{
    vector <int> rem;
    rem.push_back(0);
    for (int i = 1; i <= n; i ++)
    {
        if (a[i] == c1)
            rem.push_back(1);
        else if (a[i] == c2)
            rem.push_back(-1);
    }

    int m = rem.size() - 1;
    for (int i = 1; i <= m; i ++) cntPref[i] = cntPref[i-1] + (rem[i] == -1);
    for (int i = 1; i <= m; i ++) pref[i] = pref[i-1] + rem[i];

    int j = 0, mn = inf, best = 0;
    for (int i = 1; i <= m; i ++)
    {
        while (j < i && cntPref[i] - cntPref[j-1] > 0)
        {
            mn = min(mn, pref[j]);
            j ++;
        }
        best = max(best, pref[i] - mn);
    }
    return best;
}

void process()
{
    cin >> n;
    for (int i = 1; i <= n; i ++)
    {
        char x;
        cin >> x;
        a[i] = x - 'a';
    }

    int best = 0;
    for (int c1 = 0; c1 < 26; c1 ++) for (int c2 = 0; c2 < 26; c2 ++) if (c1 != c2)
    {
        best = max(best, cal(c1, c2));
//        cout << c1 << " " << c2 << " " << best << endl;
    }
//    cout << brute() << endl;
    cout << best;
}

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

    int ntest = 1;
    while (ntest --) process();

    return 0;
}

Compilation message

roz.cpp: In function 'int brute()':
roz.cpp:23:13: warning: unused variable 'mx' [-Wunused-variable]
   23 |         int mx = 0;
      |             ^~

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Incorrect 1 ms 4440 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Incorrect 1 ms 4444 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4696 KB Output is correct
2 Incorrect 1 ms 4444 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 4592 KB Output is correct
2 Incorrect 1 ms 4444 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 170 ms 4696 KB Output is correct
2 Incorrect 1 ms 4444 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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