oj.uz

Submission #120143

# Submission time Handle Problem Language Result Execution time Memory
120143 2019-06-23T14:46:52 Z errorgorn JOIOJI (JOI14_joioji) C++14
20 / 100
 1000 ms 4536 KB 
#include <cstdio>
#include <unordered_map>
#include <utility>
#include <string>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
typedef pair<int,int> ii;
int n;
char c;
string s;
struct custom_hash{
    size_t operator()(const pair<int,int> &i)const{
        return i.first^i.second;
    }
};
unordered_map<ii,int,custom_hash> suffix;
int arr[3];
int pre[3];
int main(){
    //freopen("input.txt","r",stdin);
    scanf("%d",&n);
    getchar();
    c=getchar();
    while (c!='\n'){
        s+=c;
        if (c=='J') arr[0]++;
        else if (c=='O') arr[1]++;
        else arr[2]++;
        c=getchar();
    }
    suffix[ii(0,0)]=0;
    for (int x=0;x<3;x++) pre[x]=arr[x];
    for (int x=0;x<s.size();x++){
        if (s[x]=='J') pre[0]--;
        else if (s[x]=='O') pre[1]--;
        else pre[2]--;
        suffix[ii(pre[0]-pre[1],pre[0]-pre[2])]=x+1;
    }
    memset(pre,0,sizeof(pre));
    int ans=0;
    int a=arr[0]-arr[1],b=arr[0]-arr[2];
    for (int x=0;x<s.size();x++){
        ans=max(ans,suffix[ii(a-(pre[0]-pre[1]),b-(pre[0]-pre[2]))]-x);
        if (s[x]=='J') pre[0]++;
        else if (s[x]=='O') pre[1]++;
        else pre[2]++;
    }
    printf("%d\n",ans);
}

Compilation message

joioji.cpp: In function 'int main()':
joioji.cpp:35:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int x=0;x<s.size();x++){
                  ~^~~~~~~~~
joioji.cpp:44:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int x=0;x<s.size();x++){
                  ~^~~~~~~~~
joioji.cpp:23:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 10 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 384 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 9 ms 384 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 7 ms 384 KB Output is correct
10 Correct 33 ms 384 KB Output is correct

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 484 KB Output is correct
2 Correct 20 ms 1024 KB Output is correct
3 Correct 20 ms 1408 KB Output is correct
4 Correct 46 ms 2320 KB Output is correct
5 Correct 105 ms 3224 KB Output is correct
6 Correct 196 ms 3384 KB Output is correct
7 Correct 151 ms 4536 KB Output is correct
8 Correct 198 ms 3288 KB Output is correct
9 Correct 203 ms 3516 KB Output is correct
10 Correct 191 ms 3256 KB Output is correct
11 Execution timed out 1081 ms 2616 KB Time limit exceeded
12 Halted 0 ms 0 KB -