oj.uz

Submission #871659

# Submission time Handle Problem Language Result Execution time Memory
871659 2023-11-11T08:42:24 Z vjudge1 Difference (POI11_roz) C++17
60 / 100
 1000 ms 11716 KB 
#include "bits/stdc++.h"
#define ii pair <int, int>
#define F first
#define S second
using namespace std;
const int N = 1e6+5;
int n;
char a[N];
int sum[N];
int pre[N];
vector <int> save[30];
int Get(int i, int j) {
    return sum[j] - sum[i-1];
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin >> n;
    for (int i = 1 ; i <= n ; i++) {
        cin >> a[i];
        save[a[i]-'a'].push_back(i);
    }
    int res = 0;
    for (int c1 = 0 ; c1 < 26 ; c1++)
        for (int c2 = 0 ; c2 < 26 ; c2++) {
            if (c1 == c2) continue;
            vector <ii> pos;
            pos.push_back(ii(0, 0));
            for (int i : save[c1]) pos.push_back(ii(i, 1));
            for (int i : save[c2]) pos.push_back(ii(i, -1));
            sort(pos.begin(), pos.end());
            int cur = 0;
            for (int i = 1 ; i < pos.size() ; i++) {
                int l = 1, r = i, ans = 0;
                cur += pos[i].S;
                sum[i] = sum[i-1] + (pos[i].S == -1) ;
                while(l <= r) {
                    int mid = (l + r) / 2;
                    if (Get(mid, i)) {
                        ans = mid;
                        l = mid + 1;
                    }
                    else r = mid - 1;
                }
                if (ans) res = max(res, cur-pre[ans-1]);
                pre[i] = min(cur, pre[i-1]);
            }
        }
    cout << res;
    return 0;
}

Compilation message

roz.cpp: In function 'int main()':
roz.cpp:33:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |             for (int i = 1 ; i < pos.size() ; i++) {
      |                              ~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2560 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 332 ms 3188 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 42 ms 2448 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1103 ms 11496 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 1074 ms 11584 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 1050 ms 11716 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 1047 ms 11516 KB Time limit exceeded
2 Halted 0 ms 0 KB -