oj.uz

답안 #336289

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
336289 2020-12-15T03:47:07 Z beksultan04 Bigger segments (IZhO19_segments) C++14
13 / 100
 1500 ms 42220 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 = 1000291,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

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 31724 KB Output is correct
2 Correct 26 ms 31724 KB Output is correct
3 Correct 24 ms 31596 KB Output is correct
4 Correct 23 ms 31724 KB Output is correct
5 Correct 21 ms 32364 KB Output is correct
6 Correct 20 ms 32236 KB Output is correct
7 Correct 20 ms 31980 KB Output is correct
8 Correct 20 ms 31724 KB Output is correct
9 Correct 20 ms 31852 KB Output is correct
10 Correct 21 ms 32108 KB Output is correct
11 Correct 25 ms 31852 KB Output is correct
12 Correct 26 ms 31852 KB Output is correct
13 Correct 20 ms 31852 KB Output is correct
14 Correct 20 ms 31852 KB Output is correct
15 Correct 20 ms 31980 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 31724 KB Output is correct
2 Correct 26 ms 31724 KB Output is correct
3 Correct 24 ms 31596 KB Output is correct
4 Correct 23 ms 31724 KB Output is correct
5 Correct 21 ms 32364 KB Output is correct
6 Correct 20 ms 32236 KB Output is correct
7 Correct 20 ms 31980 KB Output is correct
8 Correct 20 ms 31724 KB Output is correct
9 Correct 20 ms 31852 KB Output is correct
10 Correct 21 ms 32108 KB Output is correct
11 Correct 25 ms 31852 KB Output is correct
12 Correct 26 ms 31852 KB Output is correct
13 Correct 20 ms 31852 KB Output is correct
14 Correct 20 ms 31852 KB Output is correct
15 Correct 20 ms 31980 KB Output is correct
16 Correct 26 ms 36332 KB Output is correct
17 Correct 479 ms 42220 KB Output is correct
18 Execution timed out 1586 ms 42092 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 31724 KB Output is correct
2 Correct 26 ms 31724 KB Output is correct
3 Correct 24 ms 31596 KB Output is correct
4 Correct 23 ms 31724 KB Output is correct
5 Correct 21 ms 32364 KB Output is correct
6 Correct 20 ms 32236 KB Output is correct
7 Correct 20 ms 31980 KB Output is correct
8 Correct 20 ms 31724 KB Output is correct
9 Correct 20 ms 31852 KB Output is correct
10 Correct 21 ms 32108 KB Output is correct
11 Correct 25 ms 31852 KB Output is correct
12 Correct 26 ms 31852 KB Output is correct
13 Correct 20 ms 31852 KB Output is correct
14 Correct 20 ms 31852 KB Output is correct
15 Correct 20 ms 31980 KB Output is correct
16 Correct 26 ms 36332 KB Output is correct
17 Correct 479 ms 42220 KB Output is correct
18 Execution timed out 1586 ms 42092 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 31724 KB Output is correct
2 Correct 26 ms 31724 KB Output is correct
3 Correct 24 ms 31596 KB Output is correct
4 Correct 23 ms 31724 KB Output is correct
5 Correct 21 ms 32364 KB Output is correct
6 Correct 20 ms 32236 KB Output is correct
7 Correct 20 ms 31980 KB Output is correct
8 Correct 20 ms 31724 KB Output is correct
9 Correct 20 ms 31852 KB Output is correct
10 Correct 21 ms 32108 KB Output is correct
11 Correct 25 ms 31852 KB Output is correct
12 Correct 26 ms 31852 KB Output is correct
13 Correct 20 ms 31852 KB Output is correct
14 Correct 20 ms 31852 KB Output is correct
15 Correct 20 ms 31980 KB Output is correct
16 Correct 26 ms 36332 KB Output is correct
17 Correct 479 ms 42220 KB Output is correct
18 Execution timed out 1586 ms 42092 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 31724 KB Output is correct
2 Correct 26 ms 31724 KB Output is correct
3 Correct 24 ms 31596 KB Output is correct
4 Correct 23 ms 31724 KB Output is correct
5 Correct 21 ms 32364 KB Output is correct
6 Correct 20 ms 32236 KB Output is correct
7 Correct 20 ms 31980 KB Output is correct
8 Correct 20 ms 31724 KB Output is correct
9 Correct 20 ms 31852 KB Output is correct
10 Correct 21 ms 32108 KB Output is correct
11 Correct 25 ms 31852 KB Output is correct
12 Correct 26 ms 31852 KB Output is correct
13 Correct 20 ms 31852 KB Output is correct
14 Correct 20 ms 31852 KB Output is correct
15 Correct 20 ms 31980 KB Output is correct
16 Correct 26 ms 36332 KB Output is correct
17 Correct 479 ms 42220 KB Output is correct
18 Execution timed out 1586 ms 42092 KB Time limit exceeded
19 Halted 0 ms 0 KB -