oj.uz

Submission #336299

# Submission time Handle Problem Language Result Execution time Memory
336299 2020-12-15T03:55:39 Z beksultan04 Bigger segments (IZhO19_segments) C++14
13 / 100
 1378 ms 35308 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 823051  ,INF=1e9+7;
int q[N],ans,n,h4[N],dp[N];
vector <pii > v[N];
int rec(int j,int sum,int cnt){
    int i;
    if (j > n){
        ret cnt;
    }


    int x4 = cnt+(sum*41)%N+(j*41*41)%N;
    x4%=N;
    if (h4[x4]==1){
        ret dp[x4];
    }
    h4[x4] = 1;
    int mx=0;
    for (i=0;i<v[j].size();++i){
        if (v[j][i].fr >= sum){
            mx = max(mx,rec(v[j][i].sc+1,v[j][i].fr,cnt+1));
        }
    }
    ret dp[x4]=max(mx,dp[x4]);

}
main(){
    int i,j;
    scan1(n)
    for (i=0;i<N;++i)h4[i]=-1;
    for (i=1;i<=n;++i){
        scan1(q[i])
    }
    for (i=1;i<=n;++i){
        int sum=0;
        for (j=i;j<=n;++j){
            sum+=q[j];
            v[i].pb({sum,j});
        }
    }

    cout <<rec(1,0,0);;
}

Compilation message

segments.cpp: In function 'long long int rec(long long int, long long int, long long int)':
segments.cpp:33:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for (i=0;i<v[j].size();++i){
      |              ~^~~~~~~~~~~~
segments.cpp: At global scope:
segments.cpp:41:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   41 | main(){
      |      ^
segments.cpp: In function 'int main()':
segments.cpp:9:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    9 | #define scan1(a) scanf("%lld",&a);
      |                  ~~~~~^~~~~~~~~~~
segments.cpp:43:5: note: in expansion of macro 'scan1'
   43 |     scan1(n)
      |     ^~~~~
segments.cpp:9:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    9 | #define scan1(a) scanf("%lld",&a);
      |                  ~~~~~^~~~~~~~~~~
segments.cpp:46:9: note: in expansion of macro 'scan1'
   46 |         scan1(q[i])
      |         ^~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 26220 KB Output is correct
2 Correct 17 ms 26092 KB Output is correct
3 Correct 16 ms 26092 KB Output is correct
4 Correct 16 ms 26220 KB Output is correct
5 Correct 16 ms 26860 KB Output is correct
6 Correct 17 ms 26732 KB Output is correct
7 Correct 17 ms 26476 KB Output is correct
8 Correct 16 ms 26220 KB Output is correct
9 Correct 16 ms 26348 KB Output is correct
10 Correct 17 ms 26732 KB Output is correct
11 Correct 17 ms 26220 KB Output is correct
12 Correct 17 ms 26220 KB Output is correct
13 Correct 16 ms 26220 KB Output is correct
14 Correct 16 ms 26348 KB Output is correct
15 Correct 18 ms 26348 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 26220 KB Output is correct
2 Correct 17 ms 26092 KB Output is correct
3 Correct 16 ms 26092 KB Output is correct
4 Correct 16 ms 26220 KB Output is correct
5 Correct 16 ms 26860 KB Output is correct
6 Correct 17 ms 26732 KB Output is correct
7 Correct 17 ms 26476 KB Output is correct
8 Correct 16 ms 26220 KB Output is correct
9 Correct 16 ms 26348 KB Output is correct
10 Correct 17 ms 26732 KB Output is correct
11 Correct 17 ms 26220 KB Output is correct
12 Correct 17 ms 26220 KB Output is correct
13 Correct 16 ms 26220 KB Output is correct
14 Correct 16 ms 26348 KB Output is correct
15 Correct 18 ms 26348 KB Output is correct
16 Correct 21 ms 30700 KB Output is correct
17 Correct 371 ms 35180 KB Output is correct
18 Incorrect 1378 ms 35308 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 26220 KB Output is correct
2 Correct 17 ms 26092 KB Output is correct
3 Correct 16 ms 26092 KB Output is correct
4 Correct 16 ms 26220 KB Output is correct
5 Correct 16 ms 26860 KB Output is correct
6 Correct 17 ms 26732 KB Output is correct
7 Correct 17 ms 26476 KB Output is correct
8 Correct 16 ms 26220 KB Output is correct
9 Correct 16 ms 26348 KB Output is correct
10 Correct 17 ms 26732 KB Output is correct
11 Correct 17 ms 26220 KB Output is correct
12 Correct 17 ms 26220 KB Output is correct
13 Correct 16 ms 26220 KB Output is correct
14 Correct 16 ms 26348 KB Output is correct
15 Correct 18 ms 26348 KB Output is correct
16 Correct 21 ms 30700 KB Output is correct
17 Correct 371 ms 35180 KB Output is correct
18 Incorrect 1378 ms 35308 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 26220 KB Output is correct
2 Correct 17 ms 26092 KB Output is correct
3 Correct 16 ms 26092 KB Output is correct
4 Correct 16 ms 26220 KB Output is correct
5 Correct 16 ms 26860 KB Output is correct
6 Correct 17 ms 26732 KB Output is correct
7 Correct 17 ms 26476 KB Output is correct
8 Correct 16 ms 26220 KB Output is correct
9 Correct 16 ms 26348 KB Output is correct
10 Correct 17 ms 26732 KB Output is correct
11 Correct 17 ms 26220 KB Output is correct
12 Correct 17 ms 26220 KB Output is correct
13 Correct 16 ms 26220 KB Output is correct
14 Correct 16 ms 26348 KB Output is correct
15 Correct 18 ms 26348 KB Output is correct
16 Correct 21 ms 30700 KB Output is correct
17 Correct 371 ms 35180 KB Output is correct
18 Incorrect 1378 ms 35308 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 26220 KB Output is correct
2 Correct 17 ms 26092 KB Output is correct
3 Correct 16 ms 26092 KB Output is correct
4 Correct 16 ms 26220 KB Output is correct
5 Correct 16 ms 26860 KB Output is correct
6 Correct 17 ms 26732 KB Output is correct
7 Correct 17 ms 26476 KB Output is correct
8 Correct 16 ms 26220 KB Output is correct
9 Correct 16 ms 26348 KB Output is correct
10 Correct 17 ms 26732 KB Output is correct
11 Correct 17 ms 26220 KB Output is correct
12 Correct 17 ms 26220 KB Output is correct
13 Correct 16 ms 26220 KB Output is correct
14 Correct 16 ms 26348 KB Output is correct
15 Correct 18 ms 26348 KB Output is correct
16 Correct 21 ms 30700 KB Output is correct
17 Correct 371 ms 35180 KB Output is correct
18 Incorrect 1378 ms 35308 KB Output isn't correct
19 Halted 0 ms 0 KB -