oj.uz

Submission #1012452

# Submission time Handle Problem Language Result Execution time Memory
1012452 2024-07-02T07:45:48 Z m5588ohammed Difference (POI11_roz) C++14
30 / 100
 503 ms 24020 KB 
/******************************************************************************

Welcome to GDB Online.
GDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,
C#, OCaml, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.
Code, Compile, Run and Debug online from anywhere in world.

*******************************************************************************/
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
int fre[500];
vector <int> v[500],arr;
int pre[2000000];
void construct(int a,int b){
    int i=0,j=0;
    arr.clear();
    while(i!=v[a].size()||j!=v[b].size()){
        if(i==v[a].size()){
            arr.push_back(-1);
            j++;
        }
        else if(j==v[b].size()){
            arr.push_back(1);
            i++;
        }
        else if(v[b][j]>v[a][i]){
            arr.push_back(1);
            i++;
        }
        else{
            arr.push_back(-1);
            j++;    
        } 
    }
    return;
}
int calc(){
    int n=arr.size(),st=0,mn=1e9,ans=0;
    pre[0]=arr[0];
    for(int i=1;i<n;i++) pre[i]=pre[i-1]+arr[i];
    
    for(int i=0;i<n;i++){
        if(arr[i]==-1){
            for(int j=st;j<i;j++) mn=min(mn,pre[j]);
            st=i;
        }
        ans=max(ans,pre[i]-mn);
    }
    return ans;
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n,ans=1;
    cin>>n;
    string s;
    cin>>s;
    for(int i=0;i<s.size();i++) v[s[i]].push_back(i);
    for(int c1='a';c1<='z';c1++){
        for(int c2='a';c2<='z';c2++){
            if(c1==c2) continue;
            construct(c1,c2);
            ans=max(ans,calc());
        }
    }
    cout<<ans<<endl;
    return 0;
}

Compilation message

roz.cpp: In function 'void construct(long long int, long long int)':
roz.cpp:19:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     while(i!=v[a].size()||j!=v[b].size()){
      |           ~^~~~~~~~~~~~~
roz.cpp:19:28: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     while(i!=v[a].size()||j!=v[b].size()){
      |                           ~^~~~~~~~~~~~~
roz.cpp:20:13: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |         if(i==v[a].size()){
      |            ~^~~~~~~~~~~~~
roz.cpp:24:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |         else if(j==v[b].size()){
      |                 ~^~~~~~~~~~~~~
roz.cpp: In function 'int main()':
roz.cpp:62:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |     for(int i=0;i<s.size();i++) v[s[i]].push_back(i);
      |                 ~^~~~~~~~~
roz.cpp:62:39: warning: array subscript has type 'char' [-Wchar-subscripts]
   62 |     for(int i=0;i<s.size();i++) v[s[i]].push_back(i);
      |                                       ^

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Runtime error 1 ms 604 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Runtime error 1 ms 604 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 600 KB Output is correct
2 Runtime error 1 ms 604 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 1624 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 4 ms 600 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 492 ms 15860 KB Output is correct
2 Runtime error 1 ms 604 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 490 ms 15856 KB Output is correct
2 Correct 369 ms 14836 KB Output is correct
3 Correct 127 ms 11548 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 480 ms 15608 KB Output is correct
2 Correct 164 ms 24020 KB Output is correct
3 Runtime error 15 ms 18708 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 503 ms 15988 KB Output is correct
2 Runtime error 17 ms 20196 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -