Submission #1002808

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1002808	2024-06-19T19:53:28 Z	Cadoc	Difference (POI11_roz)	C++14	100 / 100	624 ms	21072 KB

/*
    Author: Cadocx
    Codeforces: https://codeforces.com/profile/Kadoc
    VNOJ: oj.vnoi.info/user/Cadoc
*/

#include <bits/stdc++.h>
using namespace std;

// input/output
#define fastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define el cout << '\n'
#define execute cerr << "Time elapsed: " << (1.0 * clock() / CLOCKS_PER_SEC) << "s"
// #pragma GCC optimize("O2", "unroll-loops", "Ofast")
// #pragma GCC target("avx,avx2,fma")
//data type
#define int128 __uint128_t
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define piv pair<int, vector<int>>
#define vi vector<int>
#define vl vector<ll>
#define vc vector<char>
//STL
#define sz(x) (int)(x).size()
#define for1(i,l,r) for(auto i = l; i <= r; i++)
#define for2(i,r,l) for(auto i = r; i >= l; i--)
#define forin(i,a) for(auto i : a)
#define pb push_back
#define eb emplace_back
#define pf push_front
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
//bitmask
#define bitcnt(n) __builtin_popcount(n)
#define mask(i) (1 << (i))
#define bit(n, i) (((n) >> (i)) & 1)
#define set_on(n, i) ((n) | mask(i))
#define set_off(n, i) ((n) & ~mask(i))
//constant
#define N 1000005
#define MOD 1000230007
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define base 31
#define Kadoc 0

int n;
vector<int> pos[32];
ll ans = 0, Min[N];

void calc(int x, int y){
    if(x == y || !pos[x].size() || !pos[y].size()) return;

    vector<int> a; a.pb(0);
    for(int i=0, j=0; i<sz(pos[x]) || j<sz(pos[y]);){
        if(j == sz(pos[y]) || (i < sz(pos[x]) && pos[x][i] <= pos[y][j])){
            a.pb(1);
            i++;
        }
        else{
            a.pb(-1);
            j++;
        }
    }

    int last = -1, m = sz(a)-1;
    ll s = 0;
    for(int i=1; i<=m; ++i){
        s += a[i];
        Min[i] = min(Min[i-1], s);
        if(a[i] == -1) last = i;
        if(last != -1) ans = max(ans, s - Min[last-1]);
    }
}

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

    for(int i=1; i<=26; ++i) for(int j=1; j<=26; ++j) calc(i, j);

    cout << ans;
}

int main(){
    #define NAME "TASK"
    if(fopen(NAME".inp", "r")){
        freopen(NAME".inp", "r", stdin);
        freopen(NAME".out", "w", stdout);
    }

    fastIO;
    
    if(Kadoc){
        int tc; cin >> tc;
        while(tc--){
            solve();
        }
    } else solve();
}

Compilation message

roz.cpp: In function 'int main()':
roz.cpp:95:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   95 |         freopen(NAME".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
roz.cpp:96:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   96 |         freopen(NAME".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	600 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	468 KB	Output is correct
3	Correct	348 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	496 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	476 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct

Subtask #6
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	58 ms	1116 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	4 ms	612 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	605 ms	7116 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	363 ms	6340 KB	Output is correct

Subtask #8
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	624 ms	7276 KB	Output is correct
2	Correct	499 ms	5816 KB	Output is correct
3	Correct	183 ms	7476 KB	Output is correct

Subtask #9
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	559 ms	7440 KB	Output is correct
2	Correct	88 ms	17300 KB	Output is correct
3	Correct	160 ms	9084 KB	Output is correct

Subtask #10
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	601 ms	7216 KB	Output is correct
2	Correct	47 ms	21072 KB	Output is correct
3	Correct	193 ms	8424 KB	Output is correct