oj.uz

Submission #161137

# Submission time Handle Problem Language Result Execution time Memory
161137 2019-10-31T19:15:03 Z errorgorn JOIOJI (JOI14_joioji) C++14
20 / 100
 1000 ms 6052 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;
class custom_hash{
    public:
        template <typename T, typename U>
        size_t operator()(const pair<T,U> &i)const{
            return std::hash<T>()(i.first) ^ std::hash<U>()(i.second);
        }
};
            unordered_map<ii,int,custom_hash> suffix;
            int arr[3];
            int pre[3];
            int main(){
                suffix.reserve(4096);
                suffix.max_load_factor(0.25);
                //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:39:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (int x=0;x<s.size();x++){
                              ~^~~~~~~~~
joioji.cpp:48:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (int x=0;x<s.size();x++){
                              ~^~~~~~~~~
joioji.cpp:27:22: 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 2 ms 504 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 388 KB Output is correct
13 Correct 2 ms 504 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 3 ms 508 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 10 ms 376 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 26 ms 504 KB Output is correct

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 632 KB Output is correct
2 Correct 22 ms 1644 KB Output is correct
3 Correct 34 ms 1828 KB Output is correct
4 Correct 52 ms 3044 KB Output is correct
5 Correct 118 ms 5796 KB Output is correct
6 Correct 241 ms 5924 KB Output is correct
7 Correct 175 ms 5928 KB Output is correct
8 Correct 221 ms 5924 KB Output is correct
9 Correct 272 ms 5924 KB Output is correct
10 Correct 229 ms 6052 KB Output is correct
11 Execution timed out 1077 ms 3320 KB Time limit exceeded
12 Halted 0 ms 0 KB -